aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
junctionTreeStrategy.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_JUNCTION_TREE_STRATEGY_H
50#define GUM_JUNCTION_TREE_STRATEGY_H
51
52#include <agrum/agrum.h>
53
55
56namespace gum {
57
59
67 public:
68 // ############################################################################
70 // ############################################################################
72
74 virtual ~JunctionTreeStrategy();
75
77 virtual JunctionTreeStrategy* newFactory() const = 0;
78
80
83 virtual JunctionTreeStrategy* copyFactory(StaticTriangulation* triangulation = nullptr) const
84 = 0;
85
87
88
89 // ############################################################################
91 // ############################################################################
93
100 virtual bool requiresFillIns() const = 0;
101
103
111 virtual const CliqueGraph& junctionTree() = 0;
112
114 virtual void setTriangulation(StaticTriangulation* triangulation) = 0;
115
118 virtual void moveTriangulation(StaticTriangulation* triangulation);
119
123
126 virtual NodeId createdClique(const NodeId id) = 0;
127
129 virtual void clear() = 0;
130
132
133
134 protected:
137
138
139 // ############################################################################
141 // ############################################################################
143
146
149
152
154 };
155
156} /* namespace gum */
157
158#endif /* GUM_JUNCTION_TREE_STRATEGY_H */
Basic graph of cliques.
Definition cliqueGraph.h:77
Base Class for all the algorithms producing a junction given a set of cliques/subcliques resulting fr...
virtual JunctionTreeStrategy * newFactory() const =0
create a clone not assigned to any triangulation algorithm
JunctionTreeStrategy()
default constructor
virtual ~JunctionTreeStrategy()
destructor
StaticTriangulation * triangulation_
the triangulation to which the junction tree is associated
virtual const CliqueGraph & junctionTree()=0
returns the junction tree computed
virtual bool requiresFillIns() const =0
indicates whether the junction tree strategy needs fill-ins to work properly
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 void moveTriangulation(StaticTriangulation *triangulation)
assigns a new triangulation to the junction tree strategy during a move construction
virtual const NodeProperty< NodeId > & createdCliques()=0
returns, for each node, the clique of the junction tree which was created by its deletion
virtual void clear()=0
resets the current junction tree strategy data structures
virtual void setTriangulation(StaticTriangulation *triangulation)=0
assigns the triangulation to the junction tree strategy
virtual JunctionTreeStrategy * copyFactory(StaticTriangulation *triangulation=nullptr) const =0
virtual copy constructor
base class for all non-incremental triangulation methods
Basic class for all graphs of cliques (join trees, etc).
Size NodeId
Type for node ids.
HashTable< NodeId, VAL > NodeProperty
Property on graph elements.
gum is the global namespace for all aGrUM entities
Definition agrum.h:46