Finding Shortest Route Between 3 or more places (Google Map Route)

Question

i'm making app about trip planner where user favorite a few place in a city and i'm suppose to route that place for user. i need to route each so i can calculate the shortest traveling time possible.

can anyone suggest me how to solve this ?

i know google API have a routing algorithm but that just take place 1 to place 2. currently i'm thinking about implementing Dijkstra's algorithm to this routing problem. any suggestion ? thanks

score 0 · Answer 1 · answered Aug 10 '19 at 07:53

0

First you need latitude and longitude your places. If you don't have a latitude longitude your places then use Geocoder. Geocoder return latlng from city names. Add this latlng to list.
Use distance matrix API for find distance/durations between your places. Send latlng list to distance matrix api. You will get the url for connect to API.
Parse JSON objects and get durations/distances. Create matrix with durations/distances.
Send your matrix to your algorithm(Dijikstra or prim)

answered Aug 10 '19 at 07:53

kiliccambaz

59
6

which better djisktra or prim ? , whats is prim anyway ? – William Ai Aug 10 '19 at 09:16
more information about dijkstra and prim https://stackoverflow.com/questions/13794948/what-is-the-difference-between-dijkstra-and-prims-algorithm – kiliccambaz Aug 10 '19 at 09:23

Finding Shortest Route Between 3 or more places (Google Map Route)

1 Answers1