Our project tackled the K-Shortest Path problem, crucial for applications in routing, navigation, and network optimization. We implemented efficient algorithms using parallel computing with OpenMP for shared-memory and OpenMPI for distributed computing, enhancing performance and scalability to find multiple shortest paths quickly.
marafey / k-shortest-path Goto Github PK
View Code? Open in Web Editor NEWOur project tackled the K-Shortest Path problem, crucial for applications in routing, navigation, and network optimization. We implemented efficient algorithms using parallel computing with OpenMP for shared-memory and OpenMPI for distributed computing, enhancing performance and scalability to find multiple shortest paths quickly.