![](https://www.101computing.net/wp/wp-content/uploads/Dijkstra-Algorithm-150x150.png)
Dijkstra’s Shortest Path Algorithm is an algorithm used to find the shortest path between two nodes of a weighted graph. Before investigating this algorithm make sure you are familiar with the terminology used when describing Graphs in Computer Science. Let’s…