Detect Cycle in a Directed Graph

Given a directed graph with `V` vertices (labeled from `0` to `V - 1`) and `E` directed edges, determine whether the graph contains any cycle. ### Input Format - First line contains two integers `V` and `E`. - The next `E` lines each contain two integers `u` and `v`, representing a directed edge from `u` to `v`. ### Output Format - Print `true` if the graph contains at least one directed cycle, otherwise print `false`. ### Constraints - `1 <= V <= 10^4` - `0 <= E <= 10^5` - `0 <= u, v < V`