Path-finding Visualization Comparison; A*, Dijkstra, BFS and DFS

[@JamesRobinson-pl1xx]

To make these visualizations I used one of my own python pygame programs. To view or download the code used to make this video check out my Github: github.com/James-Charles-Robinson Any problems, please make an issue on my page.

[@infamoustony]

BFS is literally Dijkstra in this case

[@newgame3246]

1:07 honorable mention

[@YouthWaster]

That was very satisfying to watch. Thank you man ❤ The ending was good

[@paulblart7378]

1:07 who would think DFS is the best algorithm, it's the only one that doesn't give the shortest path

[@thereddestsuninthesky]

nah, they're saying that DFS is the worst. it says "in case you think DFS is the BEST". they want you to NOT think that its the best.

[@paulblart7378]

​@@thereddestsuninthesky I got that, what I'm saying is "how could there even be someone who thinks DFS is best in the first place". I didn't mean "why does he think DFS is best"

[@thereddestsuninthesky]

@@paulblart7378 ah, ok

[@matiasneville]

​@@paulblart7378 i think that's because in many maze problems shown in the video, the DFS looked as the best among the 4 algorithms (dunno why but in the shown mazes the dfs would always pick the best path and not those which led nowhere, strange..)

[@paulblart7378]

@@matiasneville All the other algorithms tend to search evenly as to not miss a short path, but DFS (DEPTH-first search) basically tries the first path it generates, and if it doesn't work, it tries the next, and so on. It doesn't care about minimizing the path length, just finding ANY path that works. That's why it's quite optimal in mazes, because the first path available is often the right one. It fails easily on open maps.

[@anshchaudhary9193]

The thing about dijkstra is that with equal edge weights it is simply bfs.. moreover, we are possibly worse off by maintaining a priority queue

[@bsal5347]

Impressive work you got there !!! Which algorithm did you use to generate a maze ?

[@chri-k]

What's the point of even including Dijkstra's algorithm here?

[@JamesRobinson-pl1xx]

because why not

[@דניאלאביב-ו6ת]

A* looks like magic compared to others.

[@ahmedifhaam7266]

Great work, thank you

[@dyyno5578]

is there a good pygame tuto on these algorithms ?

[@xy4611]

worst is deep first cuz cannot find best way