aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
triangulation.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
51
53
54#ifdef GUM_NO_INLINE
56#endif // GUM_NO_INLINE
57
58namespace gum {
59
60 // constructor
61 Triangulation::Triangulation() { // for debugging purposes
62 GUM_CONSTRUCTOR(Triangulation);
63 }
64
65 // constructor with a domain size specified
67 GUM_CONSTRUCTOR(Triangulation);
68 }
69
70 // destructor
71 Triangulation::~Triangulation() { // for debugging purposes
72 GUM_DESTRUCTOR(Triangulation);
73 }
74
75 // copy constructor
79
80 // move constructor
84
85 // returns the max of log10DomainSize of cliques in the junction tree
87 double res = 0.0;
88 double dSize;
89 const JunctionTree& jt = junctionTree(); // here, the fact that we get
90 // a junction tree ensures that domain_sizes_ is different from nullptr
91
92 for (const NodeId cl: jt) {
93 dSize = 0.0;
94
95 for (const auto node: jt.clique(cl))
96 dSize += std::log10((*domain_sizes_)[node]);
97
98 if (res < dSize) res = dSize;
99 }
100
101 return res;
102 }
103
104} /* namespace gum */
const NodeSet & clique(const NodeId idClique) const
returns the set of nodes included into a given clique
virtual const CliqueGraph & junctionTree()=0
returns a compatible junction tree
const NodeProperty< Size > * domain_sizes_
the domain sizes of the variables/nodes of the graph
double maxLog10CliqueDomainSize()
returns the max of log10DomainSize of the cliques in the junction tree.
virtual ~Triangulation()
destructor
Triangulation()
default constructor
Size NodeId
Type for node ids.
HashTable< NodeId, VAL > NodeProperty
Property on graph elements.
Useful macros for maths.
gum is the global namespace for all aGrUM entities
Definition agrum.h:46
CliqueGraph JunctionTree
a junction tree is a clique graph satisfying the running intersection property and such that no cliqu...
Abstract base class for computing triangulations of graphs.
Abstract base class for computing triangulations of graphs.