I am studying compressed row storage (CRS format) for storing an sparse matrix. I can't tell how this works if the matrix has a row with all entries zero, and in particular, what happens with the pointer row_ptr. Could you describe the val, col_ind and row_ptr vectors for the following matrix?\begin{bmatrix} 2 &  0 & 0\\  0 &  0 & 1\\  0 & 0 & 0\end{bmatrix}Looking for this, somebody suggested me if row $i$ contains entirely zeros, you store in row-ptr$(i)$ the same as in row-ptr$(i+1)$ but what happens when the entries of last row are all 0s?
Compressed row storage: What happens if last row is all zeros?
sparse matrices