aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
barrenNodesFinder.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
48#ifndef GUM_BARREN_NODES_FINDER_H
49#define GUM_BARREN_NODES_FINDER_H
50
51
52#include <agrum/agrum.h>
53
55#include <agrum/BN/BayesNet.h>
56
57namespace gum {
58
59
66 public:
67 // ############################################################################
69 // ############################################################################
71
73 explicit BarrenNodesFinder(const DAG* dag);
74
77
79 BarrenNodesFinder(BarrenNodesFinder&& from) noexcept;
80
83
85
86
87 // ############################################################################
89 // ############################################################################
91
94
97
99
100
101 // ############################################################################
103 // ############################################################################
105
107 void setDAG(const DAG* new_dag);
108
110 void setEvidence(const NodeSet* observed_nodes);
111
113 void setTargets(const NodeSet* target_nodes);
114
117
119 ArcProperty< NodeSet > barrenNodes(const CliqueGraph& junction_tree);
120
122 template < typename GUM_SCALAR >
124 barrenTensors(const CliqueGraph& junction_tree, const IBayesNet< GUM_SCALAR >& bn);
125
127
128 private:
130 const DAG* _dag_;
131
134
137 };
138
139
140} /* namespace gum */
141
142
143#ifndef GUM_NO_INLINE
145#endif // GUM_NO_INLINE
146
147
149
150
151#endif /* GUM_BARREN_NODES_FINDER_H */
Class representing Bayesian networks.
const NodeSet * _observed_nodes_
the set of observed nodes
const DAG * _dag_
the DAG on which we compute the barren nodes
BarrenNodesFinder & operator=(const BarrenNodesFinder &from)
copy operator
void setDAG(const DAG *new_dag)
sets a new DAG
void setEvidence(const NodeSet *observed_nodes)
sets the observed nodes in the DAG
void setTargets(const NodeSet *target_nodes)
sets the set of target nodes we are interested in
ArcProperty< Set< const Tensor< GUM_SCALAR > * > > barrenTensors(const CliqueGraph &junction_tree, const IBayesNet< GUM_SCALAR > &bn)
returns the set of barren tensors in messages sent in a junction tree
NodeSet barrenNodes()
returns the set of barren nodes
BarrenNodesFinder(const DAG *dag)
default constructor
const NodeSet * _target_nodes_
the set of targeted nodes
Basic graph of cliques.
Definition cliqueGraph.h:77
Base class for dag.
Definition DAG.h:121
Class representing the minimal interface for Bayesian network with no numerical data.
Definition IBayesNet.h:75
Basic class for all graphs of cliques (join trees, etc).
HashTable< Arc, VAL > ArcProperty
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