Admissions guidance, study banks, and career tools — get started on Shalyam

Sign in Get started

Count Strongly Connected Components

Hard Functional Graphs & Cycles

Log in to solve

Print the number of strongly connected components of a directed graph.

Constraints

1 <= n <= 10^5

Discussion

No discussions yet.