This Django application provides a real-time visualization of pathfinding algorithms using a grid. It incorporates Dijkstra and A* algorithms to find the shortest path between a start and an end point. The visualization is done in real-time on a web canvas, allowing users to interactively see the algorithm in action.
- Dynamic Visualization: Watch the pathfinding algorithm in action on a grid.
- Multiple Algorithms: Choose between Dijkstra and A* algorithms for pathfinding.
- User Interaction: Select start and end points, erase walls, and generate random grids.
-
Clone the repository:
git clone https://github.com/Shreypatel65/PathVisualization cd PathVisualization
-
Install dependencies:
pip install -r requirements.txt
-
Run the Django development server:
python manage.py runserver
-
Open your browser and go to http://localhost:8000 to see the real-time pathfinding visualization.
- Click "Select Start Point" or "Select End Point" to choose the start and end points on the grid.
- Use "Erase" to remove walls or paths.
- Click "Generate Random Grid" to create a new random grid.
- Choose the algorithm with "Select Algorithm (Dijkstra/A*)".
- Click "Submit" to start the selected algorithm and visualize the pathfinding process.
Contributions are welcome! Fork the repository and create a pull request with your enhancements.