Which shortest path algorithm works better for Indian roads to find logical driving distance between two locations?
1) Dijkstra's algorithm
2) Floyd-Warshall algorithm
3) Bellman-Ford algorithm
4) A algorithm