Detect Cycles in Directed Graph

MediumPython

Problem

Given a directed graph with n nodes labeled from 0 to n - 1 and a list of directed edges edges, determine whether the graph contains a cycle. Return True if any cycle exists and False otherwise. The graph may be disconnected.

Constraints

1 <= n <= 10^5
0 <= edges.length <= 2 * 10^5
0 <= u, v < n for every edge [u, v]
Self-loops and duplicate edges may appear

Function Signature

def has_cycle(n, edges):

CodePython 3

You need to log in / sign up to run or submit.Ln 2

Run your code to see test output here.