An unweighted graph: distance is hops, fewest hops wins, a shortcut shrinks distance, or build your own in free play.
Unweighted · distance counts hops
vertex
active
seen d=k
path
BFS queue (front → back)
—
Step 0 / 0
Press Play. Every edge counts as one hop, so a vertex's distance is just how many edges away it sits from the source.
Speed
Click a vertex to pick the source — every d=k label recomputes live. Click two other vertices to toggle an edge; drag to move.