3 ms·
Does it avoid the downsides of a matrix representation mentioned? The article responds to another, noting that there's inherent tradeoffs. ex. "with 100 nodes
by refulgentis 3y ago
Does it avoid the downsides of a matrix representation mentioned?
The article responds to another, noting that there's inherent tradeoffs.
ex. "with 100 nodes and 200 edges...If we use an adjacency matrix representation...we need a 100×100 matrix containing 200 ones and 9,800 zeros. If we instead use an edge list we need only 200 pairs of nodes."
(n.b. this flattens a lot of the interesting info in both articles into 'ah, matrix!" - open to that being true but it feels unlikely)
- michelpp 3y ago> ex. "with 100 nodes and 200 edges...If we use an adjacency matrix representation...we need a 100×100 matrix containing 200 ones and 9,800 zeros. If we instead use an edge list we need only 200 pairs of nodes." The GraphBLAS is a sparse matrix library, it does not store the non-present values. Also, a non-present value may or may not be zero. For example in shortest path algorithms, the non present value is positive infinity.