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. ๐Ÿ‡ต๐Ÿ‡ธ

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

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

image

The map scene:

image

After chosing the algorithm and the source and the destination the rout is shown in the Map:

image

About

Find shortest paths between Palestinian cities using A* or Greedy BFS algorithms. Note: Heuristic values may not be accurate for the showcased 15 cities. ๐Ÿ‡ต๐Ÿ‡ธ

License:MIT License


Languages

Language:Java 100.0%