{"id":18084624,"url":"https://github.com/deenuy/dijkstra-algo-shortest-path","last_synced_at":"2025-10-13T19:18:08.202Z","repository":{"id":103532950,"uuid":"487172838","full_name":"deenuy/Dijkstra-algo-shortest-path","owner":"deenuy","description":"Dijkstra's Algorithm for finding shortest path between two cities using PriorityQueues and list nearby cities for given distance k.","archived":false,"fork":false,"pushed_at":"2022-04-30T05:26:58.000Z","size":17,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-06-04T04:26:25.119Z","etag":null,"topics":["data-structures-and-algorithms","graph-theory","java","priority-queues"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/deenuy.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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-04-30T03:34:52.000Z","updated_at":"2022-04-30T04:36:17.000Z","dependencies_parsed_at":"2023-03-13T15:07:28.746Z","dependency_job_id":null,"html_url":"https://github.com/deenuy/Dijkstra-algo-shortest-path","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/deenuy/Dijkstra-algo-shortest-path","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/deenuy%2FDijkstra-algo-shortest-path","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/deenuy%2FDijkstra-algo-shortest-path/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/deenuy%2FDijkstra-algo-shortest-path/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/deenuy%2FDijkstra-algo-shortest-path/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/deenuy","download_url":"https://codeload.github.com/deenuy/Dijkstra-algo-shortest-path/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/deenuy%2FDijkstra-algo-shortest-path/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279016892,"owners_count":26085884,"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-10-13T02:00:06.723Z","response_time":61,"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":["data-structures-and-algorithms","graph-theory","java","priority-queues"],"created_at":"2024-10-31T15:07:21.729Z","updated_at":"2025-10-13T19:18:08.184Z","avatar_url":"https://github.com/deenuy.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Dijkstra-algo-shortest-path\nDijkstra's Algorithm for finding shortest path between two cities using PriorityQueues and list nearby cities for given distance k. Assumes all distances are non-negative.\n\nGraph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices (also called nodes or points) which are connected by edges (also called links or lines).\n\n## Implementations of graph algorithms:\n- Read CSV and create graph with vertices/ nodes and edges using HashMap\u003cString, List\u003cEdge\u003e\u003e\n- Add static method, shortestPath(Graph graph, String from, String to), returning a List of cities visited, from source to the destination, followed by total distance between cities (km)\n- Add static method, nearby(Graph graph, String origin, double distance), returning a List of cities with the corresponding distances, for given distance (eg: k=100)\n\nInput file is provided in CSV format, based on Ontario map, listing cities and distances.\n\n### Citations for code adoption:\n- Sedgewick, R., Wayne, K. (2011). Algorithms, 4th Edition. Addison-Wesley. ISBN: 978-0-321-57351-3\n- Goodrich, M. T., Tamassia, R. (2014). Data Structures and Algorithms in Java, 6th Edition. John Wiley \u0026 Sons. ISBN: 0-471-38367-8\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdeenuy%2Fdijkstra-algo-shortest-path","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdeenuy%2Fdijkstra-algo-shortest-path","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdeenuy%2Fdijkstra-algo-shortest-path/lists"}