> 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

> 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.