Find strongly connected components for an undirected graph

Statement

Find strongly connected components in an directed graph

Given a directed graph how can we find a mapping from it’s vertices to the strongly connected components of .

Solutions

• DFS for finding strongly connected components
  • This runs in time.
  • It also outputs the strongly connected components in a reverse topologically sort.