aGrUM 3.0.0
a C++ library for (probabilistic) graphical models
barrenNodesFinder_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#include <agrum/BN/algorithms/barrenNodesFinder.h> // to ease IDE parser
44
45namespace gum {
46
47
50 _dag_(dag) { // for debugging purposes
51 GUM_CONSTRUCTOR(BarrenNodesFinder);
52 }
53
57 _target_nodes_(from._target_nodes_) { // for debugging purposes
58 GUM_CONS_CPY(BarrenNodesFinder);
59 }
60
63 _dag_(from._dag_), _observed_nodes_(from._observed_nodes_),
64 _target_nodes_(from._target_nodes_) {
65 // for debugging purposes
66 GUM_CONS_MOV(BarrenNodesFinder);
67 }
68
70 INLINE BarrenNodesFinder::~BarrenNodesFinder() { // for debugging purposes
71 GUM_DESTRUCTOR(BarrenNodesFinder)
72 }
73
76 if (this != &from) {
77 _dag_ = from._dag_;
80 }
81 return *this;
82 }
83
86 if (this != &from) {
87 _dag_ = from._dag_;
88 _observed_nodes_ = from._observed_nodes_;
89 _target_nodes_ = from._target_nodes_;
90 }
91 return *this;
92 }
93
95 INLINE void BarrenNodesFinder::setDAG(const DAG* new_dag) { _dag_ = new_dag; }
96
98 INLINE void BarrenNodesFinder::setEvidence(const NodeSet* observed_nodes) {
99 _observed_nodes_ = observed_nodes;
100 }
101
103 INLINE void BarrenNodesFinder::setTargets(const NodeSet* target_nodes) {
104 _target_nodes_ = target_nodes;
105 }
106
107
108} /* namespace gum */
Detect barren nodes for inference in 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
BarrenNodesFinder(const DAG *dag)
default constructor
const NodeSet * _target_nodes_
the set of targeted nodes
Base class for dag.
Definition DAG.h:121
Set< NodeId > NodeSet
Some typdefs and define for shortcuts ...
gum is the global namespace for all aGrUM entities
Definition agrum.h:46