Question

Algorithm to find the shortest route between two places

Answer 1

Answer:

Dijkstra's algorithm (or Dijkstra's Shortest Path First algorithm, SPF algorithm) is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later..

#⃣❤✌#⃣❤✌#⃣❤#⃣

Answer 2

Answer:

Dijkstra's algorithm can be used to find the shortest path. This algorithm will continue to run until all of the reachable vertices in a graph have been visited, which means that we could run Dijkstra's algorithm, find the shortest path between any two reachable nodes, and then save the results somewhere