Description: The so-called topological sorting refers to the vertex order in accordance with the topology. There are several simple algorithm can find the order of a topological map. The idea of an algorithm as follows: (1) in the directed graph to find a follow-up (or precursor) is added to the vertex and vertex table. (2) from the plan to remove all of the vertex and the vertex for the head (tail) of the arc.
To Search:
File list (Check if you may need any files):
有向无环图的拓扑排序和关键路径.cpp
Download