CUDA dijkstra's algorithm [closed]

问题

It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.

Closed 6 years ago.

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?

I really need it to solve a general graph I'll be constructing.

Vincent

来源：https://stackoverflow.com/questions/15099054/cuda-dijkstras-algorithm