(To be removed) Test for cycles in directed graph
graphisdag will be removed in a future release. Use
|N-by-N adjacency matrix that represents a directed graph. Nonzero
entries in matrix |
For introductory information on graph theory functions, see Graph Theory Functions.
returns logical 1 (
true) if the directed graph represented by matrix
G is a directed acyclic graph (DAG) and logical 0
G is an N-by-N
adjacency matrix that represents a directed graph. Nonzero entries in matrix
G indicate the presence of an edge.
 Siek, J.G., Lee, L-Q, and Lumsdaine, A. (2002). The Boost Graph Library User Guide and Reference Manual, (Upper Saddle River, NJ:Pearson Education).