aGrUM
3.2.0
a C++ library for (probabilistic) graphical models
Toggle main menu visibility
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-2026 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-2026 *
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
50
#include <
agrum/base/graphs/algorithms/triangulations/triangulation.h
>
51
52
#include <
agrum/base/core/math/math_utils.h
>
53
54
#ifdef GUM_NO_INLINE
55
# include <
agrum/base/graphs/algorithms/triangulations/triangulation_inl.h
>
56
#endif
// GUM_NO_INLINE
57
58
namespace
gum
{
59
60
// constructor
61
Triangulation::Triangulation
() {
// for debugging purposes
62
GUM_CONSTRUCTOR(
Triangulation
);
63
}
64
65
// constructor with a domain size specified
66
Triangulation::Triangulation
(
const
NodeProperty< Size >
* domsizes) :
domain_sizes_
(domsizes) {
67
GUM_CONSTRUCTOR(
Triangulation
);
68
}
69
70
// destructor
71
Triangulation::~Triangulation
() {
// for debugging purposes
72
GUM_DESTRUCTOR(
Triangulation
);
73
}
74
75
// copy constructor
76
Triangulation::Triangulation
(
const
Triangulation
& from) :
domain_sizes_
(from.
domain_sizes_
) {
77
GUM_CONS_CPY(
Triangulation
);
78
}
79
80
// move constructor
81
Triangulation::Triangulation
(
Triangulation
&& from) :
domain_sizes_
(from.
domain_sizes_
) {
82
GUM_CONS_MOV(
Triangulation
);
83
}
84
85
// returns the max of log10DomainSize of cliques in the junction tree
86
double
Triangulation::maxLog10CliqueDomainSize
() {
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 */
agrum.h
gum::CliqueGraph::clique
const NodeSet & clique(const NodeId idClique) const
returns the set of nodes included into a given clique
gum::Triangulation::junctionTree
virtual const CliqueGraph & junctionTree()=0
returns a compatible junction tree
gum::Triangulation::domain_sizes_
const NodeProperty< Size > * domain_sizes_
the domain sizes of the variables/nodes of the graph
Definition
triangulation.h:170
gum::Triangulation::maxLog10CliqueDomainSize
double maxLog10CliqueDomainSize()
returns the max of log10DomainSize of the cliques in the junction tree.
Definition
triangulation.cpp:86
gum::Triangulation::~Triangulation
virtual ~Triangulation()
destructor
Definition
triangulation.cpp:71
gum::Triangulation::Triangulation
Triangulation()
default constructor
Definition
triangulation.cpp:61
gum::NodeId
Size NodeId
Type for node ids.
Definition
graphElements.h:117
gum::NodeProperty
HashTable< NodeId, VAL > NodeProperty
Property on graph elements.
Definition
graphElements.h:407
math_utils.h
Useful macros for maths.
gum
gum is the global namespace for all aGrUM entities
Definition
agrum.h:46
gum::JunctionTree
CliqueGraph JunctionTree
a junction tree is a clique graph satisfying the running intersection property and such that no cliqu...
Definition
cliqueGraph.h:333
triangulation.h
Abstract base class for computing triangulations of graphs.
triangulation_inl.h
Abstract base class for computing triangulations of graphs.
aGrUM
3.2.0
© PHW&CG&others - 2022
DoXyGeN 1.18.0