Breadth-first search, Dijkstra, Greedy best-first search, A-Star
- Creating Node Dynamicaly
- Reading text file information.
- Reading image texture information.
- Calculating Weight of the path (normal, slow, slower, slowest).
- Custom Priority Queue with binary heap algorithm.
- Implementaing Pathfinding(Breadth-first search, Dijkstra, Greedy best-first search, A-Star).
This is originally from Udemy Pathfinding in Unity Course.