Major addition:
- the Bellman-Ford algorithm for shortest path (with early termination)
Minor corrections:
- as a result of testing of the above, made further corrections to the underlying adjacency matrix with regards
- the AmendEdge dialog now accepts negative values
- the A* heuristic is now based on the distance between the centres of each node