D1 Definitions - Algorithms on Networks 0.0 / 5 ? MathematicsNetworks, algorithms and problem solvingA2/A-levelEdexcel Created by: CamCreated on: 19-05-15 19:44 Minimum Spanning Tree A spanning tree such that the total length of its arcs is as small as possible. 1 of 5 Kruskal's vs Prim's i Kruskal's algorithm always starts with the arc of lowest weight, where Prim's can start at any node. 2 of 5 Kruskal's vs Prim's ii Kruskal's algorithm produces a Minimum Spanning Tree in a 'chaotic' manner, while Prim's grows with linked arcs. 3 of 5 Kruskal's vs Prim's iii You do not have to check for cycles with Prim's algorithm - you do with Kruskal's. 4 of 5 Kruskal's vs Prim's iv Prim's algorithm can be applied to a distance matrix while Kruskal's cannot. 5 of 5
Comments
No comments have yet been made