Overview
A full-stack mapping application that runs Dijkstra’s algorithm on real map coordinates, visualizes how it explores the graph and compares the result with standard routing.
The problem
Routing algorithms are usually taught on toy graphs, disconnected from real maps.
It is hard to see how an algorithm explores a road network, or how its result compares with the routes production services return.
The solution
SmartMap Pro applies a min-heap Dijkstra implementation to real coordinates, animates node exploration step by step and compares the resulting path with a standard routing service.
Around the visualization sit 3D satellite maps, global point-of-interest discovery, real-time weather and route comparison, with data persisted on the server.
Engineering highlights
Efficient shortest paths
A min-heap priority queue gives O((V + E) log V) performance instead of O(V²).
Step-by-step visualization
Users watch the algorithm explore nodes and settle the shortest path.
Real-world comparison
Algorithmic routes are compared side by side with standard routing results.
Rich map experience
3D satellite maps, POI discovery, weather overlays and geospatial calculations.
What was built
- Dijkstra engine with min-heap
- Animated algorithm visualization
- Route comparison tools
- 3D maps and POI discovery
- Weather integration
- Express API with MongoDB persistence
Results
We only publish results we can verify. This project has no published performance or business metrics — we would rather show the engineering than estimate impact.