Using GPU to speed up pathfinding on large graphs

Hi!

I have been using ngraph packages for a long time and recently came across the need to use pathfinding on graphs of the order of 100M nodes and up to 600M egdes (a graph built on an ordered grid). Tell me if there is a possibility of using GPU to speed up the processing of large graphs?

@anvaka

The issue concerns GPU acceleration for pathfinding in ngraph.path on graphs of roughly 100M nodes and 600M edges. No files, tests, or entry points are named, so first determine whether GPU support is feasible for the existing pathfinding implementation. Done would require a defined approach and agreed scope for accelerating these large-graph workloads.

Written by the indexing model from the issue text.