Shortest-Path on the GPU: Two buckets is all you need
execfoo.de1 pointsby softwarehippie0 comments
A given graph consists of two connected sub-graphs in which every node has at least three neighbours. The sub-graphs are only connected by a single edge, the bridge. Given a node in each sub-graph, find the bridge. You can assume there is only one bridge.
Send the code to [email protected].
It has been a lot of fun to learn about Vulkan / GLSL and the GPU execution model to figure out why the CPU is so much faster than the GPU. I'll be open sourcing the code soon but so far I'm documenting my journey in a series of blog posts. First one of the series is https://www.execfoo.de/blog/deltastep.html