New topological sort algorithm based on adjacency matrix
YU Wen-xian · Journal of Computer Applications · 2007
In order to decrease the complexity of the topological sort algorithms which are based on adjacency matrix, the single-vertex algorithm framework was expanded to the set algorithm framework, and some properties of Directed Acyclic Graph (DAG) propitious for topological sort were given. Based on these, some manipulations of the DAG's adjacency matrix were defined, a storage solution for DAG's adjacency matrix was given and a new topological sort algorithm with low computation and storage complexity was proposed.