powered by
For a pair of node and parent lists, the function checks whether the DAG condition holds or not.
isDAG(lnodes, lpars)
A logical TRUE/FALSE value.
a list of nodes
a list of node parents
N. Balov
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.
cnet <- cnRandomCatnet(numnodes=20, maxParents=3, numCategories=2) isDAG(lnodes=cnet@nodes, lpars=cnet@parents)
Run the code above in your browser using DataLab