Given a graph, the task is to print the DFS traversal of a graph which includes the every step including the backtracking.
1st step:- 0 -> 1 2nd step:- 1 -> 5 3rd step:- 5 -> 1 (backtracking step) 4th step:- 1 -> 6... and so on till all the nodes are visited. Dfs step-wise(including backtracking) is: 0 1 5 1 6 7 8 7 6 1 0 2 4 2 9 3 10
Note: In this above diagram the weight between the edges has just been added, it does not have any role in DFS-traversal
Approach: DFS with Backtracking will be used here. First, visit every node using DFS simultaneously and keep track of the previously used edge and the parent node. If a node comes whose all the adjacent node has been visited, backtrack using the last used edge and print the nodes. Continue the steps and at every step, the parent node will become the present node. Continue the above steps to find the complete DFS traversal of the graph.
Below is the implementation of the above approach:
0 1 5 1 6 7 8 7 6 1 0 2 4 2 9 3 10
- Subset Sum | Backtracking-4
- Rat in a Maze | Backtracking-2
- Sudoku | Backtracking-7
- Backtracking | Introduction
- Backtracking to find all subsets
- Rat in a Maze | Backtracking using Stack
- Hamiltonian Cycle | Backtracking-6
- m Coloring Problem | Backtracking-5
- N Queen Problem | Backtracking-3
- Magnet Puzzle | Backtracking-9
- Top 20 Backtracking Algorithm Interview Questions
- Word Break Problem using Backtracking
- The Knight's tour problem | Backtracking-1
- Solving Cryptarithmetic Puzzles | Backtracking-8
- A backtracking approach to generate n bit Gray Codes
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.