Dijkstra's shortest path algorithm is used to find the minimum distance between nodes in a graph.
Notably, Dijkstra's algorithm does not work with negative edge weights. In the case of negative edges, you have to use a different algorithm, such as Bellman-Ford.
- Create a visited array that has all nodes as unvisited
- Set the minimum distances to every node to infinity
- Create a priority queue of pair<distance, node> that sorts by smallest distance
- Set the minimum distance to the start node to zero and push it into the priority queue
- If the priority queue is empty, all nodes in the current connected component have been reached. Exit.
- Pop a pair off the front of the priority queue. Optionally, return early if there is a specified end node and this is it.
- If the node has already been visited, discard it and go back to step 5.
- Set the minimum distance to that node equal to the current distance encoded in the pair object.
- For every node that can be reached starting from the current node, push it into the queue (if it is not yet visited) with distance current plus the weight of the edge needed
- Go to step 5
See the following site for more information: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm