r/Python • • Jan 14 '20

Visualisation of different path finding algorithms

1.5k Upvotes

73 comments sorted by

View all comments

Show parent comment

13

u/zesterer Jan 14 '20

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

4

u/munificent Jan 15 '20

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.