dd/d9d/DAG_8h_source.html

 #ifndef GUM_DAG_H
 #define GUM_DAG_H

 #include <agrum/graphs/undiGraph.h>
 #include <agrum/graphs/diGraph.h>

 namespace gum {

   /* ====================================================================== */
   /* ===      BASE CLASS FOR MANIPULATING GRAPHS WITH BOTH EDGES AND ARCS     */
   /* ====================================================================== */
   /* ====================================================================== */
   class DAG : public DiGraph {
     public:
     // ############################################################################
     // ############################################################################


     explicit DAG(Size nodes_size = HashTableConst::default_size,
                  bool nodes_resize_policy = true,
                  Size arcs_size = HashTableConst::default_size,
                  bool arcs_resize_policy = true);


     DAG(const DAG& g);

     virtual ~DAG();


     // ############################################################################
     // ############################################################################


     DAG& operator=(const DAG& g);


     // ############################################################################
     // ############################################################################


     virtual void addArc(const NodeId tail, const NodeId head);

     UndiGraph moralGraph() const;
   };

 } /* namespace gum */

 #ifndef GUM_NO_INLINE
 #  include <agrum/graphs/DAG_inl.h>
 #endif   // GUM_NOINLINE

 #endif /* GUM_DAG_H */
diGraph.h
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.

gum::DAG::moralGraph
UndiGraph moralGraph() const
Definition: DAG.cpp:52

gum::HashTableConst::default_size
static constexpr Size default_size
The default number of slots in hashtables.
Definition: hashTable.h:80

DAG_inl.h
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.

undiGraph.h
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.

gum::DAG::operator=
DAG & operator=(const DAG &g)
copy operator
Definition: DAG_inl.h:36

gum
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Definition: agrum.h:25

gum::DAG::~DAG
virtual ~DAG()
destructor
Definition: DAG.cpp:50

gum::DAG::DAG
DAG(Size nodes_size=HashTableConst::default_size, bool nodes_resize_policy=true, Size arcs_size=HashTableConst::default_size, bool arcs_resize_policy=true)
default constructor
Definition: DAG.cpp:38

gum::DiGraph
Base class for all oriented graphs.
Definition: diGraph.h:111

gum::DAG::addArc
virtual void addArc(const NodeId tail, const NodeId head)
insert a new arc into the directed graph
Definition: DAG_inl.h:43

gum::UndiGraph
Base class for undirected graphs.
Definition: undiGraph.h:109

gum::Size
std::size_t Size
In aGrUM, hashed values are unsigned long int.
Definition: types.h:48

gum::DAG
Base class for dag.
Definition: DAG.h:102

gum::NodeId
Size NodeId
Type for node ids.
Definition: graphElements.h:98