##
Check if a given directed graph is strongly connected | Set 2 (Kosaraju using BFS)
February 21, 2017

Given a directed graph, find out whether the graph is strongly connected or not. A directed graph is strongly connected if there is a path between any two pairs of vertices. There are different methods to check the connectivity of directed graph but one of the optimized method is Kosaraju’s DFS based simple algorithm. Kosaraju’s… Read More »