Dijkstra's Shortest Path algorithm

[CaitlinC]

Hi all,

I'm littlbe bit stuck on the Dijkstra's Shortest Path algorithm, would somebody help me out with its implementation?

For you who don't know, basically in overview:

You have
1 2 1
2 4 1
4 3 1
1 3 5
This states that there are four routers, the distance between router 1 and 2 is 1, between 2 and 4 is 1, etc...

The shortest distance from router 1 to router 2 is 1, the shortest distance from router 1 to router 3 is 3 and so on...

Any help would be greatly appreciated.

Thanks.
Caitlin.

 

[dbrom]

CaitlinC,

I have just written a program using the Dijkstra's Shortest Path algorithm, and unless someone answers your question before I get home today (In 6 hours or so) I will be glad to provide some code for ya!

Dmitriy. <Dmitriy>
dbrom@crosswinds.net

 

[CaitlinC]

Dmitriy,

Thanks very much. Would you please?

I'm glad someone out there like you are writing something similar as I'm too. I'm not a Java savvy, your help would be greatly appreciated.

Thanks alot.
-Caitlin

 

[dbrom]

Sorry, I got back home very late yesterday...

I will post some stuff this evening.

Again, sorry <Dmitriy>
dbrom@crosswinds.net

 

[CaitlinC]

No problem!

Thanks again in advance.

-Caitlin