My team and I have been looking to implement parallel graph search algorithms in dgraph, similar to: https://dl.acm.org/doi/10.1145/2693714.2693728
The goal is to implement various ways of parallelizing - goroutines, threads, processes and GPU (CUDA) - for the same task and compare them with different sizes of graphs.
We have been getting familiar with dgraph in the past few weeks. We have found Djisktra’s algorithm implemented in
We had a few queries regarding this:
- We are not yet sure how posting lists are structured, but is it feasible to run parallel operations on them without converting them to a different structure (such as an adjacency list)?
- Is there a documentation for code structure of the dgraph repo? There are lots of different folders and files at the root level. We were only able to find
query/shortest.gobecause of a post here on discuss.
- Assuming we are able to implement this, would this be a useful addition to dgraph?