*What if you were shown a graph of nodes in which each node is connected to a number of other nodes at different distances? What is the shortest path to every other node in the graph if you start from one of the nodes in the graph?*

*Well, Dijkstra’s Algorithm is a simple algorithm that is used to find the shortest distance, or path, from a starting node to a target node in a weighted graph.*

The shortest path from the starting node, the source, to all other nodes (points) in the graph is created by this algorithm.

Dijkstra’s algorithm…