Dijkstra's algorithm Urgent help plz

Hey, I am developing an app based on VB to simulate routing algorithm by using Dijkstra's algorithm. By far, I have designed the graphical part. Basically, the user can drag and drop routers "PictureBox" into an area and then connect them to each other and assign each connection a cost. so far so good.
The problem is the actual algorithm calculation. As you know, almost all of the sample codes in the internet are designed for text based or graph based configuration.

FYI:
I can store all the information needed for the algorithm calculation as follow:

total number of nodes in the area: "Count" ===> Integer
list of all nodes in the area: Nodes() ===> Array String
list of all connections in the area: connections() ===> Array String
list of all costs for each connection: "Costs" ===> Integer
the start point is always "Router01" which is Nodes(1)
The destination point is the last node added by user ===> Nodes(LastItem)
a Richbox is designed to show the results.

Could you please give me the actual algorithm based on my variables?
As I am new and my knowledge is limited please use my variable names in the given code if it is possible.
I have asked this question in less details before but all the people referred me to web links.
http://i41.tinypic.com/24euoma.jpg
Thanks in advance.