sdnet (version 2.4.1)

isDAG: Check Direct Acyclic Graph (DAG) Condition

Description

For a pair of node and parent lists, the function checks whether the DAG condition holds or not.

Usage

isDAG(lnodes, lpars)

Arguments

lnodes

a list of nodes

lpars

a list of node parents

Value

A logical TRUE/FALSE value.

Details

The DAG verification algorithm is based on the topological ordering of the graph nodes. If node ordering is not possible, the graph is not a DAG.

Examples

# NOT RUN {
  cnet <- cnRandomCatnet(numnodes=20, maxpars=3, numcats=2)
  isDAG(lnodes=cnet@nodes, lpars=cnet@pars)
# }