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