{"id":24472592,"url":"https://github.com/nellogan/pathfindingvisualizer","last_synced_at":"2025-03-14T14:26:38.379Z","repository":{"id":207477268,"uuid":"489492342","full_name":"nellogan/PathfindingVisualizer","owner":"nellogan","description":"Visualize how different search algorithms traverse a grid.","archived":false,"fork":false,"pushed_at":"2025-03-14T06:17:06.000Z","size":725,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-14T07:24:59.227Z","etag":null,"topics":["astar-algorithm","bfs-algorithm","dfs-algorithm","dijkstra-algorithm","greedy-best-first-search","maze-generator","visualization"],"latest_commit_sha":null,"homepage":"","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/nellogan.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":"2022-05-06T20:58:58.000Z","updated_at":"2025-03-14T06:13:10.000Z","dependencies_parsed_at":"2025-03-14T07:22:42.616Z","dependency_job_id":null,"html_url":"https://github.com/nellogan/PathfindingVisualizer","commit_stats":null,"previous_names":["nellogan/pathfindingvisualizer"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nellogan%2FPathfindingVisualizer","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nellogan%2FPathfindingVisualizer/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nellogan%2FPathfindingVisualizer/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nellogan%2FPathfindingVisualizer/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/nellogan","download_url":"https://codeload.github.com/nellogan/PathfindingVisualizer/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243591859,"owners_count":20315921,"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":["astar-algorithm","bfs-algorithm","dfs-algorithm","dijkstra-algorithm","greedy-best-first-search","maze-generator","visualization"],"created_at":"2025-01-21T08:12:57.816Z","updated_at":"2025-03-14T14:26:38.348Z","avatar_url":"https://github.com/nellogan.png","language":"JavaScript","readme":"# [Interactive pathfinding visualizer live demo](https://nellogan.github.io/PathfindingVisualizer)\nClick on the link above for a live demo. Visualize how search algorithms traverse through a grid with walls and weighted \nedges. Dijkstra's algorithm guarantees the shortest possible path (optimal). A* algorithm will also determine the \nshortest path while incorporating a heuristic function. The heuristic estimates the cost of the cheapest path from n to \nthe goal, thereby reducing the amount of neighbors visited and finding the shortest path in less time than Dijkstra's. \nGreedy best first search only use the heuristic function which will always choose the current shortest cost edge.\n\n\n### Search algorithms to choose from:\nBreadth first search\n\nDepth first search\n\nGreedy best first search\n\nDijkstra's algorithm\n\nA* search algorithm\n\n\n### How edge cost is calculated:\ng(n) = cost of the path from the start node to n.\n\nh(n) = heuristic function that estimates the cost of the cheapest path from n to the finish node.\n\nDijkstra's: f(n) = g(n)\n\nA*: f(n) = g(n) + h(n)\n\nGreedy best first search: f(n) = h(n)\n\n\n### How to interact:\nClick and drag on empty (white) nodes to make them walls (black).\n\nPress shift+click and drag to make weighted (orange) nodes. Weighted nodes cost double compared to normal nodes\n\nClick and drag start (dark green) node or finish (red) node to move it.\n\nLight green nodes are nodes that are in the neighbor queue while gray nodes are nodes that are already visited.\n\nOption to recursively generate a maze.\n\n### Tech stack: \nJavascript, CSS, and React.\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnellogan%2Fpathfindingvisualizer","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnellogan%2Fpathfindingvisualizer","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnellogan%2Fpathfindingvisualizer/lists"}