Implementation of simple parallel Breadth-first traversal algorithm in CUDA.
To build the project, run :
make
To run the algorithm on graphs from standard input:
./bfs <number of vertices> <number of edges> <source vertex>
In file "bfs-cuda/edgelist.txt", edge input of the form :
<end of edge 0> <end of edge 0>
<end of edge 1> <end of edge 1>
<end of edge 2> <end of edge 2>
...