aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
binaryJoinTreeConverterDefault.h
Go to the documentation of this file.
1/****************************************************************************
2 * This file is part of the aGrUM/pyAgrum library. *
3 * *
4 * Copyright (c) 2005-2025 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-2025 *
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
47#ifndef GUM_BINARY_JOIN_TREE_CONVERTER_DEFAULT_H
48#define GUM_BINARY_JOIN_TREE_CONVERTER_DEFAULT_H
49
51
52namespace gum {
53
55 public:
56 // ############################################################################
58 // ############################################################################
60
63
66
68
69 // ############################################################################
71 // ############################################################################
73
75
88 const NodeProperty< Size >& domain_sizes,
89 const NodeSet& roots);
90
92 const NodeSet& roots() const;
93
95
96 private:
99
102
105
109 NodeId root,
110 NodeProperty< bool >& mark) const;
111
114 NodeId current_node,
115 NodeId from,
116 const NodeProperty< Size >& domain_sizes,
117 NodeProperty< bool >& mark) const;
118
121 NodeId clique,
122 NodeId from,
123 const NodeProperty< Size >& domain_sizes) const;
124
126 float _combinedSize_(const NodeSet& nodes1,
127 const NodeSet& nodes2,
128 const NodeProperty< Size >& domain_sizes) const;
129 };
130
131} /* namespace gum */
132
133#endif /* GUM_BINARY_JOIN_TREE_CONVERTER_DEFAULT_H */
The base interface for converting a join tree into a binary join tree.
BinaryJoinTreeConverterDefault & operator=(const BinaryJoinTreeConverterDefault &)
forbid copy operator
void _convertClique_(CliqueGraph &JT, NodeId clique, NodeId from, const NodeProperty< Size > &domain_sizes) const
convert a clique and its adjacent cliques into a binary join tree
NodeSet _roots_
the new roots that have been created to compute the last query
const NodeSet & roots() const
returns all the roots considered for all the connected components
void _markConnectedComponent_(const CliqueGraph &JT, NodeId root, NodeProperty< bool > &mark) const
a function used to mark the nodes belonging to a given connected component
float _combinedSize_(const NodeSet &nodes1, const NodeSet &nodes2, const NodeProperty< Size > &domain_sizes) const
returns the domain size of the union of two cliques
void _convertConnectedComponent_(CliqueGraph &JT, NodeId current_node, NodeId from, const NodeProperty< Size > &domain_sizes, NodeProperty< bool > &mark) const
convert a whole connected component into a binary join tree
BinaryJoinTreeConverterDefault(const BinaryJoinTreeConverterDefault &)
forbid copy constructor
CliqueGraph convert(const CliqueGraph &JT, const NodeProperty< Size > &domain_sizes, const NodeSet &roots)
returns a binary join tree corresponding to clique graph JT
Basic graph of cliques.
Definition cliqueGraph.h:77
Size NodeId
Type for node ids.
HashTable< NodeId, VAL > NodeProperty
Property on graph elements.
Set< NodeId > NodeSet
Some typdefs and define for shortcuts ...
gum is the global namespace for all aGrUM entities
Definition agrum.h:46