This computer algorithm will find the shortest distance from start to finish on a map and does it right every time!This is how it works.

Every portion of roads that begins and ends in an intersection must begining and end with and 'End Point.' Not all end points necessarily will have intersections at as their end points their end point, but all intersections or the will have one (Preferably a dot t 'x' Or 'S' for 'Start and an 'F' for finish.) These paths which begin and end with a intersection, fork or whatever are considered 'Routes'. Routes are not necessarily a straight line but an curve, 'S'or 'v' shape or whatever is close enough to the shape of the actual road each of these lines marked as a curve or whatever are considered 'Sub Routes'. Whenever to end points of two or routes are close enough to one another the user must be prompter whether or not he or she wants them joined, or count the separate routes. As 'Start' from the point on the map marked 'Start' and first travel from all routes stemming from the end point or points marked as 'Start' at the same speed as if there where a bunch of cars having a race. Whenever one of these cars reaches an intersection, the give the total length from start and whenever the cars reach the next intersections the total distance of the groups of routes leading from start to the next group of intersection are given their total distances from start. So if two or more routes 'merge' or lead to the same intersection? Well the group of routes with the shortest total distance from start are the ones to go on, to the other untaken routes stemming from the route with the shortest End Point. This goes on until the end point or group of end points marked with 'Finish' are reached, Then the routes with the lowest total going back to star are picked one to the other back to 'Start' are all along the shortest path from start to finish. The distances can also be replaced with the time it took to reach them to find the most expedient path. If for whatever reason, a routes must be traveled on twice, then their the total distance of that route or routes are multiplied by to and traveled on once. For hills and valleys, they can also be considered be using the Pythagorean theorem for all of their sub routes twice, once for their distance from x to y then by using the hypotenuse as side a of the distance to the z axis. can also be done to one way streets can also be considered. And lastly if to or more reach the same end point at the exact same distances are considered a 'tie' in which the route with the uppermost end point is picked for consistency. In short this is a lot like having a group of cars at start each group splitting up at the intersections until one reaches the finish line and the one that reaches finish first gives all of the routes they took, back.

What do you think of this idea or comment?
(You can change your vote at any time)

I agree

No opinion

I disagree