pub fn top_sort(
graph: impl RandomAccessGraph,
pl: &mut impl ProgressLog,
) -> Box<[usize]>Expand description
Returns the node of the graph in topological-sort order, if the graph is acyclic.
Otherwise, the order reflects the exit times from a depth-first visit of the graph.