Add resources for A* algorithm explanation (#9432)
This commit is contained in:
1 parent
4775858ed5
commit
4b5dd0b7f9
1 file changed
+2
-1
@@ -4,6 +4,7 @@ A\* is a graph traversal algorithm that is used to find the shortest path betwee
|
||||
|
||||
Visit the following resources to learn more:
|
||||
|
||||
- [@article@Introduction to the A* Algorithm - Red Blob Games](https://www.redblobgames.com/pathfinding/a-star/introduction.html)
|
||||
- [@article@A* Search Algorithm - Wikipedia](https://en.wikipedia.org/wiki/A*_search_algorithm)
|
||||
- [@video@A* Pathfinding (E01: algorithm explanation)](https://www.youtube.com/watch?v=-L-WgKMFuhE)
|
||||
- [@feed@Explore top posts about Data Science](https://app.daily.dev/tags/data-science?ref=roadmapsh)
|
||||
- [@feed@Explore top posts about Data Science](https://app.daily.dev/tags/data-science?ref=roadmapsh)
|
||||
Reference in new issue
Block a user