51#ifndef DOXYGEN_SHOULD_SKIP_THIS
96 GUM_ERROR(OperationNotAllowed,
"Not implemented yet")}
101 GUM_ERROR(OperationNotAllowed,
"Not implemented yet")}
106 GUM_ERROR(OperationNotAllowed,
"Not implemented yet")
UndiGraph _graph_
the graph that needs be triangulated
const UndiGraph & triangulatedGraph() override
returns the triangulated graph
const CliqueGraph & junctionTree() override
returns a junction tree corresponding to the current graph
CliqueGraph _junction_tree_
the junction tree computed so far
const CliqueGraph & maxPrimeSubgraphTree() override
returns the junction tree of the maximal prime subgraphs
const CliqueGraph & eliminationTree() override
returns the elimination tree of a compatible ordering
CliqueGraph _T_mpd_
the maximal prime subgraph tree
const UndiGraph & graph() const
returns the current graph (that which is incrementally triangulated)
const EdgeSet & fillIns() override
returns the fill-ins added by the triangulation algorithm
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.
#define GUM_ERROR(type, msg)
Set< Edge > EdgeSet
Some typdefs and define for shortcuts ...
Class for computing default triangulations of graphs.
gum is the global namespace for all aGrUM entities