GitHub - Mohamed-Ali-Mohamed/Map-Routing: An optimized shortest path-finding project that implements Dijsktra's algorithm on a map, we used 3 approaches for optimization which are: • Idea 1: Stop searching after discovering the shortest path from source node to destination. • Idea 2: Implementing A* algorithm. • Idea 3: Using binary heap instead of priority queue. The project is mixed with 3 ideas. Such algorithms are widely used in geographic information systems (GIS) including MapQuest and GPS-based car navigation systems.

Mohamed-Ali-Mohamed / Map-Routing Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

An optimized shortest path-finding project that implements Dijsktra's algorithm on a map, we used 3 approaches for optimization which are: • Idea 1: Stop searching after discovering the shortest path from source node to destination. • Idea 2: Implementing A* algorithm. • Idea 3: Using binary heap instead of priority queue. The project is mixed w…

wp.me/p33qdn-cx

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
Debug		Debug
Map Routing		Map Routing
Release		Release
.gitattributes		.gitattributes
.gitignore		.gitignore
Map Routing.sdf		Map Routing.sdf
Map Routing.sln		Map Routing.sln
faculty of computers and information sciences ain shams university.pdf		faculty of computers and information sciences ain shams university.pdf