aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
defaultTriangulation.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
47#ifndef GUM_DEFAULT_TRIANGULATION_H
48#define GUM_DEFAULT_TRIANGULATION_H
49
52
53namespace gum {
54
82 public:
83 // ############################################################################
85 // ############################################################################
87
89 explicit DefaultTriangulation(const UndiGraph* graph,
90 const NodeProperty< Size >* dom_sizes,
91 bool minimality = false,
92 double theRatio = GUM_QUASI_RATIO,
93 double theThreshold = GUM_WEIGHT_THRESHOLD);
94
96 explicit DefaultTriangulation(bool minimality = false,
97 double theRatio = GUM_QUASI_RATIO,
98 double theThreshold = GUM_WEIGHT_THRESHOLD);
99
102
105
108
110
117
120
122
123
124 private:
127
131
132
133 // ############################################################################
135 // ############################################################################
137
140
142 };
143
144
145} /* namespace gum */
146
147
148#endif /* GUM_DEFAULT_TRIANGULATION_H */
DefaultTriangulation & operator=(const DefaultTriangulation &)
forbid copy operator
double _quasi_ratio_
the ratio above which we consider nodes to be quasi simplicial
double _threshold_
threshold under which almost and quasi simplicial nodes can be chosen to be eliminated
virtual DefaultTriangulation * newFactory() const
virtual clone constructor
DefaultTriangulation(const UndiGraph *graph, const NodeProperty< Size > *dom_sizes, bool minimality=false, double theRatio=GUM_QUASI_RATIO, double theThreshold=GUM_WEIGHT_THRESHOLD)
basic constructor. initialize the triangulation
DefaultTriangulation(DefaultTriangulation &&from)
move constructor
DefaultTriangulation(bool minimality=false, double theRatio=GUM_QUASI_RATIO, double theThreshold=GUM_WEIGHT_THRESHOLD)
default constructor: initialize the triangulation for an empty graph
virtual DefaultTriangulation * copyFactory() const
virtual copy constructor
DefaultTriangulation(const DefaultTriangulation &from)
copy constructor
~DefaultTriangulation()
destructor
UnconstrainedTriangulation(const UnconstrainedEliminationSequenceStrategy &elimSeq, const JunctionTreeStrategy &JTStrategy, bool minimality=false)
default constructor
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
Class for fast retrieval of simplicial and quasi/almost simplicial nodes.
#define GUM_QUASI_RATIO
#define GUM_WEIGHT_THRESHOLD
base class for graph triangulations without constraints on nodes elimination ordering.