Leetcode Problem 2204. Distance to a Cycle in Undirected Graph

2204. Distance to a Cycle in Undirected Graph

Leetcode Solutions

Create a graph representation and an in-degree map from the given edges.
Initialize a set s with all node indices and a deque dq.
Add all nodes with in-degree 1 (leaves) to dq.
Perform a modified topological sort by removing leaves from s and updating in-degrees until dq is empty, leaving only cycle nodes in s.
Initialize a result list res with -1 for all nodes.
Add all nodes in s (cycle nodes) to dq and set their distance to 0 in res.
Perform BFS from the nodes in dq, updating the distance for each node in res.
Return the res list containing the minimum distances.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen