aGrUM
3.2.0
a C++ library for (probabilistic) graphical models
Toggle main menu visibility
dSeparationAlgorithm.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
48
49
#ifndef GUM_D_SEPARATION_ALGORITHM_H
50
#define GUM_D_SEPARATION_ALGORITHM_H
51
52
53
#include <
agrum/agrum.h
>
54
55
#include <
agrum/BN/IBayesNet.h
>
56
57
namespace
gum
{
58
63
class
GUM_PUBLIC_BN
dSeparationAlgorithm
{
64
public
:
65
// ############################################################################
67
// ############################################################################
69
71
dSeparationAlgorithm
();
72
74
dSeparationAlgorithm
(
const
dSeparationAlgorithm
& from);
75
77
dSeparationAlgorithm
(
dSeparationAlgorithm
&& from);
78
80
~dSeparationAlgorithm
();
81
83
84
85
// ############################################################################
87
// ############################################################################
89
91
dSeparationAlgorithm
&
operator=
(
const
dSeparationAlgorithm
& from);
92
94
dSeparationAlgorithm
&
operator=
(
dSeparationAlgorithm
&& from);
95
97
98
99
// ############################################################################
101
// ############################################################################
103
110
void
requisiteNodes
(
const
DAG
& dag,
111
const
NodeSet
& query,
112
const
NodeSet
& hardEvidence,
113
const
NodeSet
& softEvidence,
114
NodeSet
& requisite)
const
;
115
118
template
< GUM_Numeric GUM_SCALAR,
class
TABLE >
119
void
relevantTensors
(
const
IBayesNet< GUM_SCALAR >
& bn,
120
const
NodeSet
& query,
121
const
NodeSet
& hardEvidence,
122
const
NodeSet
& softEvidence,
123
Set< const TABLE* >
& tensors);
124
126
};
127
128
129
}
/* namespace gum */
130
131
132
#ifndef GUM_NO_INLINE
133
# include <
agrum/BN/algorithms/dSeparationAlgorithm_inl.h
>
134
#endif
// GUM_NO_INLINE
135
136
#include <
agrum/BN/algorithms/dSeparationAlgorithm_tpl.h
>
137
138
139
#endif
/* GUM_D_SEPARATION_ALGORITHM_H */
IBayesNet.h
Class representing the minimal interface for Bayesian network with no numerical data.
agrum.h
gum::DAG
Base class for dag.
Definition
DAG.h:121
gum::IBayesNet
Class representing the minimal interface for Bayesian network with no numerical data.
Definition
IBayesNet.h:75
gum::Set
Representation of a set.
Definition
set.h:129
gum::dSeparationAlgorithm::requisiteNodes
void requisiteNodes(const DAG &dag, const NodeSet &query, const NodeSet &hardEvidence, const NodeSet &softEvidence, NodeSet &requisite) const
Fill the 'requisite' nodeset with the requisite nodes in dag given a query and evidence.
Definition
dSeparationAlgorithm.cpp:90
gum::dSeparationAlgorithm::operator=
dSeparationAlgorithm & operator=(const dSeparationAlgorithm &from)
copy operator
gum::dSeparationAlgorithm::dSeparationAlgorithm
dSeparationAlgorithm()
default constructor
Definition
dSeparationAlgorithm.cpp:65
gum::dSeparationAlgorithm::relevantTensors
void relevantTensors(const IBayesNet< GUM_SCALAR > &bn, const NodeSet &query, const NodeSet &hardEvidence, const NodeSet &softEvidence, Set< const TABLE * > &tensors)
update a set of tensors, keeping only those d-connected with query variables given evidence
Definition
dSeparationAlgorithm_tpl.h:59
dSeparationAlgorithm_inl.h
d-separation analysis (as described in Koller & Friedman 2009)
dSeparationAlgorithm_tpl.h
d-separation analysis (as described in Koller & Friedman 2009)
gum::NodeSet
Set< NodeId > NodeSet
Some typdefs and define for shortcuts ...
Definition
graphElements.h:392
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