aGrUM  0.16.0
staticTriangulation_inl.h
Go to the documentation of this file.
1 
29 #ifndef DOXYGEN_SHOULD_SKIP_THIS
30 
31 
32 namespace gum {
33 
34 
36  INLINE
37  const std::vector< NodeId >& StaticTriangulation::eliminationOrder() {
39 
40  return __elim_order;
41  }
42 
43 
46  INLINE
49 
50  return __reverse_elim_order[id];
51  }
52 
53 
56  INLINE
57  const NodeProperty< NodeId >& StaticTriangulation::reverseEliminationOrder() {
59 
60  return __reverse_elim_order;
61  }
62 
63 
65  INLINE
66  const CliqueGraph& StaticTriangulation::eliminationTree() {
68 
69  return __elim_tree;
70  }
71 
72 
74  INLINE
75  const CliqueGraph& StaticTriangulation::junctionTree() {
76  // checks if junctionTree already exists
77  if (!__has_junction_tree) {
79  __has_junction_tree = true;
80  }
81 
82  return *__junction_tree;
83  }
84 
85 
87  INLINE
88  const CliqueGraph& StaticTriangulation::maxPrimeSubgraphTree() {
90 
92  }
93 
94 
97  INLINE
100 
101  return __node_2_max_prime_clique[id];
102  }
103 
104 
107  INLINE
110  }
111 
112 
115  INLINE
116  const NodeProperty< NodeId >& StaticTriangulation::createdJunctionTreeCliques() {
118  }
119 
120 
122  INLINE
123  void StaticTriangulation::setFillIns(bool b) {
124  __we_want_fill_ins = b;
126  }
127 
128 
130  INLINE
131  const UndiGraph* StaticTriangulation::originalGraph() const {
132  return __original_graph;
133  }
134 
135 
137  INLINE EliminationSequenceStrategy&
140  }
141 
142 
144  INLINE JunctionTreeStrategy& StaticTriangulation::junctionTreeStrategy() const {
145  return *_junction_tree_strategy;
146  }
147 
148 
150  INLINE bool StaticTriangulation::isMinimalityRequired() const {
151  return __minimality_required;
152  }
153 
154 
155 } /* namespace gum */
156 
157 
158 #endif /* DOXYGEN_SHOULD_SKIP_THIS */
const CliqueGraph & junctionTree()
returns a compatible junction tree
virtual const NodeProperty< NodeId > & createdCliques()=0
returns, for each node, the clique of the junction tree which was created by its deletion ...
const UndiGraph * originalGraph() const
returns the graph to be triangulated
virtual bool isMinimalityRequired() const final
indicates wether minimality is required
NodeProperty< NodeId > __node_2_max_prime_clique
indicates which clique of the max prime junction tree was created by the elmination of a given node (...
void __triangulate()
the function that performs the triangulation
bool __has_max_prime_junction_tree
indicates whether a maximal prime subgraph junction tree has been constructed
EliminationSequenceStrategy * _elimination_sequence_strategy
the elimination sequence strategy used by the triangulation
const UndiGraph * __original_graph
a pointer to the (external) original graph (which will be triangulated)
void __computeMaxPrimeJunctionTree()
computes the junction tree of the maximal prime subgraphs
JunctionTreeStrategy * _junction_tree_strategy
the junction tree strategy used by the triangulation
NodeId createdMaxPrimeSubgraph(const NodeId id)
returns the Id of the maximal prime subgraph created by the elimination of a given node during the tr...
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
Definition: agrum.h:25
NodeProperty< NodeId > __reverse_elim_order
the elimination order (access by NodeId)
JunctionTreeStrategy & junctionTreeStrategy() const
returns the junction tree strategy used by the triangulation
bool __has_triangulation
a boolean indicating whether we have parformed a triangulation
const CliqueGraph & eliminationTree()
returns the elimination tree of a compatible ordering
bool __has_junction_tree
a boolean indicating whether the junction tree has been constructed
void setFillIns(bool)
sets/unsets the record of the fill-ins in the standard triangulation procedure
const NodeProperty< NodeId > & reverseEliminationOrder()
returns a table indicating, for each node, at which step it was deleted by the triangulation process ...
CliqueGraph __max_prime_junction_tree
the maximal prime subgraph junction tree computed from the junction tree
const std::vector< NodeId > & eliminationOrder()
returns an elimination ordering compatible with the triangulated graph
EliminationSequenceStrategy & eliminationSequenceStrategy() const
returns the elimination sequence strategy used by the triangulation
const NodeProperty< NodeId > & createdJunctionTreeCliques()
returns the Ids of the cliques of the junction tree created by the elimination of the nodes ...
bool __we_want_fill_ins
a boolean indicating if we want fill-ins list with the standard triangulation method ...
bool __minimality_required
indicates whether the triangulation must be minimal
const CliqueGraph * __junction_tree
the junction tree computed by the algorithm
void __computeEliminationTree()
returns an elimination tree from a triangulated graph
bool __has_elimination_tree
a boolean indicating whether the elimination tree has been computed
virtual NodeId createdClique(const NodeId id)=0
returns the Id of the clique of the junction tree created by the elimination of a given node during t...
virtual const CliqueGraph & junctionTree()=0
returns the junction tree computed
std::vector< NodeId > __elim_order
the order in which nodes are eliminated by the algorithm
const CliqueGraph & maxPrimeSubgraphTree()
returns a junction tree of maximal prime subgraphs
Size NodeId
Type for node ids.
Definition: graphElements.h:98
NodeId createdJunctionTreeClique(const NodeId id)
returns the Id of the clique of the junction tree created by the elimination of a given node during t...
CliqueGraph __elim_tree
the elimination tree computed by the algorithm
virtual void askFillIns(bool do_it)=0
if the elimination sequence is able to compute fill-ins, we indicate whether we want this feature to ...