用CUDA实现BFS算法源码。CUDA是NV公司基于GPU的统一计算架构，BFS复杂度由CPU上的O(V+E)降为O(diameter)，直径diameter即图中root到leaf的最长距离。-This is the algorithm of BFS(breadth first search) on CUDA, and its time complexity is down to O(diameter) which diameter means the longest distance bet

SiftGPU is an implementation of SIFT [1] for GPU. SiftGPU processes pixels parallely to build Gaussian pyramids and detect DoG Keypoints. Based on GPU list generation, SiftGPU then uses a GPU/CPU mixed method to efficiently build compact keypoint lis