{"id":22139011,"url":"https://github.com/cwaldbieser/dijkstra","last_synced_at":"2025-10-15T09:29:52.501Z","repository":{"id":64700368,"uuid":"577576757","full_name":"cwaldbieser/dijkstra","owner":"cwaldbieser","description":"Dijkstra's shortest path algorithm.","archived":false,"fork":false,"pushed_at":"2022-12-13T03:24:46.000Z","size":13,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-03-24T10:50:49.819Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/cwaldbieser.png","metadata":{"files":{"readme":"README.rst","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.txt","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2022-12-13T03:24:13.000Z","updated_at":"2022-12-13T03:24:50.000Z","dependencies_parsed_at":"2022-12-13T21:33:15.934Z","dependency_job_id":null,"html_url":"https://github.com/cwaldbieser/dijkstra","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/cwaldbieser/dijkstra","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cwaldbieser%2Fdijkstra","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cwaldbieser%2Fdijkstra/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cwaldbieser%2Fdijkstra/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cwaldbieser%2Fdijkstra/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/cwaldbieser","download_url":"https://codeload.github.com/cwaldbieser/dijkstra/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cwaldbieser%2Fdijkstra/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":261769240,"owners_count":23207157,"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":[],"created_at":"2024-12-01T20:13:14.566Z","updated_at":"2025-10-07T09:57:18.165Z","avatar_url":"https://github.com/cwaldbieser.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"\nDijkstra's shortest path algorithm\n==================================\n\nPython3 implementation.\n\nI always end up using scipy because I forget this algorithm, even though it's\nnot that complicated.  Hopefully, this simple implementation will serve as a\nreference.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcwaldbieser%2Fdijkstra","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcwaldbieser%2Fdijkstra","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcwaldbieser%2Fdijkstra/lists"}