aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
defaultJunctionTreeStrategy.h
Go to the documentation of this file.
1/****************************************************************************
2 * This file is part of the aGrUM/pyAgrum library. *
3 * *
4 * Copyright (c) 2005-2025 by *
5 * - Pierre-Henri WUILLEMIN(_at_LIP6) *
6 * - Christophe GONZALES(_at_AMU) *
7 * *
8 * The aGrUM/pyAgrum library is free software; you can redistribute it *
9 * and/or modify it under the terms of either : *
10 * *
11 * - the GNU Lesser General Public License as published by *
12 * the Free Software Foundation, either version 3 of the License, *
13 * or (at your option) any later version, *
14 * - the MIT license (MIT), *
15 * - or both in dual license, as here. *
16 * *
17 * (see https://agrum.gitlab.io/articles/dual-licenses-lgplv3mit.html) *
18 * *
19 * This aGrUM/pyAgrum library is distributed in the hope that it will be *
20 * useful, but WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, *
21 * INCLUDING BUT NOT LIMITED TO THE WARRANTIES MERCHANTABILITY or FITNESS *
22 * FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE *
23 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER *
24 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, *
25 * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR *
26 * OTHER DEALINGS IN THE SOFTWARE. *
27 * *
28 * See LICENCES for more details. *
29 * *
30 * SPDX-FileCopyrightText: Copyright 2005-2025 *
31 * - Pierre-Henri WUILLEMIN(_at_LIP6) *
32 * - Christophe GONZALES(_at_AMU) *
33 * SPDX-License-Identifier: LGPL-3.0-or-later OR MIT *
34 * *
35 * Contact : info_at_agrum_dot_org *
36 * homepage : http://agrum.gitlab.io *
37 * gitlab : https://gitlab.com/agrumery/agrum *
38 * *
39 ****************************************************************************/
40
41
48
49#ifndef GUM_DEFAULT_JUNCTION_TREE_STRATEGY_H
50#define GUM_DEFAULT_JUNCTION_TREE_STRATEGY_H
51
53
54namespace gum {
55
64 public:
65 // ############################################################################
67 // ############################################################################
69
72
75
78
81
83 virtual DefaultJunctionTreeStrategy* newFactory() const final;
84
86
90 = nullptr) const final;
91
93
94
95 // ############################################################################
97 // ############################################################################
99
106 virtual bool requiresFillIns() const final;
107
109
119 virtual const CliqueGraph& junctionTree() final;
120
122
126 virtual void setTriangulation(StaticTriangulation* triangulation) final;
127
132 virtual const NodeProperty< NodeId >& createdCliques() final;
133
140 virtual NodeId createdClique(const NodeId id) final;
141
143 virtual void clear() final;
144
146
147 private:
150
153
157
160 };
161
162} /* namespace gum */
163
164#endif /* GUM_DEFAULT_JUNCTION_TREE_STRATEGY_H */
Basic graph of cliques.
Definition cliqueGraph.h:77
virtual const NodeProperty< NodeId > & createdCliques() final
returns, for each node, the clique of the junction tree which was created by its deletion
bool _has_junction_tree_
a boolean indicating whether the junction tree has been constructed
virtual DefaultJunctionTreeStrategy * newFactory() const final
create a clone not assigned to any triangulation algorithm
virtual DefaultJunctionTreeStrategy * copyFactory(StaticTriangulation *triangulation=nullptr) const final
virtual copy constructor
NodeProperty< NodeId > _node_2_junction_clique_
indicates which clique of the junction tree was created by the elimination of a given node (the key o...
void _computeJunctionTree_()
computes a junction tree from an elimination tree
CliqueGraph _junction_tree_
the junction tree computed by the algorithm
virtual void setTriangulation(StaticTriangulation *triangulation) final
assigns the triangulation to the junction tree strategy
virtual NodeId createdClique(const NodeId id) final
returns the Id of the clique of the junction tree created by the elimination of a given node during t...
virtual bool requiresFillIns() const final
indicates whether the junction tree strategy needs fill-ins to work properly
virtual void clear() final
resets the current junction tree strategy data structures
virtual const CliqueGraph & junctionTree() final
returns the junction tree computed
JunctionTreeStrategy()
default constructor
base class for all non-incremental triangulation methods
Size NodeId
Type for node ids.
HashTable< NodeId, VAL > NodeProperty
Property on graph elements.
Base Class for all the algorithms producing a junction given a set of cliques/subcliques resulting fr...
gum is the global namespace for all aGrUM entities
Definition agrum.h:46