怎样在C++中处理稀疏矩阵？

#include <vector>
#include <iostream>

class SparseMatrix {
private:
    std::vector<int> values;  // 非零值
    std::vector<int> col_indices;  // 列索引
    std::vector<int> row_ptrs;  // 行指针

public:
    SparseMatrix(int rows, int cols) {
        row_ptrs.resize(rows + 1, 0);
    }

    void set(int row, int col, int value) {
        if (value != 0) {
            values.push_back(value);
            col_indices.push_back(col);
            row_ptrs[row + 1]++;
        }
    }

    void finalize() {
        for (int i = 1; i < row_ptrs.size(); ++i) {
            row_ptrs[i] += row_ptrs[i - 1];
        }
    }

    int get(int row, int col) const {
        int start = row_ptrs[row];
        int end = row_ptrs[row + 1];
        for (int i = start; i < end; ++i) {
            if (col_indices[i] == col) {
                return values[i];
            }
        }
        return 0;  // 如果没有找到，返回0
    }

    void print() const {
        for (int i = 0; i < row_ptrs.size() - 1; ++i) {
            int start = row_ptrs[i];
            int end = row_ptrs[i + 1];
            for (int j = 0; j < end - start; ++j) {
                std::cout << "Row " << i << ", Col " << col_indices[start + j] << ": " << values[start + j] << std::endl;
            }
        }
    }
};

int main() {
    SparseMatrix matrix(3, 3);
    matrix.set(0, 1, 5);
    matrix.set(1, 0, 3);
    matrix.set(2, 2, 7);
    matrix.finalize();

    matrix.print();

    std::cout << "Value at (1, 0): " << matrix.get(1, 0) << std::endl;
    std::cout << "Value at (0, 0): " << matrix.get(0, 0) << std::endl;

    return 0;
}