{"id":25458952,"url":"https://github.com/sahil352005/pathfinding-simulation","last_synced_at":"2025-08-21T01:13:28.713Z","repository":{"id":276483113,"uuid":"866076364","full_name":"sahil352005/Pathfinding-Simulation","owner":"sahil352005","description":"Simple Pathfinding Simulation Using Different Algorithms ","archived":false,"fork":false,"pushed_at":"2025-02-08T14:08:34.000Z","size":37,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-01T09:15:36.115Z","etag":null,"topics":["contributors"],"latest_commit_sha":null,"homepage":"https://pathfinding-simulation.vercel.app","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/sahil352005.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-10-01T15:55:27.000Z","updated_at":"2025-02-08T14:08:38.000Z","dependencies_parsed_at":null,"dependency_job_id":"ab7314f0-0ae7-4b2d-832f-203d3e6986ec","html_url":"https://github.com/sahil352005/Pathfinding-Simulation","commit_stats":null,"previous_names":["sahil352005/pathfinding-simulation"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/sahil352005/Pathfinding-Simulation","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sahil352005%2FPathfinding-Simulation","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sahil352005%2FPathfinding-Simulation/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sahil352005%2FPathfinding-Simulation/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sahil352005%2FPathfinding-Simulation/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sahil352005","download_url":"https://codeload.github.com/sahil352005/Pathfinding-Simulation/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sahil352005%2FPathfinding-Simulation/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":271411609,"owners_count":24754965,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-08-20T02:00:09.606Z","response_time":69,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["contributors"],"created_at":"2025-02-18T03:29:11.930Z","updated_at":"2025-08-21T01:13:28.690Z","avatar_url":"https://github.com/sahil352005.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"\n---\n\n# Pathfinding Algorithm Visualizer\n\nThis is a visualizer tool for various pathfinding algorithms, implemented using **Pygame**. It allows you to see how algorithms like A*, Dijkstra, Breadth-First Search (BFS), and Depth-First Search (DFS) explore the grid to find the shortest path between two points. The tool also includes interactive features to create barriers, reset the grid, and choose the algorithm.\n\n## Features\n\n- **Visualization of Algorithms**: Visualize A*, Dijkstra, BFS, and DFS in real-time.\n- **Interactive Grid**: Click to create barriers, set start/end points, and reset the grid.\n- **Algorithm Selection**: Choose the pathfinding algorithm from a dropdown menu.\n- **User Controls**:\n  - **Left Click**: Set the start, end, and barriers on the grid.\n  - **Right Click**: Remove barriers or reset points.\n  - **Run Button**: Start the selected algorithm.\n  - **Reset Button**: Reset the grid and start a new simulation.\n\n## Algorithms\n\n- **A***: A heuristic-based algorithm that combines the cost to reach a node and the estimated cost to reach the goal.\n- **Dijkstra**: A classic algorithm that guarantees the shortest path in a weighted grid (works the same as A* without a heuristic).\n- **Breadth-First Search (BFS)**: Explores all possible paths one step at a time, ensuring the shortest path in unweighted grids.\n- **Depth-First Search (DFS)**: Explores as far as possible along each branch before backtracking. Does not guarantee the shortest path.\n\n## Prerequisites\n\n- Python 3.x\n- Pygame\n\n## Installation\n\n1. Clone the repository:\n\n    ```bash\n    git clone https://github.com/sahil352005/Pathfinding-Simulation.git\n    ```\n\n2. Install Pygame:\n\n    ```bash\n    pip install pygame\n    ```\n    or\n\n   ```bash\n   python -m pip install pygame-ce\n   ```\n\n4. Run the script:\n\n    ```bash\n    python main.py\n    ```\n\n## Usage\n\n1. **Set start and end points**: Use the left mouse button to place the start (orange) and end (turquoise) points.\n2. **Create barriers**: Use the left mouse button to draw barriers (black) that the pathfinder cannot pass through.\n3. **Run the algorithm**: Select an algorithm from the dropdown menu, then click the \"Run\" button to see the visualization.\n4. **Reset the grid**: Click the \"Reset\" button to clear the grid and start a new simulation.\n\n### Controls\n\n- **Left Click**: Set the start, end, and barriers.\n- **Right Click**: Reset grid cells.\n- **'C' Key**: Clear the entire grid.\n- **Run Button**: Execute the chosen algorithm.\n- **Reset Button**: Reset the grid and simulation.\n\n## Screenshots\n\n![Screenshot 2024-10-02 075139](https://github.com/user-attachments/assets/7f0d834b-bf45-4412-9ffc-1b9e95c4a140)\n\n![Screenshot 2024-10-02 075342](https://github.com/user-attachments/assets/7c5066c2-eb4e-4cbf-b852-1a1556d389d7)\n\n![Screenshot 2024-10-02 075940](https://github.com/user-attachments/assets/017c4136-10c1-4f82-945f-1ca4792cfaf7)\n\n\n## Known Issues\n\n- The simulation may not reset entirely if run multiple times. This can be resolved by pressing the **Reset** button before starting a new algorithm run.\n\n## Future Enhancements\n\n- Add more pathfinding algorithms (e.g., Greedy Best-First Search).\n- Allow diagonal movement between grid cells.\n- Implement weighted grids with varying terrain costs.\n\n\n---\n## Contributors\n\n- https://github.com/sahil352005\n- https://github.com/Lonwwolf14\n- https://github.com/Vedashree14\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsahil352005%2Fpathfinding-simulation","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsahil352005%2Fpathfinding-simulation","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsahil352005%2Fpathfinding-simulation/lists"}