Can anyone help with an algorithm to find the shortest route between two points. I want to perform a function similar to that in AutoRoute, but on a much simpler scale.
For example:
Given a 4 by 4 grid of points, labelled a to p, left to right, top to bottom. Some points are joined together, some are not - but any one point is accessible from any other point. The relative position of each point is known.
I want to be able to find the shortest route from point c to point i, or point h to point a (basically any two given points).
Start Free Trial