# USE OF MATHS decision notes

A word document on Prims, Kruskals and The Travelling Salesperson

- step by step method

- Created by: Holly
- Created on: 10-10-12 08:43

First 138 words of the document:

Prims Algorithm

Step 1

Choose a start vertex.

Step 2

Connect the start vertex to the nearest new vertex by adding the shortest

edge.

Step 3

From any vertex on the tree so far, add the shortest edge that connects a new

vertex.

Step 4

Repeat step 3 until all the vertices have been included.

Matrix

Step 1

Choose a start vertex. Highlight the column corresponding to that vertex and

delete the row.

Step 2

Look in all the columns that have been highlighted so far. Circle the smallest

undeleted entry and read off the vertex for the row.

Step 3

Highlight the column corresponding to this vertex then delete the row.

Step 4

Repeat steps 2 and 3 until all the rows have been deleted.

## Comments

No comments have yet been made