Distance from every node to the cycle

A connected graph contains exactly one cycle. For every node, return its distance to the nearest node on the cycle. Find the cycle by trimming leaves, then run a multi-source BFS outward. Only the title of this report was public; the details follow the common version.