Check Direct Acyclic Graph (DAG) Condition
For a pair of node and parent lists, the function checks whether the DAG condition holds or not.
a list of nodes
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.
Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker.