![]() |
aGrUM 3.0.0
a C++ library for (probabilistic) graphical models
|
Generic Markov-blanket algorithm for directed graphs. More...
#include <agrum/agrum.h>#include <agrum/base/graphs/DAG.h>#include <agrum/base/graphs/algorithms/generic/markovBlanket_tpl.h>Go to the source code of this file.
Namespaces | |
| namespace | gum |
| gum is the global namespace for all aGrUM entities | |
| namespace | gum::graph |
Functions | |
| template<GUM_DiGraphable G> | |
| DAG | gum::graph::markovBlanket (const G &g, NodeId node, int level=1) |
Returns the level-level Markov blanket of node in g as a DAG. | |
Generic Markov-blanket algorithm for directed graphs.
markovBlanket(g, node, level) builds the level-level Markov blanket of node in g as a DAG. Level 1 (default): parents ∪ children ∪ co-parents (parents of children). Level k > 1: iterates on newly added nodes up to k times.
Constrained by GUM_DiGraphable — works on any directed graph whose nodes expose parents(), children(), and exists().
Definition in file markovBlanket.h.