Graph Shortest-Path

This webpage can tell you the closest path between any two points on this graph:

 a     g--i
 |     |  |
 b--e--h--j
 |        |
 c        k
 |        |
 d--f     l

Although similar to Dijkstra's algorithm, I think I may have made a few changes