Template Function ADS::topsortKahn

• Defined in File Visit.h

Function Documentation

template<Graph G>
std::vector<int> ADS::topsortKahn(const G &g)

the topological order by removing the nodes with no entering edge, in the order of V() and then of discovery; fewer than n nodes if there is a cycle

Post:

a topological order if it has all the nodes (audit)