Perform topological sort of directed acyclic graph extracted from biograph object
|Biograph object created by |
Tip: For introductory information on graph theory functions, see Graph Theory Functions.
index vector with the order of the nodes sorted topologically. In
topological order, an edge can exist between a source node
a destination node
v, if and only if
v in the vector
a biograph object from which an N-by-N adjacency matrix is extracted
and represents a directed acyclic graph (DAG). In the N-by-N sparse
matrix, all nonzero entries 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).