aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
eliminationStrategies Directory Reference
Directory dependency graph for eliminationStrategies:

Files

 
defaultEliminationSequenceStrategy.cpp
 An efficient unconstrained elimination sequence algorithm.
 
defaultEliminationSequenceStrategy.h
 An efficient unconstrained elimination sequence algorithm.
 
defaultPartialOrderedEliminationSequenceStrategy.cpp
 An efficient unconstrained elimination sequence algorithm.
 
defaultPartialOrderedEliminationSequenceStrategy.h
 An Elimination sequence algorithm that imposes a given partial ordering on the nodes elimination sequence.
 
eliminationSequenceStrategy.cpp
 implementation of the base class for all elimination sequence algorithms
 
eliminationSequenceStrategy.h
 Base Class for all elimination sequence algorithms used by triangulations.
 
eliminationSequenceStrategy_inl.h
 Base Class for all elimination sequence algorithms used by triangulations.
 
orderedEliminationSequenceStrategy.cpp
 An Elimination sequence algorithm that imposes a given complete ordering on the nodes elimination sequence.
 
orderedEliminationSequenceStrategy.h
 An Elimination sequence algorithm that imposes a given complete ordering on the nodes elimination sequence.
 
orderedEliminationSequenceStrategy_inl.h
 An Elimination sequence algorithm that imposes a given complete ordering on the nodes elimination sequence.
 
partialOrderedEliminationSequenceStrategy.cpp
 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.
 
partialOrderedEliminationSequenceStrategy.h
 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.
 
partialOrderedEliminationSequenceStrategy_inl.h
 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.
 
unconstrainedEliminationSequenceStrategy.cpp
 Base Class for all elimination sequence algorithms that require only the graph to be triangulated and the nodes domain sizes to produce the node elimination ordering.
 
unconstrainedEliminationSequenceStrategy.h
 Base Class for all elimination sequence algorithms that require only the graph to be triangulated and the nodes' domain sizes to produce the node elimination ordering.