ejaz_pk wrote:
Can you please give me any sample code to get any idea to get the distance and fastest route?
I'm sorry, but the code is copyrighted and not mine to give. I'd have turned it into an article if it wasn't :) Would also have been too much to post as a copy&paste sample. Simplest solution is to measure all possible distances. That requires you to build a tree with all possible routes. The root would be your startingpoint, and if you can move to two new points from there, you'd add those as children - recursively. Once you have all possible routes, you'd have to measure how long it is, or request it's length over some third-party. If need be free, you can use the database from Geonames.org, and calculate the length of a straight line connecting each point. You'd have to account for the earth being a big round ball, but there are formulas[^] out there that return you a length of a line on a ball. Once you have written all lengths into the tree, you find the one that gives the shortest value. That's a simplistic algorithm that'll generate relatively satisfying results. A more complicated algorithm like Dijkstra's would be an improvement. You can also improve on this by getting "real" distances from Google for the distance between two points - but that's going to cost money if you're going to do it in bulk. Good luck :)
I are Troll :suss: