Pathfinding Visualizer

A Python project that implements and visualizes shortest-path search on weighted grids using Dijkstra and A* algorithms.
The project also includes a benchmarking mode to compare different implementation strategies.

Project Structure

pathfinding-visualizer/
├── benchmarks/
│   ├── astar_results.csv
│   └── pathfinding_benchmark.csv
├── src/
│   ├── main.py
│   └── pathviz/
│       ├── astar.py
│       ├── dijkstra.py
│       ├── grid.py
│       └── visualize.py
├── requirements.txt
└── README.md

Installation

pip install -r requirements.txt

Run Visualization

Run Dijkstra:

python -m src.main --algorithm dijkstra --mode baseline

Run A*:

python -m src.main --algorithm astar --mode baseline

Run without visualization:

python -m src.main --algorithm dijkstra --mode array --no-viz

Benchmark Example

python -m src.main --algorithm dijkstra --benchmark --rows 300 --cols 300 --trials 10 --no-viz --benchmark-modes baseline,array,vectorized

Results are written to:

benchmarks/pathfinding_benchmark.csv

Technologies

• Python
• NumPy
• Matplotlib

---