DFS is an algorithm for traversing tree and graph data structures. It starts at a node, marks it as visited, and adds its unvisited neighbors to a stack. It then pops the top node from the stack and repeats this process, popping elements off the stack until none remain or are reachable, marking all visited nodes along the way. The example shows DFS traversing a graph from node A to fully explore it in depth-first order.

1. Depth First Search
Presented By:
Minhaz Uddin
ID: 151001612

2. DFS Definition:
DFS is an algorithm for traversing or searching tree
or graph data structures.
DFS Algorithm:
1.Taking a start node. It mark as visited and this
our current node.
2. Look at all the adjacent nodes. Add those nodes
which have not been visited to the stack.

3. 3. Then pop the top node and Follow the first two
steps.
4.The process is continue until all the node mark as
visited.

4. DFS Example :
A
E
D
C
B
Stack

5. Output: A
A
E
D
C
B
Stack
A

6. Output: A B D
A
E
D
C
B
Stack
D
B
A

7. Output: A B D
A
E
D
C
B
Stack
B
A

8. Output: A B D
A
E
D
C
B
Stack
A

9. Output: A B D E C
A
E
D
C
B
Stack
C
E
A

10. Output: A B D E C
A
E
D
C
B
Stack
E
A

11. Output: A B D E C
A
E
D
C
B
Stack
A

12. Output: A B D E C
DFS is done.
A
E
D
C
B
Stack