aGrUM  0.16.0
orderedEliminationSequenceStrategy_inl.h
Go to the documentation of this file.
1 
30 namespace gum {
31 
32 
33  // returns the current complete ordering
34  INLINE const std::vector< NodeId >*
36  return __order;
37  }
38 
39 
40  // indicates whether a new complete ordering is needed
42  return __order_needed;
43  }
44 
45 
46 } /* namespace gum */
bool isOrderNeeded() const noexcept
indicates whether a new complete ordering is needed
bool __order_needed
indicate whether a new complete ordering is necessary for the elimination
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Definition: agrum.h:25
const std::vector< NodeId > * order() const noexcept
returns the current complete ordering
const std::vector< NodeId > * __order
the vector indicating in which order we should eliminate the nodes