Graph traversal

From Rodinia
Revision as of 06:29, 18 November 2008 by (Talk)

Jump to: navigation, search


Graph algorithms are fundamental and widely used in many disciplines and application areas. Large graphs involving millions of vertices are common in scientific and engineering applications.

The breadth-first search and shortest path CUDA implementations can be downloaded from here

We would like to acknowledge Pawan Harish and P.J.Narayanan at IIIT who contributed their code to the Rodinia benchmark suite. The related paper can be found at here