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