Skip to main content
Loading page content
Explore
Learnings
Mental Math
Dashboard
More
Algo
Flow
Visualizers
Learnings
Quizzes
Mental Math
Dashboard
Log in
Sign up
Loading quiz challenge
Back to Visualizer
Question 1 of 5
Minimum Spanning Tree
• Prim's Algorithm
How does Prim's Algorithm build a Minimum Spanning Tree (MST)?
A
By sorting all edges first and adding them in order regardless of connectivity
B
By growing a single tree from a starting vertex, repeatedly adding the minimum weight edge that connects a new vertex to the tree
C
By processing vertices randomly
D
By removing edges from a complete graph