{"id":23816216,"url":"https://github.com/andrewn6/astar-pathfinding","last_synced_at":"2026-05-04T10:30:18.670Z","repository":{"id":110624681,"uuid":"345488105","full_name":"andrewn6/astar-pathfinding","owner":"andrewn6","description":"📁 A star path finding algorithim/visualizer written in python","archived":false,"fork":false,"pushed_at":"2021-06-22T17:51:37.000Z","size":83,"stargazers_count":3,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-21T09:13:31.186Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/andrewn6.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}},"created_at":"2021-03-08T00:38:00.000Z","updated_at":"2024-05-22T15:07:29.000Z","dependencies_parsed_at":"2024-04-21T18:48:57.892Z","dependency_job_id":null,"html_url":"https://github.com/andrewn6/astar-pathfinding","commit_stats":null,"previous_names":["0xacn/astar-pathfinding","andrewhummus/astar-pathfinding","andrewn6/astar-pathfinding"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/andrewn6%2Fastar-pathfinding","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/andrewn6%2Fastar-pathfinding/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/andrewn6%2Fastar-pathfinding/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/andrewn6%2Fastar-pathfinding/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/andrewn6","download_url":"https://codeload.github.com/andrewn6/astar-pathfinding/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240086047,"owners_count":19745818,"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":[],"created_at":"2025-01-02T04:29:16.724Z","updated_at":"2026-05-04T10:30:18.624Z","avatar_url":"https://github.com/andrewn6.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"\nA start pathfinding visualiser in python.\n\nThis is the first attempt I implemented the a-star pathfinding algorithim, I created the visualiser with pygame. Although Big props to @Techwithtim for having an amazing tutorial on the algorithim. \r\n\n## Basic Controls\nYou must create a map to start the pathfinding! The start node is orange, end node is turqoise and the walls/drawing are black. \n\nTo create nodes:\n  - Left click (Create the start node with left click, Then the end node with left click)\n \n To delete nodes\n  - It is the same as creation, Except right click!\n \n \n \u003e Note: Unfortunately My algorithm does not support diagnol path finding, Only non diagnol path finding.\r\n \nA start pathfinding visualiser in python.\n\nThis is the first attempt I implemented the a-star pathfinding algorithim, I created the visualiser with pygame. Although Big props to @Techwithtim for having an amazing tutorial on the algorithim. \n\n## Basic Controls\nYou must create a map to start the pathfinding! The start node is orange, end node is turqoise and the walls/drawing are black. \n\nTo create nodes:\n  - Left click (Create the start node with left click, Then the end node with left click)\n \nTo delete nodes:\n  - It is the same as creation, Except right click!\n \n## Colors\nEach color represents something in the program.\n\n- Red (Checks if its closed if the color is read)\n- Green (If open the color is green)\n- Black (if there is a barrier for the path it will be black)\n- Turqoise (Represents the end of the path finding, this will show up if that path gets found)\n- White (Represents if the path is reset)\n\nThis list isn't exhaustive, But shows the most important colors.\n\n\n- \n \u003e Note: Unfortunately My algorithm does not support diagonal path finding, Only non diagonal path finding.\n \nhttps://github.com/andrewnijmeh/astar-pathfinding/blob/main/Screenshots/screen.gif\n\n *a project by Andrew Nijmeh.*\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fandrewn6%2Fastar-pathfinding","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fandrewn6%2Fastar-pathfinding","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fandrewn6%2Fastar-pathfinding/lists"}