minimalConditioningSet.h File Reference

Generic minimal conditioning set algorithm for directed graphs. More...

#include <agrum/agrum.h>
#include <agrum/base/graphs/graphConcepts.h>
#include <agrum/base/graphs/algorithms/generic/minimalConditioningSet_tpl.h>

Include dependency graph for minimalConditioningSet.h:

This graph shows which files directly or indirectly include this file:

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>
NodeSet	gum::graph::minimalCondSet (const G &g, NodeId target, const NodeSet &soids)
	Returns the minimal subset of soids that d-connects target.
template<GUM_DiGraphable G>
NodeSet	gum::graph::minimalCondSet (const G &g, const NodeSet &targets, const NodeSet &soids)
	Returns the minimal subset of soids that d-connects all targets.

Detailed Description

Generic minimal conditioning set algorithm for directed graphs.

minimalCondSet(g, target, soids) computes the smallest subset S of soids such that P(target | soids) = P(target | S) in a DAG context, i.e. the nodes of soids that are actually "relevant" to target via d-connected paths.

Constrained by GUM_DiGraphable — works on any directed graph whose nodes expose parents() and children().

Author

Pierre-Henri WUILLEMIN(_at_LIP6) and Christophe GONZALES(_at_AMU)

Definition in file minimalConditioningSet.h.