Challenge: Detect Cycle in a Directed Graph

The task involves determining whether a directed graph contains a cycle, which occurs when a vertex can be revisited through a path of edges. A cycle indicates that at least one vertex is encountered more than once during traversal. The edges of the graph are represented in a specific format, and the problem constraints specify that the number of nodes can range from 0 to 100.