isDAG {catnet}R Documentation

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

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.

Value

A logical TRUE/FALSE value.

Author(s)

N. Balov

Examples

  cnet <- cnRandomCatnet(numnodes=20, maxParents=3, numCategories=2)
  isDAG(lnodes=cnet@nodes, lpars=cnet@parents)

[Package catnet version 1.15.7 Index]