Challenge: Detect Cycle in a Directed Graph

Statement

Given a directed graph, check whether the graph contains a cycle and return a boolean value accordingly.

A cycle occurs when you can start at one vertex, follow a path through the edges, and return to the starting vertex. This means at least one vertex is visited more than once within the same traversal path.

Note: Edges list is interpreted in the following manner:

edges = [[0, 2, 1], [], [2, 1, 0]]

Interpretation:

$0: 0, 2, 1$
$1:$ None
$2: 2, 1, 0$

Constraints:

If n is the number of nodes in the graph.

• n $== edges.length$
• $0 \leq$ n $\leq 100$
• $0$ $\leq$ edges[i] $\leq$ $n$

Examples