Strongly Connected Components Count

Hard Graph Algorithms (Advanced)

Log in to solve

Given a directed graph, print the number of strongly connected components.

Constraints

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

No discussions yet.