Closed szarnyasg closed 1 year ago
Regarding question 1 (stable or experimental): I don't think we have established the process for promoting algorithms but I would imagine the following.
Got it. I think creating the initial implementation of this algorithm as an experimental would be the way to go. I also changed the target of my pull request to the dev
branch.
Yes, it should be fine to do that call to reduce on G->A.
With this update, LAGraph passes all of its tests (including the new PageRankX) with my draft v8.0.0 and the JIT, with no changes. When I turn on the compact mode (GBCUDA_DEV enabled), SS:GrB doesn't use any of its built-in kernels. In v7.4.3 it would call all my generic methods. In my draft v8.0.0 (on the master branch of SS:GrB), it compiles 27 kernels. I think all of them would be covered by my built-in kernels if I turned of GBCUDA_DEV.
Initial implementation of the Graphalytics PageRank variant.
It's been a while since I contributed to LAGraph so my knowledge is a bit rusty. So I'm grateful for any feedback – please let me know if there are any changes to be made.
I have two questions:
Should this implementation go into the stable or the experimental algorithms?
Is accessing
G->A
inallowed without any further checks?