This repository features useful applications of pathfinding algorithms and serves as introduction to pathfinding and graph theory in general.
The following algorithms have been implemented in this tutorial:
- Breadth-First Search
- Depth-First Search
- Dijkstra's Algorithm (uniform-cost search)
- Greedy best-first Search
- A*
A min-heap priority queue is used for storing all weighted paths.
The following demo applications are provided
- Stack vs Queue demonstration
- Graph construction, unweighted pathfinding, and backtracking
- Weighted Graph construction and finding the minimum path with Dijkstra's algorithm
- Mazes and pathfinding - DFS vs. Dijkstra vs. A*
- Implementation of the 8-puzzle and solving using A* or greedy best-first.