Longest Path in a DAG

Medium Topological Sort & DAG

Log in to solve

Given a directed acyclic graph, print the number of edges on the longest path in it.

Constraints

1 <= n <= 10^5 0 <= m <= 2 * 10^5

No discussions yet.