Check if a graph is directed and acyclic, converting the interaction matrix into a positive-only format that can be checked by igraph::is.dag
1 | isDAG(myDAG)
|
myDAG |
your input graph, in the form of a matrix with values -1, 0, or +1 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.