Applications of Depth-First Search
Klíčová slova:
depth-first search, articulation point, strongly connected component, detecting cycle, graph, topological sort, railway reschedulingAbstrakt
In this paper, various applications of depth-first search algorithms (DFS) are surveyed. The value of DFS or “Backtracking” as a technique for solving problem is illustrated by many applications such as cycle detection, strongly connected components, topological sort, and find articulation point in a graph. The time complexity in different applications of DFS is also summarized..
Publikováno
Číslo
Sekce
Licence
Declaration and Copyright Transfer Form
(to be completed by authors)
I/ We, the undersigned author(s) of the submitted manuscript, hereby declare, that the above manuscript which is submitted for publication in the STM Journals(s), is not published already in part or whole (except in the form of abstract) in any journal or magazine for private or public circulation, and, is not under consideration of publication elsewhere.
· I/We will not withdraw the manuscript after 1 week of submission as I have read the Author Guidelines and will adhere to the guidelines.
· I/We Author(s ) have niether given nor will give this manuscript elsewhere for publishing after submitting in STM Journal(s).
· I/ We have read the original version of the manuscript and am/ are responsible for the thought contents embodied in it. The work dealt in the manuscript is my/ our own, and my/ our individual contribution to this work is significant enough to qualify for authorship.
· I/We also agree to the authorship of the article in the following order:
Author’s name
1. ________________
2. ________________
3. ________________
4. _______________
We Author(s) tick this box and would request you to consider it as our signature as we agree to the terms of this Copyright Notice, which will apply to this submission if and when it is published by this journal. |
