Algorithms • Parallel Computing • Full-Stack Development
Parallel Dijkstra — Graph Speedster
A graph-processing application exploring sequential and parallel shortest-path computation, interactive visualization, and performance benchmarking.
- C++
- OpenMP
- MySQL
- REST API
- React
- TypeScript
Project overview
A graph-processing application for shortest-path computation that combines algorithm development, parallel computing, database integration, benchmarking, and an interactive web interface.
The project explores sequential and parallel implementations of Dijkstra's shortest-path algorithm and provides performance analysis for different execution configurations.
Key features
- Dijkstra shortest-path computation
- Sequential execution
- Parallel computing experimentation
- OpenMP
- Graph dataset processing
- MySQL integration
- REST API
- Source and destination selection
- Path and cost calculation
- Thread configuration
- Execution-time analysis
- Performance benchmarking
- Interactive frontend
Implementation / workflow
- Select source and destination nodes and calculate the shortest path and its cost.
- Explore sequential and parallel execution configurations, including thread configuration.
- Analyze execution times and benchmarking results across configurations.