{"id":24926844,"url":"https://github.com/jaytwolab/dijkstra","last_synced_at":"2025-08-20T10:27:53.500Z","repository":{"id":271043541,"uuid":"911011964","full_name":"JayTwoLab/dijkstra","owner":"JayTwoLab","description":"Dijkstra’s Algorithm :kr: 다익스트라 알고리즘","archived":false,"fork":false,"pushed_at":"2025-01-02T03:58:58.000Z","size":143,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-28T03:07:33.659Z","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":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/JayTwoLab.png","metadata":{"files":{"readme":"README.ko.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":"2025-01-02T03:33:22.000Z","updated_at":"2025-01-02T04:03:26.000Z","dependencies_parsed_at":"2025-01-05T03:12:16.178Z","dependency_job_id":"de2c9d8c-5c42-4c10-9e2b-77781aea7736","html_url":"https://github.com/JayTwoLab/dijkstra","commit_stats":null,"previous_names":["jaytwolab/dijkstra"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JayTwoLab%2Fdijkstra","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JayTwoLab%2Fdijkstra/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JayTwoLab%2Fdijkstra/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JayTwoLab%2Fdijkstra/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/JayTwoLab","download_url":"https://codeload.github.com/JayTwoLab/dijkstra/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246028538,"owners_count":20712038,"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":"2025-02-02T12:53:28.550Z","updated_at":"2025-03-28T12:26:29.441Z","avatar_url":"https://github.com/JayTwoLab.png","language":"Python","readme":"## 다익스트라 알고리즘  \n\n\u003e [English](README.md) , [Korean](README.ko.md)\n\n### 알고리즘\n\n- https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm\n\n### 코드  \n- [dijkstra.py](dijkstra.py)\n\n### 그래프 정의  \n\n\u003cimg width=\"50%\" src=\"dijkstra.png\" /\u003e  \n\n### 출력 결과  \n```\n최단 거리: {'A': 0, 'B': 1, 'C': 3, 'D': 4, 'E': 2}\n```\n\n- 각 결과는 시작 정점 A에서 해당 정점까지의 최단 거리 비용을 나타냅니다.  \n- 예를 들어, `'C': 3`은 A에서 C까지의 최단 경로 비용이 3임을 의미합니다.  \n- `'A': 0`은 다익스트라 알고리즘에서 시작 정점 A에서 A까지의 최단 거리가 0임을 뜻합니다.\n  \n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjaytwolab%2Fdijkstra","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjaytwolab%2Fdijkstra","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjaytwolab%2Fdijkstra/lists"}