aGrUM  0.17.2
a C++ library for (probabilistic) graphical models
unconstrainedEliminationSequenceStrategy.cpp
Go to the documentation of this file.
1 
33 
34 namespace gum {
35 
39  // for debugging purposes
41  }
42 
46  UndiGraph* graph, const NodeProperty< Size >* dom_sizes) :
47  EliminationSequenceStrategy(graph, dom_sizes) {
48  // for debugging purposes
50  }
51 
57  // for debugging purposes
59  }
60 
65  EliminationSequenceStrategy(std::move(from)) {
66  // for debugging purposes
68  }
69 
73  // for debugging purposes
75  }
76 
77 } /* namespace gum */
STL namespace.
Copyright 2005-2020 Pierre-Henri WUILLEMIN () et Christophe GONZALES () info_at_agrum_dot_org.
Definition: agrum.h:25
The class for generic Hash Tables.
Definition: hashTable.h:679
UndiGraph * graph() const noexcept
returns the current graph
Copyright 2005-2020 Pierre-Henri WUILLEMIN () et Christophe GONZALES () info_at_agrum_dot_org.
The base class for all elimination sequence algorithms used by triangulation algorithms.
Base class for undirected graphs.
Definition: undiGraph.h:109
The base class for all elimination sequence algorithms that require only the graph to be triangulated...