aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
unconstrainedTriangulation.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#ifndef GUM_UNCONSTRAINED_TRIANGULATION_H
49#define GUM_UNCONSTRAINED_TRIANGULATION_H
50
53
54namespace gum {
55
56
65 public:
66 // ############################################################################
68 // ############################################################################
70
78
80
84
87
89
90
91 protected:
92 // ############################################################################
94 // ############################################################################
96
98
104 const JunctionTreeStrategy& JTStrategy,
105 bool minimality = false);
106
108
119 const NodeProperty< Size >* dom,
121 const JunctionTreeStrategy& JTStrategy,
122 bool minimality = false);
123
126
129
131
132
133 private:
136 };
137
138} /* namespace gum */
139
140#endif /* GUM_UNCONSTRAINED_TRIANGULATION_H */
Base Class for all the algorithms producing a junction given a set of cliques/subcliques resulting fr...
StaticTriangulation(const EliminationSequenceStrategy &elimSeq, const JunctionTreeStrategy &JTStrategy, bool minimality=false)
default constructor: without any graph
The base class for all elimination sequence algorithms that require only the graph to be triangulated...
UnconstrainedTriangulation(const UnconstrainedEliminationSequenceStrategy &elimSeq, const JunctionTreeStrategy &JTStrategy, bool minimality=false)
default constructor
virtual UnconstrainedTriangulation * newFactory() const =0
returns a fresh triangulation (over an empty graph) of the same type as the current object
virtual UnconstrainedTriangulation * copyFactory() const =0
virtual copy constructor
UnconstrainedTriangulation & operator=(const UnconstrainedTriangulation &)
forbid copy operator
Base class for undirected graphs.
Definition undiGraph.h:128
HashTable< NodeId, VAL > NodeProperty
Property on graph elements.
gum is the global namespace for all aGrUM entities
Definition agrum.h:46
base class for all non-incremental triangulations.
Base Class for all elimination sequence algorithms that require only the graph to be triangulated and...