eliminationStrategies Directory Reference

Directory dependency graph for eliminationStrategies:

Files
file	defaultEliminationSequenceStrategy.cpp [code]
	An efficient unconstrained elimination sequence algorithm.
file	defaultEliminationSequenceStrategy.h [code]
	An efficient unconstrained elimination sequence algorithm.
file	defaultPartialOrderedEliminationSequenceStrategy.cpp [code]
	An efficient unconstrained elimination sequence algorithm.
file	defaultPartialOrderedEliminationSequenceStrategy.h [code]
	An Elimination sequence algorithm that imposes a given partial ordering on the nodes elimination sequence.
file	eliminationSequenceStrategy.cpp [code]
	implementation of the base class for all elimination sequence algorithms
file	eliminationSequenceStrategy.h [code]
	Base Class for all elimination sequence algorithms used by triangulations.
file	eliminationSequenceStrategy_inl.h [code]
	Base Class for all elimination sequence algorithms used by triangulations.
file	orderedEliminationSequenceStrategy.cpp [code]
	An Elimination sequence algorithm that imposes a given complete ordering on the nodes elimination sequence.
file	orderedEliminationSequenceStrategy.h [code]
	An Elimination sequence algorithm that imposes a given complete ordering on the nodes elimination sequence.
file	orderedEliminationSequenceStrategy_inl.h [code]
	An Elimination sequence algorithm that imposes a given complete ordering on the nodes elimination sequence.
file	partialOrderedEliminationSequenceStrategy.cpp [code]
	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.
file	partialOrderedEliminationSequenceStrategy.h [code]
	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.
file	partialOrderedEliminationSequenceStrategy_inl.h [code]
	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.
file	unconstrainedEliminationSequenceStrategy.cpp [code]
	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.
file	unconstrainedEliminationSequenceStrategy.h [code]
	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.