An Introduction to Pathfinding in C#

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:

1. Breadth-First Search
2. Depth-First Search
3. Dijkstra's Algorithm (uniform-cost search)
4. Greedy best-first Search
5. A*

A min-heap priority queue is used for storing all weighted paths.

The following demo applications are provided

1. Stack vs Queue demonstration
2. Graph construction, unweighted pathfinding, and backtracking
3. Weighted Graph construction and finding the minimum path with Dijkstra's algorithm
4. Mazes and pathfinding - DFS vs. Dijkstra vs. A*
5. Implementation of the 8-puzzle and solving using A* or greedy best-first.