A Java-based application that calculates the shortest path between locations on a world map using Dijkstra's Algorithm.
- Compute the shortest path between nodes on a map
- Efficient graph representation
- Optimized path calculation using priority queues
- Demonstrates real-world usage of graph algorithms
This project implements Dijkstra’s Algorithm to find the minimum distance between nodes in a weighted graph.
- Java
- Data Structures
- Graph Algorithms
- Linked Lists
- Heaps / Priority Queue
Compile the project
javac Main.java
Run the program
java Main
- Implementing graph algorithms
- Working with advanced data structures
- Optimizing performance using heaps
Ramadan Abo Syam