{"id":18511660,"url":"https://github.com/sondosaabed/world-map-dijkstra","last_synced_at":"2025-06-10T20:36:29.686Z","repository":{"id":147491338,"uuid":"599987822","full_name":"sondosaabed/World-Map-Dijkstra","owner":"sondosaabed","description":"World map Shortest Path Dijkstra Optimized using priority queue","archived":false,"fork":false,"pushed_at":"2023-02-10T10:36:40.000Z","size":462,"stargazers_count":11,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-05-29T17:18:10.671Z","etag":null,"topics":["algorithm","dijkstra-shortest-path","graph","java","javafx","world-map"],"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/sondosaabed.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":"2023-02-10T10:26:43.000Z","updated_at":"2024-12-14T11:37:38.000Z","dependencies_parsed_at":null,"dependency_job_id":"14a66f6d-57b5-4f23-8eeb-a88c3c6fbbbd","html_url":"https://github.com/sondosaabed/World-Map-Dijkstra","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sondosaabed%2FWorld-Map-Dijkstra","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sondosaabed%2FWorld-Map-Dijkstra/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sondosaabed%2FWorld-Map-Dijkstra/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sondosaabed%2FWorld-Map-Dijkstra/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sondosaabed","download_url":"https://codeload.github.com/sondosaabed/World-Map-Dijkstra/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sondosaabed%2FWorld-Map-Dijkstra/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":259147187,"owners_count":22812386,"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":["algorithm","dijkstra-shortest-path","graph","java","javafx","world-map"],"created_at":"2024-11-06T15:29:19.393Z","updated_at":"2025-06-10T20:36:29.660Z","avatar_url":"https://github.com/sondosaabed.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# World-Map-Dijkstra\nThis project was done as part of algorithm course BZU. \u003c/br\u003e\n\u003ci\u003e\"Idea. The naive implementation of Dijkstra’s algorithm examines all V vertices in the \ngraph. An obvious strategy to reduce the number of vertices examined is to stop the search \nas soon as you discover the shortest path to the destination. With this approach, you can \nmake the running time per shortest path query proportional to E’ log V’ where E’ and V’ \nare the number of edges and vertices examined by Dijkstra’s algorithm. However, this \nrequires some care because just re-initializing all of the distances to ∞ would take time \nproportional to V. Since you are doing repeated queries, you can speed things up \ndramatically by only re-initializing those values that changed in the previous query.\"\u003c/i\u003e\n\n# input file\n\u003cp\u003enumber of countries, number of adjacens\ncountry1, x, y\n....\ncountry1, country2, weight (distance)\n....\u003c/p\u003e\n\n![image](https://user-images.githubusercontent.com/65151701/218069787-2241ae67-1f7c-4af3-b7e7-77d131f14bdf.png)\n\n\u003cp\u003ex and y for the countries are added to a transparent fridpane as follows:\u003c/p\u003e\n\n![map](https://user-images.githubusercontent.com/65151701/218070657-4536a51d-a27b-4ef2-81fc-0b93172a74e8.png)\n\n# App Screenshots:\nBrowse file scene:\n\n![image](https://user-images.githubusercontent.com/65151701/218068634-61688a7c-b9c3-4ff1-b13e-fd72ef9da91c.png)\n\nShow the map scene:\n\n![image](https://user-images.githubusercontent.com/65151701/218068775-06d3f75d-2c75-4680-abb2-97d57d575e82.png)\n\nShow the shortest path scene:\n\n![image](https://user-images.githubusercontent.com/65151701/218068874-776be9f0-a016-4246-b4b2-8050f347de1e.png)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsondosaabed%2Fworld-map-dijkstra","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsondosaabed%2Fworld-map-dijkstra","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsondosaabed%2Fworld-map-dijkstra/lists"}