Shortest Path in Unweighted Graph - BFS — Interactive Visualizer

Finds the shortest path from a source node to all other nodes in an unweighted graph using Level Order Traversal (BFS).