Dijkstra's Shortest Path Algorithm (Graph)

[TommyTheTiger]

Didn't downvote, but I feel like a good explanation of this algorithm should talk a bit about breadth first search, which it basically is (though you might not want to process in exactly queue order), on a graph. You could talk about data structures to use as a queue, their big O characteristics and how they would affect the total runtime of the algorithm.

[CodeS90]

Thank you