This function tests whether the given graph is a DAG, a directed acyclic graph.
The input graph. It may be undirected, in which case
is_dag checks whether there is a directed cycle in the graph. If not,
the graph is a DAG.
A logical vector of length one.
g <- make_tree(10) is_dag(g) g2 <- g + edge(5,1) is_dag(g2)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.