Solution: Longest Cycle in a Graph
In Solution: Longest Cycle in a Graph, an array defines a directed graph where each node has at most one outgoing edge. Return the length of the longest cycle, or -1 if none exists.
We'll cover the following...
We'll cover the following...
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 nodeito nodeedges[i]. ...