>_
SWE Maxx
Questions
Quizzes
Daily challenge
System design
My attempts
Sign in
☀
☾
Light mode
Dark mode
Loading question…
Sign in
Which strongly-connected-component algorithm uses two depth-first passes and the transposed graph? | SWE Maxx
← Question bank
Algorithms · Multiple Choice
Difficulty: Extra Hard
Which strongly-connected-component algorithm uses two depth-first passes and the transposed graph?
Graph structure algorithms
Connectivity
Choose your answer
A
Kruskal's algorithm
B
Kahn's algorithm
C
Kosaraju's algorithm
D
Prim's algorithm
Check answer
More in Algorithms →