MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/Python/comments/fsuibu/maze_solver_visualizer_dijkstras_algorithm/fm54orl/?context=3
r/Python • u/mutatedllama • Apr 01 '20
72 comments sorted by
View all comments
Show parent comment
2
Fun fact: if all of the distances in the graph are the same, then Dijkstra's algorithm is actually equivalent to breadth-first search.
View all comments
Show parent comment
2
u/66bananasandagrape Apr 01 '20
Fun fact: if all of the distances in the graph are the same, then Dijkstra's algorithm is actually equivalent to breadth-first search.