>_
SWE Maxx
Questions
Quizzes
Daily challenge
System design
My attempts
Sign in
☀
☾
Light mode
Dark mode
Loading question…
Sign in
Which minimum-spanning-tree algorithm grows one tree by repeatedly selecting its lightest outgoing connecting edge? | SWE Maxx
← Question bank
Algorithms · Multiple Choice
Difficulty: Hard
Which minimum-spanning-tree algorithm grows one tree by repeatedly selecting its lightest outgoing connecting edge?
Graph structure algorithms
Connectivity
Choose your answer
A
Prim's algorithm
B
Kosaraju's algorithm
C
Kahn's algorithm
D
Tarjan's SCC algorithm
Check answer
More in Algorithms →