Leetcode 2204. Distance to a Cycle in Undirected Graph

Given an undirected graph, return for every vertex the shortest distance to the nearest vertex that lies on any cycle. Key idea: identify cycle vertices by iteratively pruning leaves (nodes not part of any cycle) and then perform a multi-source BFS from remaining cycle nodes to compute distances.