The document provides examples of breadth-first search (BFS) and depth-first search (DFS) implementations in a problem-solving context. It outlines various paths explored in both search algorithms, starting from the initial state 'a' and leading to the goal state 'g'. The examples illustrate the sequential nature of each search strategy in traversing nodes.

1. By - Er. Suraj Awal
Uninformed Search Examples

2. Problem Statement :
Current State = A
Goal State = G

3. BFS Implementation

4. BFS (Path)
A

5. BFS (Path)
A - B

6. BFS (Path)
A - B - C

7. BFS (Path)
A - B - C -
D

8. BFS (Path)
A - B - C -
D - E

9. BFS (Path)
A - B - C -
D - E - F

10. BFS (Path)
A - B - C -
D - E - F -
G

11. DFS Implementation

12. DFS (Path)
A

13. DFS (Path)
A - B

14. DFS (Path)
A - B - D

15. DFS (Path)
A - B - D -
E

16. DFS (Path)
A - B - D -
E - C

17. DFS (Path)
A - B - D -
E - C - F

18. DFS (Path)
A - B - D -
E - C - F -
G