Hi there,
We are working on algorithms utilizing Graph theory to develop metabolic and gene network pathways.
Although there are Java and C++ api’s such as the boost graph library, I was wondering if utilizing CUDA we could utilize some existing graph libraries.
TGL supports only 2 BGL algorithms, breadth_first_search and generate_random_graph.
The internal data structure, vertices and edges, is device_vector of Thrust Library.
It is very simple.
If you want to implement some algorithms on GPU, you can access to vertices and edges from apis such as vertices(g, thrust::call_from_device_tag()), edges(g, thrust::call_from_device_tag()), and adjacenct_vertices( u, g, thrust::call_from_device_tag()) in kernel codes.
If you want to access vertices and edges from host code, the apis are verticrs(g) or vertices( gm thrust::call_from_host_tag()) so on.
TGL supports only 2 BGL algorithms, breadth_first_search and generate_random_graph.
The internal data structure, vertices and edges, is device_vector of Thrust Library.
It is very simple.
If you want to implement some algorithms on GPU, you can access to vertices and edges from apis such as vertices(g, thrust::call_from_device_tag()), edges(g, thrust::call_from_device_tag()), and adjacenct_vertices( u, g, thrust::call_from_device_tag()) in kernel codes.
If you want to access vertices and edges from host code, the apis are verticrs(g) or vertices( gm thrust::call_from_host_tag()) so on.