https://mitwpumap.lovable.app/
Campus Navigator is a web-based application that demonstrates how graph data structures and shortest path algorithms can be used to simulate real-world navigation systems. The application models a campus as a weighted undirected graph and computes the shortest path between locations using Dijkstra’s Algorithm.
- Interactive visualization of campus landmarks as nodes
- Paths represented as edges with distance weights
- Shortest path calculation between selected locations
- Highlighted route visualization
- Adjacency Matrix and Adjacency List views
- Clean and responsive user interface
The campus is represented as a graph:
- Nodes represent landmarks (e.g., Main Gate, Library, Canteen, Block A, Auditorium)
- Edges represent paths between landmarks
- Weights represent distance between locations
Dijkstra’s Algorithm is used to:
- Compute the shortest distance from a selected source node
- Determine the optimal path to the destination
- Frontend: React
- Visualization: SVG / Canvas
- Algorithm: Dijkstra’s Algorithm
- Data Structure: Adjacency Matrix (with optional Adjacency List)
- Select a starting node
- Select a destination node
- The system computes and displays:
- Shortest distance
- Optimal path
- Integration with real campus map coordinates
- Dynamic node and edge editing
- Multiple route suggestions
- Mobile optimization
- Backend integration for persistent data
Rohan Deogaonkar