See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
10 cards from this deck
Minimum spanning tree (MST)
Adds the smallest connecting edge at each step
When graph is represented as a matrix
Select any vertex to begin the MST
When all vertices are included in the MST
No edge exists between vertices iii and jjj
O(v2)O(v^2)O(v2)
v−1v-1v−1 edges
Total weight of edges
Select your subjects, and get access to A+ resources today.