Breadth First Search (Shortest Reach)Compute shortest distances from a start node in an undirected graph with uniform edge weight using BFS.