Back
Strongly Connected Components
Question 1 of 12
8% Complete
Medium
Find strongly connected components in a directed graph.
A
Kosaraju's (two-pass) or Tarjan's (lowlink) algorithms
B
Topological sort
C
Dijkstra's algorithm
D
Kruskal's algorithm