{"id":29793201,"url":"https://github.com/rvhuang/pathfinding-lab","last_synced_at":"2025-07-28T02:09:26.557Z","repository":{"id":99116831,"uuid":"139138122","full_name":"rvhuang/pathfinding-lab","owner":"rvhuang","description":"Run, test and compare all algorithms and heuristic functions","archived":false,"fork":false,"pushed_at":"2019-03-22T10:54:29.000Z","size":320,"stargazers_count":57,"open_issues_count":3,"forks_count":0,"subscribers_count":5,"default_branch":"master","last_synced_at":"2023-10-20T22:55:22.416Z","etag":null,"topics":["algorithm","astar-algorithm","heuristic"],"latest_commit_sha":null,"homepage":"https://pathfinding-lab.codedwith.fun/","language":"TypeScript","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/rvhuang.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}},"created_at":"2018-06-29T10:48:45.000Z","updated_at":"2023-10-20T22:55:22.752Z","dependencies_parsed_at":"2023-06-03T23:15:41.924Z","dependency_job_id":null,"html_url":"https://github.com/rvhuang/pathfinding-lab","commit_stats":null,"previous_names":[],"tags_count":2,"template":null,"template_full_name":null,"purl":"pkg:github/rvhuang/pathfinding-lab","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rvhuang%2Fpathfinding-lab","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rvhuang%2Fpathfinding-lab/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rvhuang%2Fpathfinding-lab/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rvhuang%2Fpathfinding-lab/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/rvhuang","download_url":"https://codeload.github.com/rvhuang/pathfinding-lab/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rvhuang%2Fpathfinding-lab/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":267451489,"owners_count":24089312,"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","status":"online","status_checked_at":"2025-07-28T02:00:09.689Z","response_time":68,"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","astar-algorithm","heuristic"],"created_at":"2025-07-28T02:09:25.826Z","updated_at":"2025-07-28T02:09:26.534Z","avatar_url":"https://github.com/rvhuang.png","language":"TypeScript","readme":"# Pathfinding Laboratory\r\n\r\n[![Docker Image Size](https://images.microbadger.com/badges/image/rvhuang/pathfinding-lab.svg)](https://microbadger.com/images/rvhuang/pathfinding-lab \"Get your own image badge on microbadger.com\") [![Docker Image Version](https://images.microbadger.com/badges/version/rvhuang/pathfinding-lab.svg)](https://microbadger.com/images/rvhuang/pathfinding-lab \"Get your own version badge on microbadger.com\")\r\n\r\nA playground where you can run, test and compare pathfinding algorithms and heuristic functions. \r\n\r\nVisit [the website](https://pathfinding-lab.codedwith.fun/) running on DigitalOcean and try it out.\r\n\r\nThe project is written in ASP.NET Core MVC/Web API and TypeScript. The algorithm part of the project is based on [LINQ to A\\*](https://github.com/rvhuang/linq-to-astar): a POC about pathfinding algorithms written in C# and used with LINQ expressions.\r\n\r\n## Features\r\n\r\n* An editable, retro RPG-style map where you can place various obstacles, creating whatever maze you want.\r\n* Five algorithms and three heuristic functions available for playing with (more to be added).\r\n* Right-clicking on two positions to find a path (can be undone).\r\n* An overlay grid with animation to show expanded nodes and depths(levels).\r\n* A line chart that fully illustrates the evolution of Open List during the process.\r\n* A code snippet that demonstrates LINQ statement using LINQ to A*.\r\n\r\n## Build the project\r\n\r\n```sh\r\ncd src/Heuristic.PathfindingLab/Heuristic.PathfindingLab/\r\nnpm i -s d3\r\nnpm i -s @types/d3\r\ntsc -p tsconfig.json\r\ndotnet build Heuristic.PathfindingLab.csproj\r\n```\r\n\r\n## Build Docker image\r\n\r\n```sh\r\ncd src/Heuristic.PathfindingLab/Heuristic.PathfindingLab/\r\ndocker build -t pathfinding-lab .\r\n```\r\n\r\n## Run Dockerized instance\r\n\r\n```sh\r\ndocker pull rvhuang/pathfinding-lab:latest\r\ndocker run -d -p 8080:80 pathfinding-lab:latest --name p-lab\r\n```\r\n\r\n## License\r\n\r\nCopyright © Robert Vandenberg Huang\r\n\r\nThe project is licensed under the MIT license. Feel free to copy, modify and use it in your computer science homework (grades not guaranteed).\r\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frvhuang%2Fpathfinding-lab","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frvhuang%2Fpathfinding-lab","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frvhuang%2Fpathfinding-lab/lists"}