Graph Depth first search traversal (DFS)
Application:
- Topological sorting
- Finding connected components
- Solving puzzles such as mazes
Source Code:
Github: DFS.java
Output:
DFS non-recursive : 3 2 1 0 DFS recursion : 1 2 3 0
Application:
Source Code:
Github: DFS.java
Output:
DFS non-recursive : 3 2 1 0 DFS recursion : 1 2 3 0