Practice Problem 1

Practice Problem: Given a directed graph with $n$ nodes and $m$ edges, find the number of SCCs. Input format: First line contains $n$ and $m$. Next $m$ lines contain directed edges $u \to v$. Output: Print the number of SCCs.

Example: Graph $1 \to 2 \to 3 \to 1$, $4 \to 5 \to 4$ has $2$ SCCs: $\{1, 2, 3\}$ and $\{4, 5\}$. Try implementing this yourself using either Kosaraju or Tarjan before looking at the solution.