Dijkstra or Floyd-Warshall

I think you also should take a look at A*[^]

Fast A-Star (2D) Implementation for C#[^]

[Update]
It appears that someone was less than happy with my suggestion, perhaps a look at the following article would serve to clarify things a bit:
WPF: A* search[^]

Best regards
Espen Harlinn

Basically Dijkstra gives shortest path of a node in a directed graph

and Floyd Warshall gives all nodes shortest path know you can choose as

per your requirement.

Why not try coding it for yourself? This would be great fun, and a great learning exercise where you can form your own conclusions rather than accepting the findings of some third party. Along the way, you get to show your coding chops, and you have the satisfaction of knowing that the knowledge you have gained along the way is all your own work.

Good luck.

I found good answers here: http://stackoverflow.com/questions/4212431/dijkstra-vs-floyd-warshall-finding-optimal-route-on-all-node-pairs[^].

—SA