## Check if given Graph is Strongly Connected or not using one DFS Traversal

Given a directed graph, check if it is strongly connected or not. A directed graphs is said to be strongly connected if every vertex is reachable from every other vertex.

Read More Check if given Graph is Strongly Connected or not using one DFS Traversal