DocSparse

5 ms·

1. 1.▲
   by DocSparse 6y ago

   Give us time; we're still in the beginning stages of writing algorithms that use it. If you dig through LAGraph, you'll find lots of messy prototypes, as we experiment on various methods. Those are drafts, not polished results.
2. 2.▲
   by DocSparse 6y ago

   I was referring to the PageRank_semiring in https://github.com/DrTimothyAldenDavis/GraphBLAS/blob/5e569f... . I wasn't counting the test for the termination condition -- in the statement in my interview
3. 3.▲
   by DocSparse 7y ago

   No, it's not nonsense at all. GraphBLAS does rely on semirings on sparse matrices, so it does use linear matrix algebra. But it doesn't use or compute a kernel explicitly. A kernel is a vector x so that Ax = 0. There are places
4. 4.▲
   by DocSparse 7y ago

   GraphBLAS uses sparse matrices internally, and the API assumes a sparse format. The data structure is opaque, however, so if I want, I could use dense matrices if it's faster (and there are times when that's faster; see for examp