Implementing Dijkstra's Algorithm with a Priority Queue HD

Explanation of how Dijkstra's algorithm can be implemented using a priority queue for greater efficiency. This is also the same as uniform cost search.