algorithms Directory Reference

Directory dependency graph for algorithms:

Directories
directory	triangulations

Files
file	binaryJoinTreeConverter.cpp [code]
	Interface for converting a join tree into a binary join tree.
file	binaryJoinTreeConverter.h [code]
	The base interface for converting a join tree into a binary join tree.
file	binaryJoinTreeConverterDefault.cpp [code]
	An algorithm for converting a join tree into a binary join tree.
file	binaryJoinTreeConverterDefault.h [code]
	An algorithm for converting a join tree into a binary join tree.
file	DAGCycleDetector.cpp [code]
	A class for detecting directed cycles in DAGs when trying to apply many changes to the graph.
file	DAGCycleDetector.h [code]
	A class for detecting directed cycles in DAGs when trying to apply many changes to the graph.
file	DAGCycleDetector_inl.h [code]
	A class for detecting directed cycles in DAGs when trying to apply many changes to the graph.
file	simplicialSet.cpp [code]
	source implementations of simplicial set
file	simplicialSet.h [code]
	Class for fast retrieval of simplicial and quasi/almost simplicial nodes.
file	simplicialSet_inl.h [code]
	inline implementations of simplicial set
file	spanningForest.cpp [code]
	Interface for computing min cost spanning trees or forests.
file	spanningForest.h [code]
	Interface for computing min cost spanning trees or forests.
file	spanningForestPrim.cpp [code]
	The Prim algorithm for computing min cost spanning trees or forests.
file	spanningForestPrim.h [code]
	The Prim algorithm for computing min cost spanning trees or forests.