main
members
work
about me
avatar
Paul(admin)

Dijkstra's Algorithm

Post replyCan't edit post
Watch topicCan't delete post
Thursday, January 26 2006
Calculating the Shortest Path
Download the document below.
The Java application is an implementation of Dijkstra's Algorithm to determine shortest paths from nodes to nodes in a graph.
For clarification, I included a PDF document where the graphs are drawn out together with the shortest distance from the source node to any other node for several test cases.
These test cases can be loaded into the application and will give the same results.
Download
dijkstra.zip (12.21 KB)
dijkstra.pdf (306.01 KB)
Graphs drawn in Visio, converted with Adobe Acrobat 7.0
Java source code for 1.4.2 and up
Rating:
Actions:Post replyWatch topic
No comments.Post reply
Please contact me prior to distributing any files.
Members have extra privileges. You can login or register.
© 2005–2017 P. F. Lammertsma
No members currently online; 760 hits today by 248 unique users