Kruskal's algorithm
- Created by: Anita
- Created on: 28-12-12 15:39
View mindmap
- Kruskal's algorithm
- 3. Keep choosing the arc with the least weight unless it forms a cycle with the edges already chosen
- 2. Choose the arc with the least weight to start the tree
- 4. Repeat step 3 until all vertices have been included
- 1. Sort all the arcs out into ascending order of weight
Comments
No comments have yet been made