Applications of Depth-First Search

Abstract

Abstract
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.

Keywords: depth-first search, articulation point, strongly connected component, detecting cycle, graph, topological sort, railway rescheduling