{"id":25170266,"url":"https://github.com/nikolatechie/pathfinding-visualizer","last_synced_at":"2026-06-15T20:31:41.517Z","repository":{"id":158018461,"uuid":"255701807","full_name":"nikolatechie/Pathfinding-Visualizer","owner":"nikolatechie","description":"Visualizations of several most popular pathfinding algorithms (Dijkstra's algorithm, A* search etc.)","archived":false,"fork":false,"pushed_at":"2024-04-23T12:39:33.000Z","size":712,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-08-13T18:50:04.847Z","etag":null,"topics":["algorithms","astar-algorithm","bfs","bidirectional-search","cross","dijkstra-algorithm","grid","javascript","pathfinding-algorithms","pathfinding-visualizer","react","reactjs","walls"],"latest_commit_sha":null,"homepage":"https://nikolatechie.github.io/Pathfinding-Visualizer","language":"JavaScript","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/nikolatechie.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":"2020-04-14T19:10:49.000Z","updated_at":"2024-04-23T12:39:34.000Z","dependencies_parsed_at":"2024-04-23T04:17:28.024Z","dependency_job_id":"3db9ea5a-b976-4762-ba6f-c1c98adeb707","html_url":"https://github.com/nikolatechie/Pathfinding-Visualizer","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/nikolatechie/Pathfinding-Visualizer","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nikolatechie%2FPathfinding-Visualizer","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nikolatechie%2FPathfinding-Visualizer/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nikolatechie%2FPathfinding-Visualizer/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nikolatechie%2FPathfinding-Visualizer/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/nikolatechie","download_url":"https://codeload.github.com/nikolatechie/Pathfinding-Visualizer/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nikolatechie%2FPathfinding-Visualizer/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34379915,"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-06-15T02:00:07.085Z","response_time":63,"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":["algorithms","astar-algorithm","bfs","bidirectional-search","cross","dijkstra-algorithm","grid","javascript","pathfinding-algorithms","pathfinding-visualizer","react","reactjs","walls"],"created_at":"2025-02-09T08:40:13.017Z","updated_at":"2026-06-15T20:31:41.492Z","avatar_url":"https://github.com/nikolatechie.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"## Pathfinding Visualizer\nApplication for visualizing several pathfinding algorithms: Dijkstra's SSSP algorithm, A* search, Bidirectional search, BFS and DFS. There is also a checkbox that, when it's checked, allows the algorithm to cross corners (cross diagonally). You can put walls in the grid so that algorithm can **not** cross it. See how it works: https://nikolatechie.github.io/Pathfinding-Visualizer\n\n## Algorithms used in the app\n**Dijkstra's algorithm** (guarantees the shortest path): the most used pathfinding algorithm because of its simplicity and speed.\u003cbr\u003e\n\u003cb\u003eA* search\u003c/b\u003e (guarantees the shortest path): algorithm that uses heuristics to find the shortest path much faster than Dijkstra's algo.\u003cbr\u003e\n**Bidirectional search** (guarantees the shortest path): explores from both start and the finish node simultaneously in a BFS manner.\u003cbr\u003e\n**BFS -\u003e Breadth-first search** (guarantees the shortest path): very simple algorithm that visits all non-visited neighbors at every step.\u003cbr\u003e\n**DFS -\u003e Depth-first search** (*does NOT guarantee* the shortest path): simple recursive algorithm that visits nodes without trying to find the shortest path.\u003cbr\u003e\n\n## Additional features\nTo make it easier to see how the algorithm works, I've created a few functions such as **RESET GRID** that removes both paths and walls from the grid, **CLEAR PATHS** that removes paths of the previous animation, and **CREATE RANDOM GRID** that creates a randomly generated grid so you don't have to draw walls to see how different algorithms behave.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnikolatechie%2Fpathfinding-visualizer","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnikolatechie%2Fpathfinding-visualizer","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnikolatechie%2Fpathfinding-visualizer/lists"}