• TOPOLOGICAL SORT ALGORITHM: A BFS APPROACH
Abstract
Topological sorting for directed acyclic graph (DAG) is linear ordering of vertices such that for directed edge uv, vertex u comes before v in the ordering. Topological sorting can be implemented using DFS. In this paper topological sorting is implemented using modified BFS algorithm.
Keywords
Topological sorting, DAG, DFS.
Full Text:
PDFThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2024 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |