Hi Quy, There's not really a name for it, but in essence it's a path finding algorithm based on a heuristic that accounts for factors such as time travelled, distance travelled, number of turns, etc.
Chris -- http://twitter.com/broady On Sat, Sep 10, 2011 at 10:16 PM, Quy Le <ltba...@gmail.com> wrote: > There are many algorithms to find the shortest path as A *, > Dijkstra, ... > But I don't know what algorithm is used to find the shortest path > between two points in the service Direction? > > -- > You received this message because you are subscribed to the Google Groups > "Google Maps JavaScript API v3" group. > To post to this group, send email to > google-maps-js-api-v3@googlegroups.com. > To unsubscribe from this group, send email to > google-maps-js-api-v3+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/google-maps-js-api-v3?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Google Maps JavaScript API v3" group. To post to this group, send email to google-maps-js-api-v3@googlegroups.com. To unsubscribe from this group, send email to google-maps-js-api-v3+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/google-maps-js-api-v3?hl=en.
