Breadth First Search
1. Consider the following graph:
Vertices, V = [a, b, c , d, e, f]
Edges, E = [[a, b], [a c], [b, d], [b, e], [c, e], [c, f]]
Where each array within E signifies an edge between the two mentioned vertices.
How many iterations of the queue would it take for the algorithm to traverse this graph completely?
Vertices, V = [a, b, c , d, e, f]
Edges, E = [[a, b], [a c], [b, d], [b, e], [c, e], [c, f]]
Where each array within E signifies an edge between the two mentioned vertices.
How many iterations of the queue would it take for the algorithm to traverse this graph completely?
2. When will the space complexity of BFS be greater than DFS? Note that maximum height in the options refers to the longest thread of vertices from the root to a leaf or final non-repeating vertex.