The flashcards below were created by user
algebrageek
on FreezingBlue Flashcards.
-
Kruskal's
- Minimal spanning tree
- Select shortest edge, then next shortest etc.
- Stop when all nodes connected
- Don't create cycles
-
Prim's
- Minimal spanning tree
- Chose starting node
- Pick shortest connected edge etc.
- Stop when all nodes connected
- Don't create any cycles
-
Dijkstra's
- Shortest path from node-node

|
|