Abstract—In a Directed Acyclic Graph (DAG), vertex A and vertex B are connected by a directed edge AB which shows that A comes before B in the ordering. In this way, we can find a sorting algorithm totally different from Kahn or DFS algorithms, the directed edge already tells us the order of the nodes, so that it can simply be sorted by re-ordering the nodes according to the edges from a Direction Matrix. No vertex is specifically chosen, which makes the complexity to be O*E. Then we can get an algorithm that has much lower complexity than Kahn and DFS. At last, the implement of the algorithm by matlab script will be shown in the appendix part.br />
Index Terms—DAG, algorithm, complexity, matlab.
Renkun Liu is with Beijing R&D Center, Beijing, China (e-mail: email@example.com).
Cite: Renkun Liu, "A Low Complexity Topological Sorting Algorithm for Directed Acyclic Graph," International Journal of Machine Learning and Computing vol.4, no. 2, pp. 194-197, 2014.