Other slides in this set

Slide 2

Preview of page 2

Here's a taster:

This network may be described using a Distance Matrix…read more

Slide 3

Preview of page 3

Here's a taster:

Step 1: Choose a starting vertex and delete all
elements in that vertex's row and arrow its
column
Step 2: Neglecting all deleted terms, scan all
arrowed columns for the lowest available
element and circle that element
Step 3: Delete the circled element's row and arrow its
column
Step 4: Repeat steps 2 and 3 until all rows deleted
Step 5: The spanning tree is formed by the circled arcs…read more

Slide 4

Preview of page 4

Here's a taster:

Now
Start
we with
haveAvertex C
B
D
F
E
1 2 6 3 5 4 Scan all
Delete arrowed
These
its row arcs, in this order, will provide a minimum spanning tree
columns
& arrow and find
its lowest
column element
Write down
the arcs in
AB BD DF FE BC the order you
select them…read more

Comments

No comments have yet been made

Similar Mathematics resources:

See all Mathematics resources »See all resources »