3 ms·
(I also deal with sparse graph data in my dayjob.) A 1-step traversal is the same complexity for both a linear algebra and vertex- or edge-centered representat
by yvdriess 7y ago
(I also deal with sparse graph data in my dayjob.)
A 1-step traversal is the same complexity for both a linear algebra and vertex- or edge-centered representation. However, you do absolutely need a sparse linear algebra representation and operations (cfr. GraphBLAS mathematical foundations paper).
With the standardization of linear algebra for large graphs in the form of GraphBLAS, it would be interesting to see a sparse extension to APL or J for dealing with large graph analytics. It's already there for Matlab, Python and Julia.