An open API service indexing awesome lists of open source software.

https://github.com/maemoonfarooq/shortest-path-finder-using-parallel-processing

Welcome to the Parallel Shortest Path Finder! This innovative tool is designed to swiftly determine the shortest routes between pairs of nodes in a graph. Leveraging the power of Dijkstra's algorithm, it navigates graph connections using an adjacency list and a hash table-based distance matrix for optimal efficiency.
https://github.com/maemoonfarooq/shortest-path-finder-using-parallel-processing

bash-script c data-structures mpi openmp-parallelization

Last synced: about 2 months ago
JSON representation

Welcome to the Parallel Shortest Path Finder! This innovative tool is designed to swiftly determine the shortest routes between pairs of nodes in a graph. Leveraging the power of Dijkstra's algorithm, it navigates graph connections using an adjacency list and a hash table-based distance matrix for optimal efficiency.

Awesome Lists containing this project

README

        

Welcome to our project of Parrarel Distributed Computing

How to run the file:

1.Run the command on you terminal to complile the bash script file:
chmod +x driver.sh

2.Now as the file has been compiled an executale has been made as:
driver.sh

3.To run the executable type:
./driver.sh

Now the program is running make sure to enter the commands that display on
the terminal after executing only after teh GUI is printed otherwise the program
may crash

The bashscript upon executing first compiles the C code and then
one by one executes for each file.

IMPORTANT
Make sure that all the graph files are in your directory where the code is.
Also you need to make sure that the path of the directory is correct which
you can change according to your needs
The path is stated in the top line of the bash script

Thats All :)

Group Members:
Maemoon Farooq 21i1680
Abubakr 21i1691
Waleed Saeed 21i1672