Per Wikipedia:
"In computer science, a topological sort or topological ordering of a directed
graph is a linear ordering of its vertices such that, for every edge uv, u
comes before v in the ordering."
As a fundamental graph algorithm, VisiGraph is remissed for its lack thereof.
Thus, standard algorithms must be implemented, using both DFS- and
source-queue-based algorithms.
Original issue reported on code.google.com by 0x24a53...@gmail.com on 1 Jul 2011 at 2:26
Original issue reported on code.google.com by
0x24a53...@gmail.com
on 1 Jul 2011 at 2:26