![]() |
aGrUM
0.14.2
|
An Elimination sequence algorithm that imposes a given partial ordering on the nodes elimination sequence. More...
#include <agrum/core/priorityQueue.h>
#include <agrum/graphs/algorithms/simplicialSet.h>
#include <agrum/graphs/algorithms/triangulations/eliminationStrategies/partialOrderedEliminationSequenceStrategy.h>
#include <agrum/graphs/graphElements.h>
Go to the source code of this file.
Classes | |
class | gum::DefaultPartialOrderedEliminationSequenceStrategy |
An Elimination sequence algorithm that imposes a given partial ordering on the nodes elimination sequence. More... | |
Namespaces | |
gum | |
gum is the global namespace for all aGrUM entities | |
An Elimination sequence algorithm that imposes a given partial ordering on the nodes elimination sequence.
Class DefaultPartialOrderedEliminationSequenceStrategy implements an elimination sequence algorithm that satisfies a partial ordering, that is, the set of all the nodes is divided into several subsets. 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. Within a subset, the ordering is determined as follows:
their neighbors) are eliminated first
neighbors, they become simplicial) and that create small cliques, are eliminated (see Bodlaender's safe reductions)
fill-ins to create cliques) that would create small cliques, are eliminated
last nodes to be eliminated.
Definition in file defaultPartialOrderedEliminationSequenceStrategy.h.