title: CUDA dijkstra's algorithm
body: <p>Has anybody implemented a CUDA parallelization version of Dijkstra's Algorithm for a given sparse matrix (cuSPARSE) graph, and for source, and target node, find the minimal K path?</p>
  
  <p>I really need it to solve a general graph I'll be constructing.</p>
  
  <p>Vincent</p>