## Detect Cycle in Directed Graph

Problem Statement Given a Directed graph $G=(V, E)$ with $V$ vertices numbered from $0$ to $V-1$ and $E$ edges. The task is to detect cycle in the directed graph $i.e.$ to check if there exists a cycle in the given graph. Examples Example 1 Input: Output:NO Explanation: No cycle exists in the above give Directed ...