Strongly Connected Components

Home > Mathematics > Graph theory > Graph algorithms > Strongly Connected Components

Identifying groups of vertices in a directed graph where each vertex can reach any other vertex in the same group.