{"id":22601132,"url":"https://github.com/hind-sagar-biswas/pathfindr","last_synced_at":"2026-07-17T11:31:17.839Z","repository":{"id":147517199,"uuid":"602726953","full_name":"hind-sagar-biswas/pathfindr","owner":"hind-sagar-biswas","description":"A visualizer of path finder (BFS) algorithm and maze generator (DFS)","archived":false,"fork":false,"pushed_at":"2024-01-28T12:01:21.000Z","size":582,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-10-24T18:47:27.378Z","etag":null,"topics":["algorithm","algorithm-visualizer","bfs-search","dfs-algorithm","graph","grid","javascript","pathfinder"],"latest_commit_sha":null,"homepage":"https://hind-sagar-biswas.github.io/pathfindr","language":"JavaScript","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/hind-sagar-biswas.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":"2023-02-16T20:18:55.000Z","updated_at":"2023-09-13T12:23:37.000Z","dependencies_parsed_at":"2024-01-28T13:49:08.383Z","dependency_job_id":null,"html_url":"https://github.com/hind-sagar-biswas/pathfindr","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/hind-sagar-biswas/pathfindr","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hind-sagar-biswas%2Fpathfindr","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hind-sagar-biswas%2Fpathfindr/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hind-sagar-biswas%2Fpathfindr/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hind-sagar-biswas%2Fpathfindr/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/hind-sagar-biswas","download_url":"https://codeload.github.com/hind-sagar-biswas/pathfindr/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hind-sagar-biswas%2Fpathfindr/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":35580669,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-07-17T02:00:06.162Z","response_time":116,"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":["algorithm","algorithm-visualizer","bfs-search","dfs-algorithm","graph","grid","javascript","pathfinder"],"created_at":"2024-12-08T12:13:43.240Z","updated_at":"2026-07-17T11:31:17.804Z","avatar_url":"https://github.com/hind-sagar-biswas.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# pathfindr v1.3\n\nA visualizer of path finder algorithm. Generate a grid, set blockades, choose start and end points and the algo will find you the shortest route to your Destinatin....\n\n## IMPORTANT NOTES\n\n- Make sure to keep at least one path open [else RIP your RAM!]\n- The bigger the grid you make, the more time it will take [Highest recommendation: 30x30]\n- There might be some BUGS\n\nIf any bugs found, create an issue or report at \u003cryoutaroshinigami@gmail.com\u003e\n\n**PATH FINDR:** implementation of _BFS algorithm_\n\n**MAZE GENERATOR:** implementation of _DFS algorithm_\n\n## NEXT TARGETS\n\n- Create maze runner game [**DIR:** mazeRunr]\n  - Generate a maze [DONE]\n  - Find the longest open route to set up start and target points.\n    - Modify _BFS algorithm_ to run through all open nodes to find the longest route.\n  - Put a player avatar on start point and make it able to go through open nodes.\n- Develop **A\\* algorithm**\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhind-sagar-biswas%2Fpathfindr","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhind-sagar-biswas%2Fpathfindr","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhind-sagar-biswas%2Fpathfindr/lists"}