blockingNodes: Find all such nodes in neighbourhood of source node that are...
In ddgraph: Distinguish direct and indirect interactions with Graphical Modelling

Find all such nodes in neighbourhood of source node that are blocking at least one active path leading to another node

1	blockingNodes(allPaths, nodes)

`allPaths`	a list of active paths from a source node (as produced by activePaths())
`nodes`	a vector of target nodes for which we are finding blocking nodes

a list with blocking nodes and minimal length to the target node: target node => blocked by => number of steps

ddgraph documentation built on Nov. 17, 2017, 10:50 a.m.

ddgraph index

Package overview Overview of the 'ddgraph' package

Note that we can't provide technical support on individual packages. You should contact the package authors for that.

Description