powered by
is_dag() checks if a graph has a topological ordering (i.e. is a directed acyclic graph) using Kahn's algorithm.
is_dag()
is_dag(x)
A logical scalar.
logical
An adjacency matrix to be tested.
matrix
Kahn, A. B. (1962). Topological sorting of large networks. Communications of the ACM, 5(11), p. 558-562. tools:::Rd_expr_doi("10.1145/368996.369025").
Other predicates: predicate-matrix, predicate-numeric, predicate-scalar, predicate-trend, predicate-type, predicate-utils
predicate-matrix
predicate-numeric
predicate-scalar
predicate-trend
predicate-type
predicate-utils