CUDA Implementations of Breadth First Search and Single Source Shortest Path
algorithms given in IEEE High performance 2007 paper 


"Accelerating Large Graph Algorithms on the GPU using CUDA"
By: Pawan Harish and P.J.Narayanan


Please note the given implementation of SSSP requires CUDA 1.1 Hardware whereas BFS does not
require this hardware. These codes are not optimized, please use CUDA profiler for
better optimization.


Copyright (c) 2008 International Institute of Information Technology. 
All rights reserved.
  
Permission to use, copy, modify and distribute this software and its documentation for 
educational purpose is hereby granted without fee, provided that the above copyright 
notice and this permission notice appear in all copies of this software and that you do 
not sell the software.
  
THE SOFTWARE IS PROVIDED "AS IS" AND WITHOUT WARRANTY OF ANY KIND,EXPRESS, IMPLIED OR 
OTHERWISE.

Created by Pawan Harish.