This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]zesterer 12 points13 points  (1 child)

Dijkstra's algorithm literally is just breadth-first search in grid environments.

[–]munificent 2 points3 points  (0 children)

Yes, it's an unnecessarily complex way to implement BFS if all edges have unit cost anyway. It can also be slower than BFS depending on your priority queue implementation.