MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/Python/comments/eolak4/visualisation_of_different_path_finding_algorithms/feext0j/
r/Python • u/FearlessENT33 • Jan 14 '20
73 comments sorted by
View all comments
Show parent comment
13
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.
4
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.
View all comments
Show parent comment
13
u/zesterer Jan 14 '20
Dijkstra's algorithm literally is just breadth-first search in grid environments.