aGrUM
0.20.3
a C++ library for (probabilistic) graphical models
partialOrderedTriangulation.cpp
Go to the documentation of this file.
1
/**
2
*
3
* Copyright (c) 2005-2021 by 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
* >(
elimination_sequence_strategy_
)
56
->
setPartialOrder
(
_partial_order_
);
57
58
// for debugging purposes
59
GUM_CONSTRUCTOR
(
PartialOrderedTriangulation
);
60
}
61
62
// copy constructor
63
PartialOrderedTriangulation
::
PartialOrderedTriangulation
(
64
const
PartialOrderedTriangulation
&
from
) :
65
StaticTriangulation
(
from
),
66
_partial_order_
(
from
.
_partial_order_
) {
67
// for debugging purposes
68
GUM_CONS_CPY
(
PartialOrderedTriangulation
);
69
}
70
71
// move constructor
72
PartialOrderedTriangulation
::
PartialOrderedTriangulation
(
PartialOrderedTriangulation
&&
from
) :
73
StaticTriangulation
(
std
::
move
(
from
)),
_partial_order_
(
from
.
_partial_order_
) {
74
// for debugging purposes
75
GUM_CONS_MOV
(
PartialOrderedTriangulation
);
76
}
77
78
/// virtual copy constructor
79
PartialOrderedTriangulation
*
PartialOrderedTriangulation
::
newFactory
()
const
{
80
return
new
PartialOrderedTriangulation
(
81
static_cast
<
const
PartialOrderedEliminationSequenceStrategy
& >(
82
*
elimination_sequence_strategy_
),
83
*
junction_tree_strategy_
);
84
}
85
86
/// virtual copy constructor
87
PartialOrderedTriangulation
*
PartialOrderedTriangulation
::
copyFactory
()
const
{
88
return
new
PartialOrderedTriangulation
(*
this
);
89
}
90
91
/// destructor
92
PartialOrderedTriangulation
::~
PartialOrderedTriangulation
() {
93
// for debugging purposes
94
GUM_DESTRUCTOR
(
PartialOrderedTriangulation
);
95
}
96
97
/// initialize the triangulation data structures for a new graph
98
void
PartialOrderedTriangulation
::
setGraph
(
const
UndiGraph
*
graph
,
99
const
NodeProperty
<
Size
>*
domsizes
) {
100
StaticTriangulation
::
setGraph
(
graph
,
domsizes
);
101
static_cast
<
PartialOrderedEliminationSequenceStrategy
* >(
elimination_sequence_strategy_
)
102
->
setPartialOrder
(
_partial_order_
);
103
}
104
105
/// sets the sequence of elimination
106
void
PartialOrderedTriangulation
::
setPartialOrder
(
const
List
<
NodeSet
>*
partial_order
) {
107
_partial_order_
=
partial_order
;
108
static_cast
<
PartialOrderedEliminationSequenceStrategy
* >(
elimination_sequence_strategy_
)
109
->
setPartialOrder
(
_partial_order_
);
110
}
111
112
/// the function called to initialize the triangulation process
113
void
PartialOrderedTriangulation
::
initTriangulation_
(
UndiGraph
&
graph
) {
114
PartialOrderedEliminationSequenceStrategy
*
elim
115
=
static_cast
<
PartialOrderedEliminationSequenceStrategy
* >(
elimination_sequence_strategy_
);
116
elim
->
setGraph
(&
graph
,
domain_sizes_
);
117
elim
->
setPartialOrder
(
_partial_order_
);
118
}
119
120
}
/* namespace gum */
gum::Set::emplace
INLINE void emplace(Args &&... args)
Definition:
set_tpl.h:643