D1 Definitions - Algorithms on Networks

HideShow resource information
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

Other cards in this set

Card 2

Front

Kruskal's algorithm always starts with the arc of lowest weight, where Prim's can start at any node.

Back

Kruskal's vs Prim's i

Card 3

Front

Kruskal's algorithm produces a Minimum Spanning Tree in a 'chaotic' manner, while Prim's grows with linked arcs.

Back

Preview of the back of card 3

Card 4

Front

You do not have to check for cycles with Prim's algorithm - you do with Kruskal's.

Back

Preview of the back of card 4

Card 5

Front

Prim's algorithm can be applied to a distance matrix while Kruskal's cannot.

Back

Preview of the back of card 5

Comments

No comments have yet been made

Similar Mathematics resources:

See all Mathematics resources »See all Networks, algorithms and problem solving resources »