A map guidance system that helps individuals and businesses navigate efficiently by calculating optimal routes based on traffic conditions, blockades, and distance.
This system develops a map guidance platform utilizing Kruskal's algorithm to compute the minimum spanning tree of a weighted directed graph. Graph weights are determined by distance, traffic intensity, and blockades, providing users with optimal routes they wouldn't know about ahead of time.
- Graph Visualization: Interactive 2D and 3D graph visualization with traffic-aware coloring
- Algorithm Comparison: Side-by-side comparison of Kruskal's, Prim's, and Dijkstra's algorithms
- Route Calculator: Calculate optimal paths between nodes
- Graph Builder: Create custom graphs with nodes, edges, and traffic conditions
- Graph Templates: Quick-load common network topologies (Grid, Tree, Complete, Bipartite, Star)
- Performance Benchmarking: Measure and compare algorithm execution times
- Graph Metrics: Analyze degree distribution, clustering coefficient, and betweenness centrality
- Interactive Tutorial: Step-by-step guide to using the system
- Import/Export: Support for JSON and CSV file formats
- React + TypeScript
- Vite
- Tailwind CSS
- Three.js (3D Visualization)
- Framer Motion (Animations)
- Recharts (Data Visualization)
-
STANS.mp4
- Course: Data Structures and Algorithms
- Class: BSE-3(B)
- University: Bahria University, Karachi Campus
- Course Instructor: Engr. Majid Kalim
- Lab Instructor: Engr. Saniya Sarim
# Install dependencies
npm install
# Start development server
npm run dev
# Build for production
npm run buildThis project is developed as part of the Data Structures and Algorithms course at Bahria University.