I don’t know enough about the implementation details to know whether this is a good idea, but would the following be possible / feasible / efficient?
Imagine you have a big graph G = (V, E), and you want to find the shortest path from a to b for all a, b in V. Since this is embarrassingly parallel and has tons of individual threads, is there a known way to use PyTorch/CUDA to find all these paths?