Microsoft

Distance from Each Node to the Cycle in an Undirected Graph

Members only

Given an undirected graph that contains exactly one cycle, return for every node its shortest distance to any node on the cycle. Cycle nodes return 0.