Smart Campus Navigation System
Locations are nodes, paths are weighted edges, and your routing engine finds the best campus path. Example: A101 -> STAIRS -> EXIT -> GATE -> PARK.
JSON Graph Data
Dijkstra + BFS
Indoor or Outdoor Modes
Unified Navigate API
How It Works
1) User selects source and destination.
2) Frontend sends request to backend APIs.
3) Backend runs Dijkstra or BFS on graph data.
4) Frontend renders path, distance, and hops.
Loading nodes...