16. Cycle Detection In Directed Graph Using DFS – DSA Problem Solution

16. Cycle Detection In Directed Graph Using DFS

Medium

Given a Directed Graph with V vertices and E edges, check whether it contains any cycle or not.

1Example 1

Input:

{
  "V": 4,
  "adj": [
    [
      1
    ],
    [
      2
    ],
    [
      3
    ],
    [
      1
    ]
  ]
}

Output:

true

2Example 2

Input:

{
  "V": 3,
  "adj": [
    [
      1
    ],
    [
      2
    ],
    []
  ]
}

Output:

false

3Example 3

Input:

{
  "V": 5,
  "adj": [
    [
      1
    ],
    [
      2
    ],
    [
      3,
      4
    ],
    [
      1
    ],
    []
  ]
}

Output:

true

16. Cycle Detection In Directed Graph Using DFS – DSA Problem Solution | DSAPrime