partialOrderedEliminationSequenceStrategy.cpp File Reference

Base class for all elimination sequence algorithm that impose a given partial ordering on the nodes elimination sequence, that is, the set of all the nodes is divided into several subsets. More...

#include <agrum/graphs/algorithms/triangulations/eliminationStrategies/partialOrderedEliminationSequenceStrategy.h>

Include dependency graph for partialOrderedEliminationSequenceStrategy.cpp:

Go to the source code of this file.

Namespaces
	gum
	gum is the global namespace for all aGrUM entities

Detailed Description

Base class for all elimination sequence algorithm that impose a given partial ordering on the nodes elimination sequence, that is, the set of all the nodes is divided into several subsets.

Within each subset, any ordering can be chosen. But all the nodes of the first subset must be eliminated before the nodes of the second, which must be eliminated before those of the third subset, and so on.

Author

Christophe GONZALES and Pierre-Henri WUILLEMIN

Definition in file partialOrderedEliminationSequenceStrategy.cpp.