Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/sondosaabed/palestine-cities-map
Find shortest paths between Palestinian cities using A* or Greedy BFS algorithms. Note: Heuristic values may not be accurate for the showcased 15 cities.
https://github.com/sondosaabed/palestine-cities-map
a-star-algorithm country-map greedy greedy-best-first-search java javafx-application map palestine-map pathfinding
Last synced: 8 days ago
JSON representation
Find shortest paths between Palestinian cities using A* or Greedy BFS algorithms. Note: Heuristic values may not be accurate for the showcased 15 cities.
- Host: GitHub
- URL: https://github.com/sondosaabed/palestine-cities-map
- Owner: sondosaabed
- License: mit
- Created: 2023-07-11T12:35:19.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2023-12-01T18:30:39.000Z (12 months ago)
- Last Synced: 2023-12-02T17:36:10.643Z (12 months ago)
- Topics: a-star-algorithm, country-map, greedy, greedy-best-first-search, java, javafx-application, map, palestine-map, pathfinding
- Language: Java
- Homepage:
- Size: 992 KB
- Stars: 3
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Palestinian Cities map
- Use the Report in the repo. for more detailed information.
## Summary
Throughout the development of this project, the process was divided into 3 sections:
- The first section (Data Collection) collects data including Cities, roads,
and air distance comma-separated Values (CSV) files.
- The second section (Methodology) is concerned with the selected algorithms, their implementation, and the justification of that selection.
- The third section (User Interface) presents the user interface specifications.
## Features:
- User can browse for the cities, streets and arial data.
- User can chose distination and sourse cities.
- User can find the shhortest path between them.
- User can see the distance and the path on the map.
- User can chose the algorithm used (A*) or (Gdeedy BFS).
## Note:
Data was collected in csv files, but the heuristic values were not collected right. 15 cities are shown and paths on the map.
# Screenshots of the Running Program:
First Scene Broswe for the citits file
The map scene:
After chosing the algorithm and the source and the destination the rout is shown in the Map:
