Path Finding Algorithms

June 23, 2019 ยท View on GitHub

BFS, Greedy Best-First Search, Dijkstra and A* path finding algorithms visualized in Unity

BFS (Breadth-First Search)

bfs

Greedy BFS (Greedy Best-First Search)

greedy_bfs

Dijkstra

dijkstra

A* (Euclidean Distance Heuristic)

astar

A* (With Aggressive Heuristic)

astar_aggressive

Contents

  1. 0.1BFS (Breadth-First Search)
  2. 0.2Greedy BFS (Greedy Best-First Search)
  3. 0.3Dijkstra
  4. 0.4A* (Euclidean Distance Heuristic)
  5. 0.5A* (With Aggressive Heuristic)