How Does Google maps gives you the shortest Path to your destination | Dijkstra Algorithm demystify

In this video, Dijkstra Algorithm is demonstrated using multiple destination nodes with single source. Multiple variation of the algorithm is available.
[1] Dijkstra, Edsger; Thomas J. Misa, Editor (2010-08). "An Interview with Edsger W. Dijkstra". Communications of the ACM 53 (8): 41-47.
doi:10.1145/1787234.1787249. "What is the shortest way to travel from Rotterdam to Groningen? It is the algorithm for the shortest path
which I designed in about 20 minutes. One morning I was shopping with my young fianceé, and tired, we sat down on the café terrace to drink
a cup of coffee and I was just thinking about whether I could do this, and I then designed the algorithm for the shortest path.
DON’T FORGET TO LIKE & SUBSCRIBE TO THE CHANNEL & CLICK THE BELL ICON FOR LATEST UPDATES.
UA-cam CHANNEL LINK :
/ @muhammed_mustaqim

[@muhammadwaqar3406]

Great explanation. Its applications in graph theory are huge.

[@Muhammed_Mustaqim]

Glad you think so!

[@ZeeshanAhmad-sk7fy]

Great Explanation

[@mnmmnm6718]

For real zershan