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

Directories

 
eliminationStrategies
 
junctionTreeStrategies

Files

 
defaultTriangulation.cpp
 source implementations for computing default triangulations of graphs
 
defaultTriangulation.h
 Class for computing default triangulations of graphs.
 
incrementalTriangulation.cpp
 source implementations for computing default triangulations of graphs
 
incrementalTriangulation.h
 Class for computing default triangulations of graphs.
 
incrementalTriangulation_inl.h
 Inline implementations for computing default triangulations of graphs.
 
orderedTriangulation.cpp
 class for graph triangulations for which we enforce a given complete ordering on the nodes eliminations.
 
orderedTriangulation.h
 class for graph triangulations for which we enforce a given complete ordering on the nodes eliminations.
 
partialOrderedTriangulation.cpp
 class for graph triangulations for which we enforce a given partial ordering on the nodes eliminations.
 
partialOrderedTriangulation.h
 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.
 
staticTriangulation.cpp
 base class for graph non-incremental triangulations.
 
staticTriangulation.h
 base class for all non-incremental triangulations.
 
staticTriangulation_inl.h
 Inline implementations for computing default triangulations of graphs.
 
triangulation.cpp
 Abstract base class for computing triangulations of graphs.
 
triangulation.h
 Abstract base class for computing triangulations of graphs.
 
triangulation_inl.h
 Abstract base class for computing triangulations of graphs.
 
unconstrainedTriangulation.cpp
 base class for graph triangulations without constraints on nodes elimination ordering.
 
unconstrainedTriangulation.h
 base class for graph triangulations without constraints on nodes elimination ordering.