Longest Cycle in a Graph

Explore methods to find the longest cycle in a directed graph where each node has at most one outgoing edge. Understand how to interpret the graph's structure through an array representation, apply cycle detection techniques, and implement solutions that return the length of the longest cycle or indicate if none exist.

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 ...