These are maximal subsets of vertices reachable from each other in a directed graph. {e,o}, {f,g,h,k}, {m} Algorithms Kosarajuās Algorithm
, ,