Spaces:
Sleeping
Sleeping
| title: Path Finding Algorithms | |
| emoji: 🗺️ | |
| colorFrom: blue | |
| colorTo: green | |
| sdk: docker | |
| app_port: 7860 | |
| pinned: false | |
| license: mit | |
| # 🗺️ Path Finding Algorithms Visualizer | |
| Interactive pathfinding visualization with **A\***, **Dijkstra**, and **Bellman-Ford** algorithms on a custom map. | |
| ## 🚀 How to Use | |
| 1. **Select Algorithm**: A*, Dijkstra, or Bellman-Ford | |
| 2. **Set Start Position**: X and Y sliders | |
| 3. **Set Goal Position**: X and Y sliders | |
| 4. **Find Path**: Click button to visualize | |
| ## 📊 Algorithms | |
| - **A\***: Fastest with heuristic | |
| - **Dijkstra**: Classic shortest path | |
| - **Bellman-Ford**: Handles negative weights | |
| Built with Python, Flask, and Matplotlib | |