Dijkstra’s algorithm in C#

I had the pleasure of working with this algorithm one year ago during a project on route planning. Recently I encountered this algorithm again during a course, and decided to do a small implementation of this algorithm along with a graphical interface to use it. Use it for anything you want.

It finds the shortest path from a starting point to all nodes in a graph, but keeps track of how to get there, so if you want to use it for the shortest path between 2 points, simply follow the previous node located in path from the destination point.

http://www.nocture.dk/data/Dijkstra.zip

Tags: , ,

This entry was posted on Sunday, October 25th, 2009 at 9:11 PM and is filed under Code. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.

  1. shideh says:
    January 5, 2010 at 8:54 AM

    thank you,thank you
    i am working on my thesis for transportation engineering MS degree.
    I am not very good at programming and finding even a small part of my long and troublesome code makes me very happy!
    i require to find shortest path approximately 2000 times in a part of my program to solve my whole network.
    it is ready here!
    thank you…….
    I Love Denmark:)

  2. Jeppe Andersen says:
    January 5, 2010 at 12:44 PM

    Im glad you found it useful! :-)

    - Jeppe

  3. Mehri says:
    May 10, 2010 at 6:22 PM

    Thanks, It was useful;)

  1. There are no trackbacks for this post yet.

Leave a Reply