> Finds the shortest path from a source node to a sink node by evaluating the minimum distance to each node.

> Each path is numbered in order of consideration, for example 1, 2, 3, 4 and so on 1 being the start point and the higher the number the further the node is from the start point.

> At each node the minimum distance from the start point must be shown.

> When the shortest route has been found it is neccesary to work back from the end point to the start point showing your working out.

e.g 36-17 = 19, 19 - 7 = 12, 12 - 8 = 4, 4 - 4 = 0

## Comments

No comments have yet been made