I will like to know if anyone has an idea on the concept behind point to point route generation on google maps and nokia maps. What logic was used to determine the route and generate directions from any point on the map to another? I wouldn't mind guesses or something of that sort. I just want to understand, how it works.
-
Check this stackoverflow.com/questions/430142/…– thebenmanCommented Jul 27, 2016 at 13:44
Add a comment
|
2 Answers
This is just a guess, but probably something like Dijkstra's algorithm. It most likely is some kind of graph-search algorithm, with each node representing an intersection and each edge representing a section of street.
-
I second this and with prim algorithm you find the shortest water grid or telecommunication grid. Commented Nov 4, 2011 at 17:50
-
What language do you think Google and Nokia use to implement this?– dubyzuCommented Nov 26, 2011 at 0:12
-
@user1030144 Recently Project open source routing machine came to life providing routing capabilities to open street map, and it's based in C++. Commented Oct 28, 2015 at 9:23
-
good answer you can choose dijkstra algorithm. good answer here stackoverflow.com/questions/39256309/… Commented Aug 31, 2016 at 21:39
I will also add that the graph here is likely also weighted, with each weight corresponding to how important the road is. For example, Interstate highways may have a greater weight than state highways, which have a greater weight than local roads, which have a greater weight than simple streets. Optionally, toll roads may have a lower weight than non-toll roads.
-
What language do you think Google and Nokia use to implement this?– dubyzuCommented Nov 26, 2011 at 0:12