These are the implementations of the previous assignments from the course COMP 5212 Parallel Computing. Various solutions have been tried and current source codes are based on those get the highest performance on the server. These source codes cover the range from OpenMP, MPI to CUDA. The assignments are required to solve the shortest path problem and Bellman-ford algorithm has been involved, considering that there could be negative circles in the graph. Thanks to Prof. LUO's detailed lectures and TAs' patient guide. - View it on GitHub