##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
(SCC detection)
Practice Problem: Given a directed graph with nodes and edges, find the number of SCCs. Input format: First line contains and . Next lines contain directed edges . Output: Print the number of SCCs.
Example: Graph , has SCCs: and . Try implementing this yourself using either Kosaraju or Tarjan before looking at the solution.
