A Star VS Dijkstra's Path-finding - Comparing A Star and Dijkstra using Python for Visualization

preview_player
Показать описание
Pathfinding Visualization. Comparing two pathfinding algorithms, Astar and Dijkstra's.
A* vs Dijkstra's Path Finding. Both pathfinding algorithms are visualized side by side in two different scenarios, where each algorithm shines at.

Please leave a LIKE and SUBSCRIBE for more content!

GitHub Link:

Tags:
- Path-finding Visualization
- A* vs Dijkstra's
- Python Path-finding
- Pygame path-finding visualization
- A* Path-finding visualization
- Dijkstra's Path-finding visualization
- Python Pygame

TIMESTAMPS:
0:00 - Prologue
0:28 - Visualization
0:52 - Constrains for second visualization
1:12 - 2nd Visualization
0:35 - Updating functions
4:00 - Finished

Hashtags:
#pathfinding #pygame #visualization

Music:
From Creative Commons
Рекомендации по теме
Комментарии
Автор

Also great video it really put me into perspective.

Raycast
Автор

Do you think that A* could be improved in the second test by using a process to reflect from walls (or bounce rather) but still be pulled towards the end point? In my minds eye there are a lot of ways to improve A* and make it more versatile. Because as you have shown here, A* currently has its draw backs.

Raycast
Автор

Just landed on this video. Is there any way to know what are the principles that apply here, and why is this interesting in the end? Super curious on the struggles of these different digital mentalities. Keep going, looks good!

petecarvalho
Автор

Can you apply Ant Colony in this problem?

k.mapo
visit shbcf.ru