triangulations Directory Reference

Directory dependency graph for triangulations:

Directories
directory	eliminationStrategies
directory	junctionTreeStrategies

Files
file	defaultTriangulation.cpp [code]
	source implementations for computing default triangulations of graphs
file	defaultTriangulation.h [code]
	Class for computing default triangulations of graphs.
file	incrementalTriangulation.cpp [code]
	source implementations for computing default triangulations of graphs
file	incrementalTriangulation.h [code]
	Class for computing default triangulations of graphs.
file	incrementalTriangulation_inl.h [code]
	Inline implementations for computing default triangulations of graphs.
file	orderedTriangulation.cpp [code]
	class for graph triangulations for which we enforce a given complete ordering on the nodes eliminations.
file	orderedTriangulation.h [code]
	class for graph triangulations for which we enforce a given complete ordering on the nodes eliminations.
file	partialOrderedTriangulation.cpp [code]
	class for graph triangulations for which we enforce a given partial ordering on the nodes eliminations.
file	partialOrderedTriangulation.h [code]
	class for graph triangulations for which we enforce a given partial ordering on the nodes eliminations, that is, the set of all the nodes is divided into several subsets.
file	staticTriangulation.cpp [code]
	base class for graph non-incremental triangulations.
file	staticTriangulation.h [code]
	base class for all non-incremental triangulations.
file	staticTriangulation_inl.h [code]
	Inline implementations for computing default triangulations of graphs.
file	triangulation.cpp [code]
	Abstract base class for computing triangulations of graphs.
file	triangulation.h [code]
	Abstract base class for computing triangulations of graphs.
file	triangulation_inl.h [code]
	Abstract base class for computing triangulations of graphs.
file	unconstrainedTriangulation.cpp [code]
	base class for graph triangulations without constraints on nodes elimination ordering.
file	unconstrainedTriangulation.h [code]
	base class for graph triangulations without constraints on nodes elimination ordering.