This project is a technical description of route optimization in modern navigation systems. It explains how road networks are represented as weighted graphs and how Dijkstra’s Algorithm computes the lowest-cost path between locations.
The document focuses on the internal operation of the system—modeling, computation, and dynamic updates—rather than user interaction. It is written for a general audience and uses visualizations to make abstract computational processes more accessible.
- Nodes → intersections or endpoints
- Edges → roads connecting nodes
- Weights → travel cost (time, distance, traffic)
The algorithm finds the shortest path from a starting node to all other nodes by:
- Initializing distances (start = 0, others = ∞)
- Selecting the smallest unvisited node
- Updating neighboring nodes
- Repeating until the destination is reached
- Converts a road layout into a weighted graph
- Visual distinction between nodes, edges, and weights
- Interactive walkthrough of Dijkstra’s Algorithm
- Shows how distances update over time
- Demonstrates decision-making at each step
- Highlights how the shortest path is formed
- Connects graph theory to real navigation systems
- Accounts for:
- Traffic updates
- Road constraints (one-way, closures)
- Continuous recalculation
- HTML (structure and visualization)
- CSS (layout and styling)
- JavaScript (interactive algorithm simulation)