Problem B10 · Easy
Compute shortest edge-count distances from a start vertex in an undirected unweighted graph.
Open the interactive visualisation