aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
defaultTriangulation.cpp
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
48#include <agrum/agrum.h>
49
53
54#ifndef DOXYGEN_SHOULD_SKIP_THIS
55
56namespace gum {
57
60 const NodeProperty< Size >* domsizes,
61 bool minimality,
62 double theRatio,
63 double theThreshold) :
65 domsizes,
68 minimality),
69 _quasi_ratio_(theRatio), _threshold_(theThreshold) { // for debugging purposes
70 GUM_CONSTRUCTOR(DefaultTriangulation);
71 }
72
74 DefaultTriangulation::DefaultTriangulation(bool minimality,
75 double theRatio,
76 double theThreshold) :
77 UnconstrainedTriangulation(DefaultEliminationSequenceStrategy(),
78 DefaultJunctionTreeStrategy(),
79 minimality),
80 _quasi_ratio_(theRatio), _threshold_(theThreshold) { // for debugging purposes
81 GUM_CONSTRUCTOR(DefaultTriangulation);
82 }
83
85 DefaultTriangulation::DefaultTriangulation(const DefaultTriangulation& from) :
86 UnconstrainedTriangulation(from), _quasi_ratio_(from._quasi_ratio_),
87 _threshold_(from._threshold_) { // for debugging purposes
88 GUM_CONS_CPY(DefaultTriangulation);
89 }
90
92 DefaultTriangulation::DefaultTriangulation(DefaultTriangulation&& from) :
93 UnconstrainedTriangulation(std::move(from)), _quasi_ratio_(from._quasi_ratio_),
94 _threshold_(from._threshold_) {
95 // for debugging purposes
96 GUM_CONS_MOV(DefaultTriangulation);
97 }
98
100 DefaultTriangulation::~DefaultTriangulation() {
101 // for debugging purposes
102 GUM_DESTRUCTOR(DefaultTriangulation);
103 }
104
106 DefaultTriangulation* DefaultTriangulation::newFactory() const {
107 return new DefaultTriangulation(isMinimalityRequired(), _quasi_ratio_, _threshold_);
108 }
109
111 DefaultTriangulation* DefaultTriangulation::copyFactory() const {
112 return new DefaultTriangulation(*this);
113 }
114
115} /* namespace gum */
116
117#endif /* DOXYGEN_SHOULD_SKIP_THIS */
An efficient unconstrained elimination sequence algorithm.
An algorithm producing a junction given the elimination tree produced by a triangulation algorithm.
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
Interface for all triangulation methods without constraints on node elimination orderings.
Base class for undirected graphs.
Definition undiGraph.h:128
An efficient unconstrained elimination sequence algorithm.
An algorithms producing a junction given the elimination tree produced by the triangulation algorithm...
Class for computing default triangulations of graphs.
HashTable< NodeId, VAL > NodeProperty
Property on graph elements.
gum is the global namespace for all aGrUM entities
Definition agrum.h:46
STL namespace.