Finding the shortest paths among districts in Tamilnadu using Djkstra's algorithm
K. Sharmilaa, B. Poorani · Advances in Applied Research · 2021
Single Source Shortest Path Problem based on Dijkstra's algorithm was used in the present study to find the shortest paths among districts in Tamilnadu. Dijkstra's algorithm finds the shortest path from source node (start node) to all other nodes in the graph. The efficacy of the algorithm was illustrated on comparison of the results obtained by the proposed method (Dijkstra's algorithm) with Google map. The results revealed that the accuracy of Dijkstra's algorithm was 99.22% with that of the Google maps