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
• Kruskal's Algorithm
How does Kruskal's Algorithm build a Minimum Spanning Tree?
A
By growing a single tree from one starting vertex
B
By sorting all edges by weight and adding them one by one, skipping edges that would form a cycle
C
By using only BFS
D
By using a priority queue of vertices