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
As has already been pointed out, it is not clear what the cost is of going from one point to another point. Is it just the distance between those points? Anyway, regardless, such a problem can be solved using conventional Linear Programming. I've just finished making a C# library to simplify shortest path problems. Downloadable here.
There is still more work to do on this library, but it should give you what you want in a very simple manner.
Regards,
Bruce.