Dijkstra's algorithm in C#
Oct 25, 2009
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.
Oct 14, 2009
Hello there, and welcome to my new blog! My name is Jeppe Andersen and I am currently studying Software Engineering at the computer science department of Aalborg University.
The main content of this blog will also be related to this, which means I am not going to post my everyday happenings, instead this place will be used as a data dump for various things I find interesting. This can be anything from some tech-news to a small implementation of an algorithm I decided to do after a course at the university.