BFS and DFS are algorithms for traversing or searching graph data structures. BFS uses a queue to visit nodes level by level, making it slower but able to find the shortest path. DFS uses a stack to visit nodes depth-wise, making it faster but unable to find the shortest path. Both BFS and DFS have a time complexity of O(V+E) where V is the number of vertices and E is the number of edges.

1. BFS and DFS
Name: Abdullah Al Amin
ID: 171-15-9365
Name: Momtaj Jahan Akhi
ID: 171-15-9380

2. What is Graph?
 A set of vertices and edges.
Undirected/Directed
Weighted/Unweighted
Cyclic/Acyclic

3.  Breadth First Search (BFS)
BFS is an algorithm for traversing or searching tree or graph data
Structure.
The Breadth First Search uses a FIFO queue.
Graph Traversal
 Depth First Search (DFS)
Once a possible path is found, continue the search until the end
of the path.
The Depth First Search uses a LIFO stack.

4. Difference Between BFS and DFS
BFS DFS
BFS visit nodes level by level. DFS visit nodes of graph depth wise.
We can’t visit a level without visiting it’s
previous level.
It is not necessary to maintain level.
To implement BFS we need to use
Queue.
To implement DFS we need to use
Stack.
BFS is slower and need more memory. DFS is faster and required lss memory.
It is used to find Shortest path, testing a
graph for bipartite.
It is used for topological sorting, solving
puzzles such as maze.

5. BFS Simulation

6. BFS Simulation

7. DFS Simulation

8. DFS Simulation

9. Time Complexity
The Time complexity of both BFS and DFS will be O(V + E) .
where V is the number of vertices, and E is the number of Edges.