**What is a strongly connected component?**

A strongly connected component or SCC of a directed graph is a **maximal set of vertices’s in which there is a path from any one vertex to any other vertex in the set**. Or in other words it is a **maximal strongly connected subgraph***.*

Finding strongly connected components is a simple application of Depth First Search in Directed graphs.

For example **there are 3 SCC in the given graph**