Find shortest paths between Palestinian cities using A* or Greedy BFS algorithms. Note: Heuristic values may not be accurate for the showcased 15 cities. 🇵🇸
-
Updated
Dec 1, 2023 - Java
Find shortest paths between Palestinian cities using A* or Greedy BFS algorithms. Note: Heuristic values may not be accurate for the showcased 15 cities. 🇵🇸
Shortest path finder using Dijkstra's algorithm for graph traversal.
Add a description, image, and links to the palestine-map topic page so that developers can more easily learn about it.
To associate your repository with the palestine-map topic, visit your repo's landing page and select "manage topics."