aGrUM
3.2.0
a C++ library for (probabilistic) graphical models
Toggle main menu visibility
unconstrainedTriangulation.h
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
#ifndef GUM_UNCONSTRAINED_TRIANGULATION_H
49
#define GUM_UNCONSTRAINED_TRIANGULATION_H
50
51
#include <
agrum/base/graphs/algorithms/triangulations/eliminationStrategies/unconstrainedEliminationSequenceStrategy.h
>
52
#include <
agrum/base/graphs/algorithms/triangulations/staticTriangulation.h
>
53
54
namespace
gum
{
55
56
64
class
GUM_SHARED_PUBLIC
UnconstrainedTriangulation
:
public
StaticTriangulation
{
65
public
:
66
// ############################################################################
68
// ############################################################################
70
77
[[nodiscard]]
UnconstrainedTriangulation
*
newFactory
()
const override
= 0;
78
80
83
[[nodiscard]]
UnconstrainedTriangulation
*
copyFactory
()
const override
= 0;
84
86
~UnconstrainedTriangulation
()
override
;
87
89
90
91
protected
:
92
// ############################################################################
94
// ############################################################################
96
98
103
UnconstrainedTriangulation
(
const
UnconstrainedEliminationSequenceStrategy
& elimSeq,
104
const
JunctionTreeStrategy
& JTStrategy,
105
bool
minimality =
false
);
106
108
118
UnconstrainedTriangulation
(
const
UndiGraph
*
graph
,
119
const
NodeProperty< Size >
* dom,
120
const
UnconstrainedEliminationSequenceStrategy
& elimSeq,
121
const
JunctionTreeStrategy
& JTStrategy,
122
bool
minimality =
false
);
123
125
UnconstrainedTriangulation
(
const
UnconstrainedTriangulation
&);
126
128
UnconstrainedTriangulation
(
UnconstrainedTriangulation
&&);
129
131
132
133
private
:
135
UnconstrainedTriangulation
&
operator=
(
const
UnconstrainedTriangulation
&);
136
};
137
138
}
/* namespace gum */
139
140
#endif
/* GUM_UNCONSTRAINED_TRIANGULATION_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::StaticTriangulation::StaticTriangulation
StaticTriangulation(const EliminationSequenceStrategy &elimSeq, const JunctionTreeStrategy &JTStrategy, bool minimality=false)
default constructor: without any graph
Definition
staticTriangulation.cpp:86
gum::UnconstrainedEliminationSequenceStrategy
The base class for all elimination sequence algorithms that require only the graph to be triangulated...
Definition
unconstrainedEliminationSequenceStrategy.h:80
gum::UnconstrainedTriangulation::UnconstrainedTriangulation
UnconstrainedTriangulation(const UnconstrainedEliminationSequenceStrategy &elimSeq, const JunctionTreeStrategy &JTStrategy, bool minimality=false)
default constructor
Definition
unconstrainedTriangulation.cpp:57
gum::UnconstrainedTriangulation::copyFactory
UnconstrainedTriangulation * copyFactory() const override=0
virtual copy constructor
gum::UnconstrainedTriangulation::newFactory
UnconstrainedTriangulation * newFactory() const override=0
returns a fresh triangulation (over an empty graph) of the same type as the current object
gum::UnconstrainedTriangulation::operator=
UnconstrainedTriangulation & operator=(const UnconstrainedTriangulation &)
forbid copy operator
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
staticTriangulation.h
base class for all non-incremental triangulations.
unconstrainedEliminationSequenceStrategy.h
Base Class for all elimination sequence algorithms that require only the graph to be triangulated and...
aGrUM
3.2.0
© PHW&CG&others - 2022
DoXyGeN 1.18.0