Skip to content

Latest commit

 

History

History
7 lines (4 loc) · 341 Bytes

README.md

File metadata and controls

7 lines (4 loc) · 341 Bytes

PathfindingBasics

This is a Unity project used in my series on pathfinding at youtube.com/user/TheHappieCat!

This includes implementations of BFS, DFS, Dijkstra's, A* (Manhattan and Euclidean) where a cube navigates a maze of barriers and obstacles that slow it.

If you want the fill in the blanks BFS/DFS code, clone the first commit.