You are given a directed graph with V vertices and its adjacency list. Your task is to determine whether the graph contains a cycle using Depth First Search (DFS).
Return true if a cycle exists; otherwise, return false.
Input: V = 3, edges = [[0,1],[1,2],[2,0]]
Output: true
Explanation: The directed graph contains a cycle.
Input: V = 4, edges = [[0,1],[1,2],[2,3]]
Output: false
Explanation: The directed graph is acyclic.
Input: V = 1, edges = []
Output: false
Explanation: The graph contains no cycle.
Approach, complexity and clean code in every language. Sign in to unlock the editorial.
Your submissions, results and runtime history live here. Sign in to start your streak.
3 3 0 1 1 2 2 0
true
3 2 0 1 1 2
false