s**p 发帖数: 207 | 1 i have a sparse matrix to solve, which need to change a little bit in the
future, will add 1 or 2 non-zero elements or delete 1 or 2 evertime.
i want to use CSR (compressed storage by row) to store it
one way is to implement with three vectors, val, row_ptr, col_idx
but this will give me trouble when i modified the matrix. changing only
several elements I need to re-do the whole procedure.
so I want to use a multimap. which should work very nicely.
then i have one concern, how can i deal with t |
|