In a directed graph, a Strongly Connected Component is a subset of vertices exactly where each vertex within the subset is reachable from each other vertex in the identical subset by traversing the directed edges. Findin$begingroup$ I do think I disagree with Kelvin Soh a little, in that he seems to allow for a path to repeat the identical vertex,