Dijkstra program that get shortest path between two nodes in network

Hi, i need it.. how can I get it?

Dijkstra's algorithm solves the single-source shortest-path problem when all edges have non-negative weights. It is a greedy algorithm and similar to Prim's algorithm. Algorithm starts at the source vertex, s, it grows a tree, T, that ultimately spans all vertices reachable from S. Vertices are added to T in order of distance i.e., first S, then the vertex closest to S, then the next closest, and so on. Following implementation assumes that graph G is represented by adjacency lists.

For more details visit the link below:

http://www.personal.kent.edu/~rmuhamma/ ... aAlgor.htm

Well.. I know what dijkstra's algorithm is.. but I need some c# code for the shortest path between routers in a LAN.. or something like that.. a program that sends packets to the net and can recognise the distance between two points, and sharing the data can get to the "x" router with the shortest path..
Could someone hep me?
(sorry my very bad english I'm italian)