{"id":18511675,"url":"https://github.com/sondosaabed/palestine-map","last_synced_at":"2025-04-22T15:43:27.036Z","repository":{"id":147491047,"uuid":"468317055","full_name":"sondosaabed/Palestine-Map","owner":"sondosaabed","description":"Palestine Map using classic Dijkstra shortest path algorithm for maps. Java | JavaFX","archived":false,"fork":false,"pushed_at":"2022-03-10T11:42:41.000Z","size":198,"stargazers_count":13,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-29T16:34:21.570Z","etag":null,"topics":["dijkstra-shortest-path","graph","java","map","palestine"],"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":"2022-03-10T11:37:53.000Z","updated_at":"2024-12-11T05:20:56.000Z","dependencies_parsed_at":null,"dependency_job_id":"d4f2d2b5-370f-419b-9db2-dde3dd375577","html_url":"https://github.com/sondosaabed/Palestine-Map","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%2FPalestine-Map","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sondosaabed%2FPalestine-Map/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sondosaabed%2FPalestine-Map/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sondosaabed%2FPalestine-Map/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sondosaabed","download_url":"https://codeload.github.com/sondosaabed/Palestine-Map/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":250270226,"owners_count":21403011,"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":["dijkstra-shortest-path","graph","java","map","palestine"],"created_at":"2024-11-06T15:29:22.010Z","updated_at":"2025-04-22T15:43:27.014Z","avatar_url":"https://github.com/sondosaabed.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Palestine Map (Graph)\nin this Java desktop project I have created Palestine Map.\nI have implemented the classic Dijkstra’s shortest path algorithm and optimize it for maps. Made it find route information between two cities in Palestine. \nUser may choose the city through mouse or List. The path would appear on the map. This projects includes 50 cities.\n\n# Dijkstra’s algorithm\n Dijkstra’s algorithm is a classic solution to the shortest path problem on a weighted graph. The basic idea is not difficult to understand. We maintain, for every vertex in the graph, the length of the shortest known path from the source to that vertex, and we maintain these lengths in a priority queue. Initially, we put all the vertices on the queue with an artificially high priority and then assign priority 0.0 to the source. The algorithm proceeds by taking the lowest-priority vertex off the PQ, then checking all the vertices that can be reached from that vertex by one edge to see whether that edge gives a shorter path to the vertex from the source than the shortest previously-known path. If so, it lowers the priority to reflect this new information.\n\n# Running the project \nIn order to run the project, needs the JavaFx library to be build on the projecet path.  \n\n# File format example\nThe input files of the program contains as many cities as the user want.\n\nfile format:\nCities:\n\n![00](https://user-images.githubusercontent.com/65151701/157654582-28addf52-b20e-4d70-905e-30ace01f6bf0.png)\n\nAdjacents:\n\n![01](https://user-images.githubusercontent.com/65151701/157654605-f8031cf3-9153-4ec1-9e63-769147989bd5.png)\n\n\n# Programms versions\njavafx.version=17.0.1,  \nJava.version=17.0.8\n\n# Program screenshot:\nBrowse for the inputs file:\n\n![1](https://user-images.githubusercontent.com/65151701/157654694-7a850f4b-2f67-4503-81e0-ca1194f047e0.png)\n\nReady to run: (read the file correctly)\n\n![2](https://user-images.githubusercontent.com/65151701/157654747-9988fc30-0c7a-47ce-80a6-d22c2ca7e27c.png)\n\nMap:\n\n![3](https://user-images.githubusercontent.com/65151701/157654814-3192d9cb-80f9-4ccc-99a3-7e250f56fa07.png)\n\nGet the shortest path using mouse (by click):\n\n![4](https://user-images.githubusercontent.com/65151701/157654907-a504b5e0-678f-4ebe-9134-d66177a21822.png)\n\nGet the shortest path using the list:\n\n![5](https://user-images.githubusercontent.com/65151701/157654966-5ca290e8-b512-4f17-8fe9-417e86f50d81.png)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsondosaabed%2Fpalestine-map","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsondosaabed%2Fpalestine-map","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsondosaabed%2Fpalestine-map/lists"}