Description Usage Arguments Value Examples
Verifies whether a given connection matrix is a Directed Acyclic Graph. verify_dag wraps check_dag for a recursive Depth First Search for acyclicity.
1 | verify_dag(DAG)
|
DAG |
A lower triangular matrix where the non zero elements what connections exist. The rows indicate the node where the edge is going to, and the columns indicates the node where the edge is coming from. |
A list of lists of errors and warnings respectively that indicate what conditions of the DAG requirements are not met.
1 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.