How to use Dijkstra's Algorithm with Code

This is a tutorial on the Dijkstra's algorithm, also known as the single source shortest path algorithm. It is extensively used to solve graph problems. We use an example to understand the algorithm and then walk through the the code.

Dijkstra's uses both concepts of Greedy(Finding the next city to pick), and DP(using previously calculated distances).

Code:
https://algs4.cs.princeton.edu/44sp/DijkstraSP.java.html

References:
http://www.geeksforgeeks.org/greedy-algorithms-set-6-dijkstras-shortest-path-algorithm/
https://web.engr.oregonstate.edu/~glencora/wiki/uploads/dijkstra-proof.pdf
http://math.mit.edu/~rothvoss/18.304.3PM/Presentations/1-Melissa.pdf

Видео How to use Dijkstra's Algorithm with Code канала Gaurav Sen