This is my final project of Parallel and Distributed Computing which solves the K Shortest Path Problem using parallelized Djkistra's Algorithm.
To run the code use this command: mpicc -o src src.c -fopenmp
-
Notifications
You must be signed in to change notification settings - Fork 0
CosmoJelly/K-Shortest-Path-Using-MPI-and-OpenMP
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This is my final project of Parallel and Distributed Computing which solves the K Shortest Path Problem using parallelized Djkistra's Algorithm.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published