Project Title

This is an implementation SSSP using openMP. The goal is to parallelize SSSP algorithm so that it can be computationally faster and can be used to get the shortest path in large graphs with more than million or so nodes.

• Note :- The start node is 0 in most of the graphs.

Googlesheet

• The time is added for each graph in the Googlesheet that uses this link. click here
• Large graphs link

Related

OpenMP documentation click here

Run Locally

Clone the project

  git clone https://github.com/anubhavkhajuria/OpenMP-problems.git

Go to the project directory

  cd my-project

Install dependencies

  sudo apt-get install libomp-dev

To run program, run the following command:-

  gcc -fopenmp Single_source_shortest_path.c -o SSSp
  
  ./SSSp

For networkx implementation u need to have python installed in your system as well as networkx

sudo apt update

sudo apt install python3

sudo apt install python3-pip

pip install networkx