aGrUM 3.0.0
a C++ library for (probabilistic) graphical models
bayesBall.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
70#ifndef GUM_GRAPH_BAYESBALL_H
71#define GUM_GRAPH_BAYESBALL_H
72
73#include <utility>
74
75#include <agrum/agrum.h>
76
78
79namespace gum::graph {
80
82
88 template < GUM_DiGraphable G, bool CollectAll >
89 NodeSet _bayesBall_(const G& g, const NodeSet& query, const NodeSet& Zhard, const NodeSet& Zsoft);
90
92
113 template < GUM_DiGraphable G >
114 NodeSet requisiteNodes(const G& g,
115 const NodeSet& query,
116 const NodeSet& Zhard = NodeSet(),
117 const NodeSet& Zsoft = NodeSet());
118
135 template < GUM_DiGraphable G >
136 NodeSet dConnected(const G& g,
137 const NodeSet& query,
138 const NodeSet& Zhard = NodeSet(),
139 const NodeSet& Zsoft = NodeSet());
140
141} // namespace gum::graph
142
144
145#endif // GUM_GRAPH_BAYESBALL_H
C++20 concepts for aGrUM graph interfaces.
Set< NodeId > NodeSet
Some typdefs and define for shortcuts ...
NodeSet _bayesBall_(const G &g, const NodeSet &query, const NodeSet &Zhard, const NodeSet &Zsoft)
NodeSet requisiteNodes(const G &g, const NodeSet &query, const NodeSet &Zhard=NodeSet(), const NodeSet &Zsoft=NodeSet())
Returns the Shachter-requisite nodes for query given evidence.
NodeSet dConnected(const G &g, const NodeSet &query, const NodeSet &Zhard=NodeSet(), const NodeSet &Zsoft=NodeSet())
Returns all nodes d-connected to query given evidence.