Algorithm used for: Finding the shortest path between two vertices

Method: From the starting vertex labelled 1, choose the edge wth least weight connected to it.

Label it 2, continue this process including edges connected to all the vertices labelled, until you

reach the finishing vertex.

Shortest path: Start from the finishing vertex, find the path by checking each vertex. Minus the

edge weight from the finished weight to equal the starting weight.

Weight of the path: This will be the total distance at the finishing vertex.

Path between two other vertices: Use the shortest path and divert to the other vertex.

## Comments

No comments have yet been made