{"id":30981176,"url":"https://github.com/nakedmcse/dijkstra-playground","last_synced_at":"2026-05-09T05:34:04.364Z","repository":{"id":310262515,"uuid":"1039239896","full_name":"nakedmcse/dijkstra-playground","owner":"nakedmcse","description":"React page for playing with dijkstra","archived":false,"fork":false,"pushed_at":"2026-04-25T16:49:48.000Z","size":597,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":0,"default_branch":"main","last_synced_at":"2026-04-25T18:28:33.452Z","etag":null,"topics":["bootstrap","dijkstra-algorithm","entombed","reactjs","stackdfs","typescript"],"latest_commit_sha":null,"homepage":"","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/nakedmcse.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,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2025-08-16T19:26:27.000Z","updated_at":"2026-04-25T16:49:51.000Z","dependencies_parsed_at":"2025-08-16T22:17:59.425Z","dependency_job_id":"6699b88e-a5b7-4036-a04a-11b93988a90f","html_url":"https://github.com/nakedmcse/dijkstra-playground","commit_stats":null,"previous_names":["nakedmcse/dijkstra-playground"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/nakedmcse/dijkstra-playground","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nakedmcse%2Fdijkstra-playground","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nakedmcse%2Fdijkstra-playground/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nakedmcse%2Fdijkstra-playground/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nakedmcse%2Fdijkstra-playground/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/nakedmcse","download_url":"https://codeload.github.com/nakedmcse/dijkstra-playground/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nakedmcse%2Fdijkstra-playground/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32808517,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-08T08:22:46.396Z","status":"online","status_checked_at":"2026-05-09T02:00:06.633Z","response_time":123,"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":["bootstrap","dijkstra-algorithm","entombed","reactjs","stackdfs","typescript"],"created_at":"2025-09-12T08:11:47.135Z","updated_at":"2026-05-09T05:34:04.357Z","avatar_url":"https://github.com/nakedmcse.png","language":"TypeScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# dijkstra-playground\nA react app for playing with a maze path tracing implementation of dijkstras algorithm.\n\n## Overview\n\nAn efficient implementation of dijkstras algorithm, which is bound to a map which gets updated with the path after tracing.\nCosts for each of the cardinal direcctions can be set.  It can be set to show just the winning path, or all explored paths.\nMultiple maze generation algorithms are included.\n\n## Features\n\n- **Settable Costs** for each of the directions\n- **Min Heap Priority Queue** implementation of dijkstras algorithm\n- **Stack DFS** implementation of maze generation algorithm\n- **Entombed** implementation of maze generation algorithm\n- **Information Modal** showing the dijkstra algorithm\n\n## Usage\n\nTo build:\n\n```bash\n    npm run build\n```\n\nTo run locally for dev:\n\n```bash\n    npm run start\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnakedmcse%2Fdijkstra-playground","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnakedmcse%2Fdijkstra-playground","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnakedmcse%2Fdijkstra-playground/lists"}