Longest Cycle in a Graph

Explore methods to detect the longest cycle in a directed graph with constraints that each node has at most one outgoing edge. Understand how to analyze the graph structure, apply traversal techniques, and implement an efficient solution to determine cycle length or identify if no cycle exists.

We'll cover the following...

Statement
Examples
Understand the problem
Figure it out!
Try it yourself

Statement

You are given a directed graph with n nodes, labeled from 0 to n - 1. Each node in the graph has at most one outgoing edge.

The graph is described using a 0-indexed integer array edges of length n, where:

edges[i] represents a directed edge from node i to node edges[i].
If node i has no outgoing edge, then edges[i] == -1.

Your task is to find the longest cycle length in the graph. If no cycle exists, return -1.

Note: A cycle is defined as a path that starts and ends at the same node, following the direction of the edges.

Constraints:

n ...