The problem to be solved consists in determining all shortest paths between pairs of nodes in a given graph.
For more information about the implementation problem, see the file "Description" in this repository
The programming language used is C with the MPI library.
A program made by [José Pedro][2] for a college assignment of computer science from Faculty of Science of University of Porto.
To run the program, you must have the MPI software installed in your device. If you don't have You can go to MPI Home Page and see the process to installation.
After install the software, you can compile first the program by:
mpicc program.cAnd to run the program after compile:
mpirun -np 2 a.outThe -np flag means how many processors(cores) you want to use to run the program(you only can run the number of max the cores of your CPU have or it will fail the execution).