activePaths

the graph either in one of the package <code>graph</code> classes, or of class <code>bn</code> or <code>pcAlgo</code>

graph

the source node of the path (index not name)

node

optionally specify node names which can be used to return those instead of indicies

nodeNames

Find all active paths in a (partially) directed graph

Distinguish direct from indirect interactions in gene
regulation and infer combinatorial code from highly correlated
variables such as transcription factor binding profiles. The
package implements the Neighbourhood Consistent PC algorithm
(NCPC) and draws Direct Dependence Graphs to represent
dependence structure around a target variable. The package also
provides a unified interface to other Graphical Modelling
(Bayesian Network) packages for distinguishing direct and
indirect interactions.

activePaths: Find all active paths in a (partially) directed graph...

Description

Usage

Arguments

Value