isDAG | R Documentation |
For a pair of node and parent lists, the function checks whether the DAG condition holds or not.
isDAG(lnodes, lpars)
lnodes |
a list of nodes |
lpars |
a list of node parents |
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.
A logical TRUE/FALSE value.
N. Balov
cnet <- cnRandomCatnet(numnodes=20, maxParents=3, numCategories=2) isDAG(lnodes=cnet@nodes, lpars=cnet@parents)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.