Python, Graph, Algorithms.
as possible along each branch before backtracking. In DFS, the edges that leads to an unvisited node are called discovery edges while the edges that leads to an already visited node are called block edges. DFS uses a stack data structure to remember to get the next vertex to start a search when a