{"id":18434582,"url":"https://github.com/kyle-mccarthy/maze-traversal","last_synced_at":"2025-10-07T11:47:05.244Z","repository":{"id":24698100,"uuid":"28109460","full_name":"kyle-mccarthy/maze-traversal","owner":"kyle-mccarthy","description":"Traverse a maze using DFS or BFS to find the shortest path from start to finish.","archived":false,"fork":false,"pushed_at":"2014-12-17T16:37:15.000Z","size":120,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-14T10:53:26.900Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"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/kyle-mccarthy.png","metadata":{"files":{"readme":"README","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}},"created_at":"2014-12-16T22:23:50.000Z","updated_at":"2021-10-19T13:23:02.000Z","dependencies_parsed_at":"2022-07-25T11:17:55.390Z","dependency_job_id":null,"html_url":"https://github.com/kyle-mccarthy/maze-traversal","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/kyle-mccarthy/maze-traversal","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kyle-mccarthy%2Fmaze-traversal","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kyle-mccarthy%2Fmaze-traversal/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kyle-mccarthy%2Fmaze-traversal/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kyle-mccarthy%2Fmaze-traversal/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/kyle-mccarthy","download_url":"https://codeload.github.com/kyle-mccarthy/maze-traversal/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kyle-mccarthy%2Fmaze-traversal/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":259727134,"owners_count":22902181,"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":"2024-11-06T06:04:30.522Z","updated_at":"2025-10-07T11:47:00.193Z","avatar_url":"https://github.com/kyle-mccarthy.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"USES: Python 2.7\n\nTO RUN: python main.py\n\nEnter file name when prompted\n\nWill build shortest path using an algorithm similar to DFS\n\nAlternatively, you could uncomment line 17 in main.py and comment\n18 and 19 and it will find the shortest path using BFS. (I realize\nthat the robot jumps around, so it can't be used for this project,\nbut I didn't want to delete it.)","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkyle-mccarthy%2Fmaze-traversal","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkyle-mccarthy%2Fmaze-traversal","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkyle-mccarthy%2Fmaze-traversal/lists"}