Which graph traversal guarantees finding the shortest path in an unweighted graph?

Explanation:
BFS explores nodes level by level, ensuring shortest paths in unweighted graphs.

Latest Blogs