Yes, this algorithm is often used in routing. 6 or 7 years ago I had to implement it in Java for a networking course.... been a while though
For a given node in a graph the algorithm will find the shorted path between that one and every other node. I had a quick google search you and found this link which will probably help
http://www.codeproject.com/KB/recipes/GcDijkstra.aspx - it is an example already coded in VB, which you can look at and figure out.
Also the pseudo code below described the algorithm quite well
1 function Dijkstra(Graph, source):
2 for each vertex v in Graph: // Initializations
3 dist[v] := infinity // Unknown distance function from source to v
4 previous[v] := undefined // Previous node in optimal path from source
5 dist[source] := 0 // Distance from source to source
6 Q := the set of all nodes in Graph // All nodes in the graph are unoptimized - thus are in Q
7 while Q is not empty: // The main loop
8 u := vertex in Q with smallest dist[]
9 remove u from Q
10 for each neighbor v of u: // where v has not yet been removed from Q.
11 alt := dist[u] + dist_between(u, v) // be careful in 1st step - dist[u] is infinity yet
12 if alt < dist[v] // Relax (u,v,a)
13 dist[v] := alt
14 previous[v] := u
15 return previous[]
Give us a shout if you have any questions
