This project implements the Kth Shortest Path Problem using a combination of MPI (Message Passing Interface) for distributed computing and OpenMP for shared memory parallelization. The implementation aims to find the Kth shortest paths among all nodes of a given graph, efficiently utilizing parallel computing resources.

Before you begin, ensure you have the following installed on your distibuted systems:

MPI (e.g., MPICH, Open MPI)

An OpenMP-compatible compiler (e.g., GCC)

Clone the repository to your local machine by clicking here or run the following commands:

git clone https://github.com/anas-farooq8/Top-Kth-Shortest-Path cd Top-Kth-Shortest-Path

mpicc: This is the MPI compiler wrapper for C programs.

-fopenmp: This flag tells the compiler to enable the OpenMP extension.

-o parallel: This option specifies the output filename of the compiled program.

-lm: This links the math library, which is required if your program uses mathematical functions provided by this library, such as sin(), cos(), sqrt(), etc.

Make sure to provide a machinefile example or instructions on how to create one if your target users may not be familiar with this setup.

Adjust the repository URL and any paths or filenames to match your actual project structure.

It's good practice to also include any special instructions for different environments or additional configurations needed for complex setups.