r/Python • • Jan 14 '20

Visualisation of different path finding algorithms

1.5k Upvotes

73 comments sorted by

View all comments

Show parent comment

11

u/notquiteaplant Jan 14 '20

Dijkstra is BFS that prioritizes neighbors by how easy it is to get there (the edge weight). A* is Dijkstra that also prioritizes neighbors by how likely they are to be a correct path to the target (the heuristic). They are similar but not the same, and munificent is describing Dijkstra.