{"id":22726201,"url":"https://github.com/maskedsyntax/intellipath","last_synced_at":"2026-01-30T06:06:12.660Z","repository":{"id":193907151,"uuid":"351088807","full_name":"MaskedSyntax/intellipath","owner":"MaskedSyntax","description":"A python based visualizer for A* pathfinding algorithm.","archived":false,"fork":false,"pushed_at":"2024-11-29T07:02:20.000Z","size":20,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-13T20:46:36.528Z","etag":null,"topics":["algorithms","animation","astar-algorithm","data-structures","priority-queue","pygame","python3","queue"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/MaskedSyntax.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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":"2021-03-24T13:25:03.000Z","updated_at":"2025-02-05T08:28:02.000Z","dependencies_parsed_at":null,"dependency_job_id":"84671d05-ccbc-4ef1-90ba-052a9ef1ad94","html_url":"https://github.com/MaskedSyntax/intellipath","commit_stats":null,"previous_names":["aftaab25/astarpathfinder","maskedsyntax/astarpathfinder","maskedsyntax/intellipath"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MaskedSyntax%2Fintellipath","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MaskedSyntax%2Fintellipath/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MaskedSyntax%2Fintellipath/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MaskedSyntax%2Fintellipath/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/MaskedSyntax","download_url":"https://codeload.github.com/MaskedSyntax/intellipath/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248782275,"owners_count":21160716,"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","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":["algorithms","animation","astar-algorithm","data-structures","priority-queue","pygame","python3","queue"],"created_at":"2024-12-10T16:16:06.873Z","updated_at":"2026-01-30T06:06:12.656Z","avatar_url":"https://github.com/MaskedSyntax.png","language":"Python","readme":"# IntelliPath: A* Pathfinder\n\nThis repository contains an implementation of the A* (A-Star) pathfinding algorithm in Python. The A* algorithm is a popular search algorithm used in various applications such as AI, robotics, and game development to find the shortest path between two points.\n\n## Features\n\n- **A\\* Algorithm**: Efficiently finds the shortest path between the start and goal nodes.\n- **Visualization**: Provides a visual representation of the grid, obstacles, start, and goal nodes, and the path found by the algorithm.\n- **Interactive UI**: Allows users to interact with the grid, set start and goal nodes, and add obstacles.\n\n## Getting Started\n\n### Prerequisites\n\n- Python 3.x\n- Pygame\n\n### Installation\n\nClone the repository:\n   ```bash\n   git clone https://github.com/maskedsyntax/intellipath.git\n   cd intellipath\n   ```\n\n### Running the App\n\nRun the A* pathfinding script using the following command:\n```bash\npython3 main.py\n```\n\nThis will start the application, and you can interact with the grid to visualize the A* pathfinding algorithm.\n\n## Before using A* Algorithm\nSelect the start and end point by clicking any of the box in the grid.\n    _(First click corresponds to the start point and the Second click corresponds to the end point)_\n\nThen click anywhere in the grid to draw obstacles in the path that the algorithm has to avoid.\n\n![Before Image](screenshots/before_algo.png)\n\nPress `Space` to start the visualization of the algorithm and see the result _(the shortest path possible)_ drawn by the algorithm.\n\n## Result Path by the A* Algorithm\n![Result Image](screenshots/result_path.png)\n\nPress `Enter` to clear the grid and draw new maps to play with.\n\n\n## Code Overview\n\n### `main.py`\n\n- **Imports**: Necessary libraries including Pygame and heapq.\n- **Node Class**: Represents a single node in the grid with attributes like position, cost, heuristic, and parent.\n- **A\\* Algorithm**: Implements the A* search algorithm to find the shortest path.\n- **Visualization**: Uses Pygame to visualize the grid, obstacles, start and goal nodes, and the path found by the algorithm.\n- **Event Handling**: Handles user input for setting start and goal nodes, adding obstacles, and resetting the grid.\n\n## License\n\nThis project is licensed under the MIT License. See the [LICENSE](LICENSE) file for details.\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmaskedsyntax%2Fintellipath","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmaskedsyntax%2Fintellipath","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmaskedsyntax%2Fintellipath/lists"}