1/6
Looks like no tags are added yet.
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai |
|---|
No analytics yet
Send a link to your students to track their progress
Minimum Spanning Tree Algorithms
Kruskals
Prims
Kruskal’s Algorithm
List edges in ascending weight order
Add next smallest edge that doesn’t create loop
Prim’s Algorithm
Start with one vertex
Connect to next nearest vertex without loop
Prim’s Algorithm in Tabular Form
Cross out row of starting node
Choose smallest in starting node column
Label next column and cross out line for node
Repeat
Dijkstra’s Algorithm Complexity
Quadratic
Kruskal’s Complexity
Quadratic complexity of number of arcs
Prim’s Complexity
Quadratic complexity of number of arcs