• TOPOLOGICAL SORT ALGORITHM: A BFS APPROACH

ISHWAR BAIDARI*, AJITH HANAGWADIMATH

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:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2022 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility		Web Counter
https://journals.zetech.ac.ke/scatter-hitam/https://silasa.sarolangunkab.go.id/swal/https://sipirus.sukabumikab.go.id/storage/uploads/-/sthai/https://sipirus.sukabumikab.go.id/storage/uploads/-/stoto/https://alwasilahlilhasanah.ac.id/starlight-princess-1000/https://www.remap.ugto.mx/pages/slot-luar-negeri-winrate-tertinggi/https://waper.serdangbedagaikab.go.id/storage/sgacor/https://waper.serdangbedagaikab.go.id/public/images/qrcode/slot-dana/https://siipbang.katingankab.go.id/storage_old/maxwin/https://waper.serdangbedagaikab.go.id/public/img/cover/10k/https://waper.serdangbedagaikab.go.id/storage/app/https://waper.serdangbedagaikab.go.id/storage/idn/