aGrUM
3.2.0
a C++ library for (probabilistic) graphical models
Toggle main menu visibility
partialOrderedTriangulation.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
48
49
#include <
agrum/agrum.h
>
50
51
#include <
agrum/base/graphs/algorithms/triangulations/partialOrderedTriangulation.h
>
52
53
namespace
gum
{
54
55
// default constructor
56
PartialOrderedTriangulation::PartialOrderedTriangulation
(
57
const
PartialOrderedEliminationSequenceStrategy
& elimSeq,
58
const
JunctionTreeStrategy
& JTStrategy,
59
bool
minimality) :
StaticTriangulation
(elimSeq, JTStrategy, minimality) {
60
// for debugging purposes
61
GUM_CONSTRUCTOR(
PartialOrderedTriangulation
);
62
}
63
64
// constructor with a given graph
65
PartialOrderedTriangulation::PartialOrderedTriangulation
(
66
const
UndiGraph
* theGraph,
67
const
NodeProperty< Size >
* dom,
68
const
List< NodeSet >
* partial_order,
69
const
PartialOrderedEliminationSequenceStrategy
& elimSeq,
70
const
JunctionTreeStrategy
& JTStrategy,
71
bool
minimality) :
72
StaticTriangulation
(theGraph, dom, elimSeq, JTStrategy, minimality),
73
_partial_order_
(partial_order) {
74
static_cast<
PartialOrderedEliminationSequenceStrategy
*
>
(
elimination_sequence_strategy_
)
75
->
setPartialOrder
(
_partial_order_
);
76
77
// for debugging purposes
78
GUM_CONSTRUCTOR(
PartialOrderedTriangulation
);
79
}
80
81
// copy constructor
82
PartialOrderedTriangulation::PartialOrderedTriangulation
(
83
const
PartialOrderedTriangulation
& from) :
84
StaticTriangulation
(from),
_partial_order_
(from.
_partial_order_
) {
85
// for debugging purposes
86
GUM_CONS_CPY(
PartialOrderedTriangulation
);
87
}
88
89
// move constructor
90
PartialOrderedTriangulation::PartialOrderedTriangulation
(
PartialOrderedTriangulation
&& from) :
91
StaticTriangulation
(
std
::move(from)),
_partial_order_
(from.
_partial_order_
) {
92
// for debugging purposes
93
GUM_CONS_MOV(
PartialOrderedTriangulation
);
94
}
95
97
PartialOrderedTriangulation
*
PartialOrderedTriangulation::newFactory
()
const
{
98
return
new
PartialOrderedTriangulation
(
99
static_cast<
const
PartialOrderedEliminationSequenceStrategy
&
>
(
100
*
elimination_sequence_strategy_
),
101
*
junction_tree_strategy_
);
102
}
103
105
PartialOrderedTriangulation
*
PartialOrderedTriangulation::copyFactory
()
const
{
106
return
new
PartialOrderedTriangulation
(*
this
);
107
}
108
110
PartialOrderedTriangulation::~PartialOrderedTriangulation
() {
111
// for debugging purposes
112
GUM_DESTRUCTOR(
PartialOrderedTriangulation
);
113
}
114
116
void
PartialOrderedTriangulation::setGraph
(
const
UndiGraph
*
graph
,
117
const
NodeProperty< Size >
* domsizes) {
118
StaticTriangulation::setGraph
(
graph
, domsizes);
119
static_cast<
PartialOrderedEliminationSequenceStrategy
*
>
(
elimination_sequence_strategy_
)
120
->
setPartialOrder
(
_partial_order_
);
121
}
122
124
void
PartialOrderedTriangulation::setPartialOrder
(
const
List< NodeSet >
* partial_order) {
125
_partial_order_
= partial_order;
126
static_cast<
PartialOrderedEliminationSequenceStrategy
*
>
(
elimination_sequence_strategy_
)
127
->
setPartialOrder
(
_partial_order_
);
128
}
129
131
void
PartialOrderedTriangulation::initTriangulation_
(
UndiGraph
&
graph
) {
132
PartialOrderedEliminationSequenceStrategy
* elim
133
=
static_cast<
PartialOrderedEliminationSequenceStrategy
*
>
(
elimination_sequence_strategy_
);
134
elim->
setGraph
(&
graph
,
domain_sizes_
);
135
elim->
setPartialOrder
(
_partial_order_
);
136
}
137
138
}
/* namespace gum */
agrum.h
gum::JunctionTreeStrategy
Base Class for all the algorithms producing a junction given a set of cliques/subcliques resulting fr...
Definition
junctionTreeStrategy.h:66
gum::List
Generic doubly linked lists.
Definition
list.h:378
gum::PartialOrderedEliminationSequenceStrategy
Base class for all elimination sequence algorithm that impose a given partial ordering on the nodes e...
Definition
partialOrderedEliminationSequenceStrategy.h:73
gum::PartialOrderedEliminationSequenceStrategy::setGraph
bool setGraph(UndiGraph *graph, const NodeProperty< Size > *dom_sizes) override
sets a new graph to be triangulated
Definition
partialOrderedEliminationSequenceStrategy.cpp:107
gum::PartialOrderedEliminationSequenceStrategy::setPartialOrder
virtual bool setPartialOrder(const List< NodeSet > *subsets)
sets a new partial ordering constraint on the elimination sequence
Definition
partialOrderedEliminationSequenceStrategy.cpp:135
gum::PartialOrderedTriangulation::newFactory
PartialOrderedTriangulation * newFactory() const override
returns a fresh triangulation (over an empty graph) of the same type as the current object
Definition
partialOrderedTriangulation.cpp:97
gum::PartialOrderedTriangulation::setPartialOrder
virtual void setPartialOrder(const List< NodeSet > *partial_order) final
sets the elimination sequence's partial order (only a reference is stored)
Definition
partialOrderedTriangulation.cpp:124
gum::PartialOrderedTriangulation::setGraph
void setGraph(const UndiGraph *graph, const NodeProperty< Size > *domsizes) final
initialize the triangulation data structures for a new graph
Definition
partialOrderedTriangulation.cpp:116
gum::PartialOrderedTriangulation::copyFactory
PartialOrderedTriangulation * copyFactory() const final
virtual copy constructor
Definition
partialOrderedTriangulation.cpp:105
gum::PartialOrderedTriangulation::PartialOrderedTriangulation
PartialOrderedTriangulation(const PartialOrderedEliminationSequenceStrategy &elimSeq=DefaultPartialOrderedEliminationSequenceStrategy(), const JunctionTreeStrategy &JTStrategy=DefaultJunctionTreeStrategy(), bool minimality=false)
default constructor
Definition
partialOrderedTriangulation.cpp:56
gum::PartialOrderedTriangulation::_partial_order_
const List< NodeSet > * _partial_order_
the partial ordering to apply to eliminate nodes
Definition
partialOrderedTriangulation.h:178
gum::PartialOrderedTriangulation::initTriangulation_
void initTriangulation_(UndiGraph &graph) final
the function called to initialize the triangulation process
Definition
partialOrderedTriangulation.cpp:131
gum::PartialOrderedTriangulation::~PartialOrderedTriangulation
~PartialOrderedTriangulation() override
destructor
Definition
partialOrderedTriangulation.cpp:110
gum::StaticTriangulation::junction_tree_strategy_
JunctionTreeStrategy * junction_tree_strategy_
the junction tree strategy used by the triangulation
Definition
staticTriangulation.h:250
gum::StaticTriangulation::StaticTriangulation
StaticTriangulation(const EliminationSequenceStrategy &elimSeq, const JunctionTreeStrategy &JTStrategy, bool minimality=false)
default constructor: without any graph
Definition
staticTriangulation.cpp:86
gum::StaticTriangulation::elimination_sequence_strategy_
EliminationSequenceStrategy * elimination_sequence_strategy_
the elimination sequence strategy used by the triangulation
Definition
staticTriangulation.h:247
gum::StaticTriangulation::setGraph
void setGraph(const UndiGraph *graph, const NodeProperty< Size > *domsizes) override
initialize the triangulation data structures for a new graph
Definition
staticTriangulation.cpp:524
gum::Triangulation::domain_sizes_
const NodeProperty< Size > * domain_sizes_
the domain sizes of the variables/nodes of the graph
Definition
triangulation.h:170
gum::UndiGraph
Base class for undirected graphs.
Definition
undiGraph.h:130
gum::NodeProperty
HashTable< NodeId, VAL > NodeProperty
Property on graph elements.
Definition
graphElements.h:407
gum::graph
Definition
bayesBall.h:79
gum
gum is the global namespace for all aGrUM entities
Definition
agrum.h:46
std
STL namespace.
partialOrderedTriangulation.h
class for graph triangulations for which we enforce a given partial ordering on the nodes elimination...
aGrUM
3.2.0
© PHW&CG&others - 2022
DoXyGeN 1.18.0