Detect Cycles in Resource Graph

Problem

Given a directed graph representing resource allocation dependencies between microservices, determine whether the graph contains a cycle. The input consists of an integer n for the number of nodes labeled 0 to n - 1, and a list of directed edges edges where each edge [u, v] means service u is waiting on service v. Return True if any cycle exists, otherwise return False.

Constraints

• 1 <= n <= 10^5
• 0 <= len(edges) <= 2 * 10^5
• edges[i].length == 2
• 0 <= u, v < n
• Self-loops are allowed