d9/df5/eliminationSequenceStrategy__inl_8h_source.html

 namespace gum {


   INLINE UndiGraph* EliminationSequenceStrategy::graph() const noexcept {
     return _graph;
   }


   INLINE const NodeProperty< Size >*
                EliminationSequenceStrategy::domainSizes() const noexcept {
     return _domain_sizes;
   }


 } /* namespace gum */
gum::EliminationSequenceStrategy::_graph
UndiGraph * _graph
the graph to be triangulated
Definition: eliminationSequenceStrategy.h:156

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

gum::HashTable
The class for generic Hash Tables.
Definition: hashTable.h:679

gum::EliminationSequenceStrategy::graph
UndiGraph * graph() const noexcept
returns the current graph
Definition: eliminationSequenceStrategy_inl.h:37

gum::EliminationSequenceStrategy::domainSizes
const NodeProperty< Size > * domainSizes() const noexcept
returns the current domain sizes
Definition: eliminationSequenceStrategy_inl.h:44

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

gum::EliminationSequenceStrategy::_domain_sizes
const NodeProperty< Size > * _domain_sizes
the domain sizes of the variables/nodes
Definition: eliminationSequenceStrategy.h:159