aGrUM
3.2.0
a C++ library for (probabilistic) graphical models
Toggle main menu visibility
incrementalTriangulation_inl.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
#pragma once
42
43
49
50
#include <
agrum/base/graphs/algorithms/triangulations/incrementalTriangulation.h
>
// to ease IDE parser
51
#ifndef DOXYGEN_SHOULD_SKIP_THIS
52
# include <
agrum/base/graphs/algorithms/triangulations/incrementalTriangulation.h
>
53
54
namespace
gum
{
55
56
/* ===========================================================================
57
*/
58
/* ===========================================================================
59
*/
60
/* === CLASS FOR COMPUTING INCREMENTAL TRIANGULATIONS ===
61
*/
62
/* ===========================================================================
63
*/
64
/* ===========================================================================
65
*/
66
68
69
INLINE
70
const
CliqueGraph
&
IncrementalTriangulation::junctionTree
() {
71
updateTriangulation
();
72
return
_junction_tree_
;
73
}
74
76
77
INLINE
78
const
CliqueGraph
&
IncrementalTriangulation::maxPrimeSubgraphTree
() {
79
updateTriangulation
();
80
return
_T_mpd_
;
81
}
82
84
85
INLINE
const
UnconstrainedTriangulation
&
IncrementalTriangulation::triangulationAlgo
()
const
{
86
return
*
_triangulation_
;
87
}
88
90
91
INLINE
const
UndiGraph
&
IncrementalTriangulation::graph
()
const
{
return
_graph_
; }
92
94
95
INLINE
const
EdgeSet
&
IncrementalTriangulation::fillIns
(){
96
GUM_ERROR
(OperationNotAllowed,
"Not implemented yet"
)}
97
99
100
INLINE
const
UndiGraph
&
IncrementalTriangulation::triangulatedGraph
(){
101
GUM_ERROR
(OperationNotAllowed,
"Not implemented yet"
)}
102
104
105
INLINE
const
CliqueGraph
&
IncrementalTriangulation::eliminationTree
() {
106
GUM_ERROR
(OperationNotAllowed,
"Not implemented yet"
)
107
}
108
109
}
/* namespace gum */
110
111
#endif
/* DOXYGEN_SHOULD_SKIP_THIS */
gum::CliqueGraph
Basic graph of cliques.
Definition
cliqueGraph.h:77
gum::IncrementalTriangulation::_graph_
UndiGraph _graph_
the graph that needs be triangulated
Definition
incrementalTriangulation.h:190
gum::IncrementalTriangulation::triangulatedGraph
const UndiGraph & triangulatedGraph() override
returns the triangulated graph
gum::IncrementalTriangulation::junctionTree
const CliqueGraph & junctionTree() override
returns a junction tree corresponding to the current graph
gum::IncrementalTriangulation::_junction_tree_
CliqueGraph _junction_tree_
the junction tree computed so far
Definition
incrementalTriangulation.h:196
gum::IncrementalTriangulation::maxPrimeSubgraphTree
const CliqueGraph & maxPrimeSubgraphTree() override
returns the junction tree of the maximal prime subgraphs
gum::IncrementalTriangulation::eliminationTree
const CliqueGraph & eliminationTree() override
returns the elimination tree of a compatible ordering
gum::IncrementalTriangulation::_T_mpd_
CliqueGraph _T_mpd_
the maximal prime subgraph tree
Definition
incrementalTriangulation.h:199
gum::IncrementalTriangulation::graph
const UndiGraph & graph() const
returns the current graph (that which is incrementally triangulated)
gum::IncrementalTriangulation::fillIns
const EdgeSet & fillIns() override
returns the fill-ins added by the triangulation algorithm
gum::IncrementalTriangulation::_triangulation_
UnconstrainedTriangulation * _triangulation_
the triangulation algorithm that will be used incremantally
Definition
incrementalTriangulation.h:214
gum::IncrementalTriangulation::updateTriangulation
void updateTriangulation()
updates the triangulated graph using the modif list
gum::IncrementalTriangulation::triangulationAlgo
const UnconstrainedTriangulation & triangulationAlgo() const
returns the triangulation algorithm (useful for fine tuning it)
gum::UnconstrainedTriangulation
Interface for all triangulation methods without constraints on node elimination orderings.
Definition
unconstrainedTriangulation.h:64
gum::UndiGraph
Base class for undirected graphs.
Definition
undiGraph.h:130
GUM_ERROR
#define GUM_ERROR(type, msg)
Definition
exceptions.h:76
gum::EdgeSet
Set< Edge > EdgeSet
Some typdefs and define for shortcuts ...
Definition
graphElements.h:391
incrementalTriangulation.h
Class for computing default triangulations of graphs.
gum
gum is the global namespace for all aGrUM entities
Definition
agrum.h:46
aGrUM
3.2.0
© PHW&CG&others - 2022
DoXyGeN 1.18.0