![]() |
aGrUM 3.0.0
a C++ library for (probabilistic) graphical models
|
Template implementations for reachability.h. More...
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::ancestors (const G &g, NodeId id) |
Returns the set of all ancestors of id (nodes from which id is reachable following arc direction). | |
| template<GUM_DiGraphable G> | |
| NodeSet | gum::graph::descendants (const G &g, NodeId id) |
Returns the set of all descendants of id (nodes reachable from id following arc direction). | |
| template<GUM_DiGraphable G> | |
| NodeSet | gum::graph::family (const G &g, NodeId id) |
Returns the family of id : { id } ∪ parents(id). | |
| template<GUM_DiGraphable G> | |
| NodeSet | gum::graph::family (const G &g, const NodeSet &ids) |
Returns the union of families of all nodes in ids. | |
| template<GUM_UndiGraphable G> | |
| NodeProperty< NodeId > | gum::graph::chainComponents (const G &g) |
Returns a node-to-component-id mapping for the chain components of g (connected components of the edge-only subgraph). | |
| template<GUM_NodeGraphable G> | |
| NodeProperty< NodeId > | gum::graph::connectedComponents (const G &g) |
Returns a node-to-component-id mapping for the (weakly) connected components of g. | |
| template<GUM_UndiGraphable G> | |
| bool | gum::graph::areConnected (const G &g, const NodeSet &A, const NodeSet &B) |
Returns true iff some node in A can reach some node in B via undirected edges. | |
| template<GUM_MixedGraphable G> | |
| NodeSet | gum::graph::chainComponent (const G &g, NodeId node) |
Returns the chain component of node in g. | |
| template<GUM_MixedGraphable G> | |
| NodeSet | gum::graph::boundary (const G &g, NodeId node) |
Returns the boundary of node: neighbours ∪ parents ∪ children. | |
Template implementations for reachability.h.
Definition in file reachability_tpl.h.