Problem B10 · Easy

Breadth-First Search: Explore in Layers

Compute shortest edge-count distances from a start vertex in an undirected unweighted graph.

Open the interactive visualisation