>_
SWE Maxx
Questions
Quizzes
Daily challenge
System design
My attempts
Sign in
☀
☾
Light mode
Dark mode
Loading question…
Sign in
Which topological-sorting algorithm repeatedly removes vertices with no remaining incoming edges? | SWE Maxx
← Question bank
Algorithms · Multiple Choice
Difficulty: Hard
Which topological-sorting algorithm repeatedly removes vertices with no remaining incoming edges?
Graph structure algorithms
Connectivity
Choose your answer
A
Tarjan's SCC algorithm
B
Kruskal's algorithm
C
Kosaraju's algorithm
D
Kahn's algorithm
Check answer
More in Algorithms →