(Removed) Perform topological sort of directed acyclic graph extracted from biograph object
The function has been removed. Use
|Biograph object created by |
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
BGObj is 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).