Пікірлер
@YouthWaster
@YouthWaster 29 күн бұрын
That was very satisfying to watch. Thank you man ❤ The ending was good
@anshchaudhary9193
@anshchaudhary9193 5 ай бұрын
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
@דניאלאביב-ו6ת
@דניאלאביב-ו6ת 6 ай бұрын
A* looks like magic compared to others.
@newgame3246
@newgame3246 8 ай бұрын
1:07 honorable mention
@chri-k
@chri-k 8 ай бұрын
What's the point of even including Dijkstra's algorithm here?
@JamesRobinson-pl1xx
@JamesRobinson-pl1xx 8 ай бұрын
because why not
@infamoustony
@infamoustony 9 ай бұрын
BFS is literally Dijkstra in this case
@bsal5347
@bsal5347 Жыл бұрын
Impressive work you got there !!! Which algorithm did you use to generate a maze ?
@xy4611
@xy4611 Жыл бұрын
worst is deep first cuz cannot find best way
@paulblart7378
@paulblart7378 Жыл бұрын
1:07 who would think DFS is the best algorithm, it's the only one that doesn't give the shortest path
@thereddestsuninthesky
@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
@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
@thereddestsuninthesky Жыл бұрын
@@paulblart7378 ah, ok
@matiasneville
@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
@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.
@ahmedifhaam7266
@ahmedifhaam7266 2 жыл бұрын
Great work, thank you
@MinecraftCurios
@MinecraftCurios 2 жыл бұрын
So much epic right here
@dyyno5578
@dyyno5578 3 жыл бұрын
is there a good pygame tuto on these algorithms ?
@JamesRobinson-pl1xx
@JamesRobinson-pl1xx 4 жыл бұрын
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.