Skip to content

Implementation of parallel single-source shortest path algorithm in CUDA.

License

Notifications You must be signed in to change notification settings

PratyushVM/sssp-cuda

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

14 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

sssp-cuda

Implementation of parallel Bellman-Ford single-source shortest path algorithm in CUDA.

Execution:

To build the project, run :
make


To run the algorithm on graphs from standard input:
./sssp <number of vertices> <number of edges> <source vertex>

In a file "sssp-cuda/edgelist.txt", edges in the form :
<weight of edge 0><end of edge 0> <end of edge 0>
<weight of edge 1><end of edge 1> <end of edge 1>
<weight of edge 2><end of edge 2> <end of edge 2>
...

Note : The graph cannot have negative weights.

Benchmarking on bitcoin-otc(SNAP Dataset).

About

Implementation of parallel single-source shortest path algorithm in CUDA.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published