49#ifndef DOXYGEN_SHOULD_SKIP_THIS
UndiGraph _graph_
the graph that needs be triangulated
CliqueGraph _junction_tree_
the junction tree computed so far
const CliqueGraph & maxPrimeSubgraphTree()
returns the junction tree of the maximal prime subgraphs
CliqueGraph _T_mpd_
the maximal prime subgraph tree
const UndiGraph & graph() const
returns the current graph (that which is incrementally triangulated)
const CliqueGraph & junctionTree()
returns a junction tree corresponding to the current graph
UnconstrainedTriangulation * _triangulation_
the triangulation algorithm that will be used incremantally
void updateTriangulation()
updates the triangulated graph using the modif list
const UnconstrainedTriangulation & triangulationAlgo() const
returns the triangulation algorithm (useful for fine tuning it)
Interface for all triangulation methods without constraints on node elimination orderings.
Base class for undirected graphs.
Class for computing default triangulations of graphs.
gum is the global namespace for all aGrUM entities