archgaelix

Count strongly connected components (Kosaraju algorithm)

1 min read

https://practice.geeksforgeeks.org/problems/strongly-connected-components-kosarajus-algo/1

← Find bridge in a graph
Check if graph is bipartite →