aGrUM  0.16.0
incrementalTriangulation_inl.h
Go to the documentation of this file.
1 
29 #ifndef DOXYGEN_SHOULD_SKIP_THIS
31 
32 namespace gum {
33 
34  /* ===========================================================================
35  */
36  /* ===========================================================================
37  */
38  /* === CLASS FOR COMPUTING INCREMENTAL TRIANGULATIONS ===
39  */
40  /* ===========================================================================
41  */
42  /* ===========================================================================
43  */
44 
46 
47  INLINE
48  const CliqueGraph& IncrementalTriangulation::junctionTree() {
50  return __junction_tree;
51  }
52 
54 
55  INLINE
58  return __T_mpd;
59  }
60 
62 
63  INLINE const UnconstrainedTriangulation&
65  return *__triangulation;
66  }
67 
69 
70  INLINE const UndiGraph& IncrementalTriangulation::graph() const {
71  return __graph;
72  }
73 
74 } /* namespace gum */
75 
76 #endif /* DOXYGEN_SHOULD_SKIP_THIS */
const CliqueGraph & junctionTree()
returns a junction tree corresponding to the current graph
CliqueGraph __T_mpd
the maximal prime subgraph tree
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Definition: agrum.h:25
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)
const UndiGraph & graph() const
returns the current graph (that which is incrementally triangulated)
CliqueGraph __junction_tree
the junction tree computed so far
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
UndiGraph __graph
the graph that needs be triangulated
const CliqueGraph & maxPrimeSubgraphTree()
returns the junction tree of the maximal prime subgraphs