A full-stack web application that visualizes pathfinding algorithms (BFS, DFS, and Dijkstra's) on real-world map data. Built for exploring how different search strategies perform across different environments.
Problem: NPCs in open-world games often struggle with efficient pathfinding, leading to poor user experiences and performance issues.
Solution: We simulate real-world pathfinding by applying search algorithms to actual map data using OpenStreetMap, providing a clean UI for comparison and visualization.
- Map data sourced from OpenStreetMap
- Extracted using BBBike
- pip install -r requirements.txt
-
Open the project folder in VS Code.
-
Open a new terminal inside VS Code.
-
Download the required dependencies for the frontend by running this in cmd: npm install
-
Run the following command to start the local development server: npm run dev
-
Open another terminal (can be Command Prompt or PowerShell).
-
Navigate to the project directory (if you’re not already there).
-
Run the Python server using: python backend/server.py
-
Wait until it outputs: Debugger is active!
Ryan Nadanam — UI/UX Frontend Structure & Dijkstra’s Implementation (FluffyNumber1)
Kiran Nadanam — Map Interface, Data Extraction, Backend Integration (kirannadanam)
Matthew Edelman — BFS & DFS Implementation (mattedelman)