Shortest route between multiple points

Question

I need to find the shortest route between multipe points. Let\'s say that I have these four points:

var startPoint = new Point(1, 1);
var pointsToGoPast = new Li         


        

Answer 1

You can do this by Dijkstra's Algorithm.

Sample project with code here

The only thing that needs to change is the weights in the project, since the weight is based off of distance between the two points. (So you need to modify the Location to store a Point and the Connection to calculate the weight (distance) in the constructor.

Wikipedia has a very nice article on the algorithm