2360. Longest Cycle in a Graph

You are given a directed graph of n nodes numbered from 0 to n - 1, where each node has at most one outgoing edge.

The graph is represented with a given 0-indexed array edges of size n, indicating that there is a directed edge from node i to node edges[i]. If there is no outgoing edge from node i, then edges[i] == -1.

Return the length of the longest cycle in the graph. If no cycle exists, return -1.

A cycle is a path that starts and ends at the same node.

Example 1:

Input: edges = [3,3,4,2,3]
Output: 3

Explanation: The longest cycle in the graph is the cycle: 2 -> 4 -> 3 -> 2.
The length of this cycle is 3, so 3 is returned.

Example 2:

Input: edges = [2,-1,3,1]
Output: -1

Explanation: There are no cycles in this graph.

Constraints:

• n == edges.length
• 2 <= n <= 105
• -1 <= edges[i] < n
• edges[i] != i

---

每一个 node 可能有多个 from， 但是 to 只有一个， 所以我们将每个 node 的 to 收集起来作为当前 node 的 parents， 同时记录下 node[i]与 parents[i]的距离， 我们 bfs 更新 parents， 假设 parents[i] = (parent, parent_distance), parents[parent] = (parent_of_parent, parent_of_parent_distance), 那我们就可以更新 parents[i] = (parent_of_parent, parent_distance + parent_of_parent_distance), 但是要注意， 如果 parent == parent_of_parent 则证明 parents[parent]已经形