(To be removed) Perform topological sort of directed acyclic graph
graphtopoorder will be removed in a future release. Use
|N-by-N adjacency matrix that represents a directed acyclic graph.
Nonzero entries in matrix |
For introductory information on graph theory functions, see Graph Theory Functions.
returns an index vector with the order of the nodes sorted topologically. In topological
order, an edge can exist between a source node
u and a destination
v, if and only if
u appears before
v in the vector
G is an N-by-N adjacency matrix that represents a
directed acyclic graph (DAG). Nonzero entries in matrix
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).