• Jul 03, 2017 News!Good News! Since 2017, IJMLC has been indexed by Scopus!
  • Nov 14, 2017 News!Vol.7, No.5 has been published with online version.   [Click]
  • Aug 15, 2017 News![CFP] 2017 the annual meeting of IJMLC Editorial Board, ACMLC 2017, will be held in Singapore, December 8-10, 2017   [Click]
General Information
Dr. Lin Huang
Metropolitan State University of Denver, USA
It's my honor to take on the position of editor in chief of IJMLC. We encourage authors to submit papers concerning any branch of machine learning and computing.
IJMLC 2014 Vol.4(2): 194-197 ISSN: 2010-3700
DOI: 10.7763/IJMLC.2014.V4.411

A Low Complexity Topological Sorting Algorithm for Directed Acyclic Graph

Renkun Liu
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: liurenkun1985@163.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.

Copyright © 2008-2015. International Journal of Machine Learning and Computing. All rights reserved.
E-mail: ijmlc@ejournal.net