Other slides in this set

Slide 2

Preview of page 2

Here's a taster:

Kruskal's Algorithm
SA
B 9 HH
14
8
8
A 3 16
15
C 14
15
18
12
6
W
R…read more

Slide 3

Preview of page 3

Here's a taster:

First you work out how many
edges there are...n vertices, n-1=edges
SA
B 9 HH
14
8
8
A 3 16
15
C 14
15
18
12
7 vertices-
7-1= 6 edges
6
W
R…read more

Slide 4

Preview of page 4

Here's a taster:

Then we work out the algorithm...
SA
B 9 HH
14
8
A
8 You look at
3 16
15 which root is
C
15
14 the shortest
18
12 and put them
in order...
6
W
R…read more

Slide 5

Preview of page 5

Here's a taster:

SA
B 9 HH
14
8
8
A 3 16
15
C 14
15
18
1. A-C 3
12
2. R-W 6
3. A-B 8
6
W 4. B-HH 9
R
5. A-R 12
There are two distances of 8, 6. HH-SA 14
we don't use both of them
as it would create a loop.…read more

Slide 6

Preview of page 6

Here's a taster:

Then you add up the lengths to work
out the shortest route...
1. A-C 3
2. R-W 6 Length of
3. A-B 8
4. B-HH 9
minimum
5. A-R 12 connecter is
6. HH-SA 14
52
= 52…read more

Slide 7

Preview of page 7
Preview of page 7

Slide 8

Preview of page 8
Preview of page 8

Slide 9

Preview of page 9
Preview of page 9

Slide 10

Preview of page 10
Preview of page 10

Comments

daviesg

A really good presentation of the Kruskal's and Prims solution to finding a minimum spanning tree, also demonstration of how to use a matrix with Prims.  Well reccommended.

Similar Mathematics resources:

See all Mathematics resources »See all resources »