According to this page, Dijkstra's algorithm is just BFS with a priority queue. Is it really that simple? I think not.
migrated from cstheory.stackexchange.com Feb 24 '13 at 8:51
This question came from our site for theoretical computer scientists and researchers in related fields.
You can implement Dijkstra's algorithm as BFS with a priority queue (though it's not the only implementation).
Dijkstra's algorithm relies on the property that the shortest path from $s$ to $t$ is also the shortest path to any of the vertices along the path. This is exactly what BFS does.
Or in another perspective: how would Dijkstra's algorithm behave if all the weights were 1? Exactly like BFS.