aGrUM  0.14.2
incrementalTriangulation_inl.h
Go to the documentation of this file.
1 /***************************************************************************
2  * Copyright (C) 2005 by Christophe GONZALES and Pierre-Henri WUILLEMIN *
3  * {prenom.nom}_at_lip6.fr *
4  * *
5  * This program is free software; you can redistribute it and/or modify *
6  * it under the terms of the GNU General Public License as published by *
7  * the Free Software Foundation; either version 2 of the License, or *
8  * (at your option) any later version. *
9  * *
10  * This program is distributed in the hope that it will be useful, *
11  * but WITHOUT ANY WARRANTY; without even the implied warranty of *
12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
13  * GNU General Public License for more details. *
14  * *
15  * You should have received a copy of the GNU General Public License *
16  * along with this program; if not, write to the *
17  * Free Software Foundation, Inc., *
18  * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
19  ***************************************************************************/
20 
27 #ifndef DOXYGEN_SHOULD_SKIP_THIS
29 
30 namespace gum {
31 
32  /* ===========================================================================
33  */
34  /* ===========================================================================
35  */
36  /* === CLASS FOR COMPUTING INCREMENTAL TRIANGULATIONS ===
37  */
38  /* ===========================================================================
39  */
40  /* ===========================================================================
41  */
42 
44 
45  INLINE
46  const CliqueGraph& IncrementalTriangulation::junctionTree() {
48  return __junction_tree;
49  }
50 
52 
53  INLINE
56  return __T_mpd;
57  }
58 
60 
61  INLINE const UnconstrainedTriangulation&
63  return *__triangulation;
64  }
65 
67 
68  INLINE const UndiGraph& IncrementalTriangulation::graph() const {
69  return __graph;
70  }
71 
72 } /* namespace gum */
73 
74 #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
gum is the global namespace for all aGrUM entities
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
Class for computing default triangulations of graphs.
UndiGraph __graph
the graph that needs be triangulated
const CliqueGraph & maxPrimeSubgraphTree()
returns the junction tree of the maximal prime subgraphs