aGrUM
0.20.2
a C++ library for (probabilistic) graphical models
partialOrderedTriangulation.cpp
Go to the documentation of this file.
1
/**
2
*
3
* Copyright 2005-2020 Pierre-Henri WUILLEMIN(@LIP6) & Christophe GONZALES(@AMU)
4
* info_at_agrum_dot_org
5
*
6
* This library is free software: you can redistribute it and/or modify
7
* it under the terms of the GNU Lesser General Public License as published by
8
* the Free Software Foundation, either version 3 of the License, or
9
* (at your option) any later version.
10
*
11
* This library is distributed in the hope that it will be useful,
12
* but WITHOUT ANY WARRANTY; without even the implied warranty of
13
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
* GNU Lesser General Public License for more details.
15
*
16
* You should have received a copy of the GNU Lesser General Public License
17
* along with this library. If not, see <http://www.gnu.org/licenses/>.
18
*
19
*/
20
21
22
/** @file
23
* @brief class for graph triangulations for which we enforce a given partial
24
* ordering on the nodes eliminations.
25
*
26
* @author Christophe GONZALES(@AMU) and Pierre-Henri WUILLEMIN(@LIP6)
27
*/
28
29
#
include
<
agrum
/
agrum
.
h
>
30
31
#
include
<
agrum
/
tools
/
graphs
/
algorithms
/
triangulations
/
partialOrderedTriangulation
.
h
>
32
33
namespace
gum
{
34
35
// default constructor
36
PartialOrderedTriangulation
::
PartialOrderedTriangulation
(
37
const
PartialOrderedEliminationSequenceStrategy
&
elimSeq
,
38
const
JunctionTreeStrategy
&
JTStrategy
,
39
bool
minimality
) :
40
StaticTriangulation
(
elimSeq
,
JTStrategy
,
minimality
) {
41
// for debugging purposes
42
GUM_CONSTRUCTOR
(
PartialOrderedTriangulation
);
43
}
44
45
// constructor with a given graph
46
PartialOrderedTriangulation
::
PartialOrderedTriangulation
(
47
const
UndiGraph
*
theGraph
,
48
const
NodeProperty
<
Size
>*
dom
,
49
const
List
<
NodeSet
>*
partial_order
,
50
const
PartialOrderedEliminationSequenceStrategy
&
elimSeq
,
51
const
JunctionTreeStrategy
&
JTStrategy
,
52
bool
minimality
) :
53
StaticTriangulation
(
theGraph
,
dom
,
elimSeq
,
JTStrategy
,
minimality
),
54
partial_order__
(
partial_order
) {
55
static_cast
<
PartialOrderedEliminationSequenceStrategy
* >(
56
elimination_sequence_strategy_
)
57
->
setPartialOrder
(
partial_order__
);
58
59
// for debugging purposes
60
GUM_CONSTRUCTOR
(
PartialOrderedTriangulation
);
61
}
62
63
// copy constructor
64
PartialOrderedTriangulation
::
PartialOrderedTriangulation
(
65
const
PartialOrderedTriangulation
&
from
) :
66
StaticTriangulation
(
from
),
67
partial_order__
(
from
.
partial_order__
) {
68
// for debugging purposes
69
GUM_CONS_CPY
(
PartialOrderedTriangulation
);
70
}
71
72
// move constructor
73
PartialOrderedTriangulation
::
PartialOrderedTriangulation
(
74
PartialOrderedTriangulation
&&
from
) :
75
StaticTriangulation
(
std
::
move
(
from
)),
76
partial_order__
(
from
.
partial_order__
) {
77
// for debugging purposes
78
GUM_CONS_MOV
(
PartialOrderedTriangulation
);
79
}
80
81
/// virtual copy constructor
82
PartialOrderedTriangulation
*
PartialOrderedTriangulation
::
newFactory
()
const
{
83
return
new
PartialOrderedTriangulation
(
84
static_cast
<
const
PartialOrderedEliminationSequenceStrategy
& >(
85
*
elimination_sequence_strategy_
),
86
*
junction_tree_strategy_
);
87
}
88
89
/// virtual copy constructor
90
PartialOrderedTriangulation
*
PartialOrderedTriangulation
::
copyFactory
()
const
{
91
return
new
PartialOrderedTriangulation
(*
this
);
92
}
93
94
/// destructor
95
PartialOrderedTriangulation
::~
PartialOrderedTriangulation
() {
96
// for debugging purposes
97
GUM_DESTRUCTOR
(
PartialOrderedTriangulation
);
98
}
99
100
/// initialize the triangulation data structures for a new graph
101
void
102
PartialOrderedTriangulation
::
setGraph
(
const
UndiGraph
*
graph
,
103
const
NodeProperty
<
Size
>*
domsizes
) {
104
StaticTriangulation
::
setGraph
(
graph
,
domsizes
);
105
static_cast
<
PartialOrderedEliminationSequenceStrategy
* >(
106
elimination_sequence_strategy_
)
107
->
setPartialOrder
(
partial_order__
);
108
}
109
110
/// sets the sequence of elimination
111
void
PartialOrderedTriangulation
::
setPartialOrder
(
112
const
List
<
NodeSet
>*
partial_order
) {
113
partial_order__
=
partial_order
;
114
static_cast
<
PartialOrderedEliminationSequenceStrategy
* >(
115
elimination_sequence_strategy_
)
116
->
setPartialOrder
(
partial_order__
);
117
}
118
119
/// the function called to initialize the triangulation process
120
void
PartialOrderedTriangulation
::
initTriangulation_
(
UndiGraph
&
graph
) {
121
PartialOrderedEliminationSequenceStrategy
*
elim
122
=
static_cast
<
PartialOrderedEliminationSequenceStrategy
* >(
123
elimination_sequence_strategy_
);
124
elim
->
setGraph
(&
graph
,
domain_sizes_
);
125
elim
->
setPartialOrder
(
partial_order__
);
126
}
127
128
}
/* namespace gum */
gum::Set::emplace
INLINE void emplace(Args &&... args)
Definition:
set_tpl.h:669