Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 40
What do Tarjan's and Kosaraju's algorithms find?
A
Minimum spanning trees
B
Shortest paths
C
Strongly connected components of a directed graph in O(V + E)
D
Maximum matchings