A subset of vertices in a directed graph such that any two vertices in the subset can reach each other. Algorithms like Tarjan's algorithm and Kosaraju's algorithm are used to find strongly connected components.
A subset of vertices in a directed graph such that any two vertices in the subset can reach each other. Algorithms like Tarjan's algorithm and Kosaraju's algorithm are used to find strongly connected components.