Description: 1. According to the concept of compress storage, storage sparse matrix not only the zero yuan, with two three yuan group {I, j, e} to show the matrix of the nonzero yuan in the line, column and numerical, and determine a nonzero yuan. Thus, sparse matrix can be said of the zero dollars by three yuan array and determine the ranks number.
2. User input data as three yuan group in the line, column and the number of the zero yuan, set off by a comma. And input the zero dollars in the line, column and value.
3. This procedure in only two a matrix of arithmetic, the result of the matrix should be another generation, with a two dimensional array deposit, and into the new matrix, as long as the solution to matrix is able to find out the answer.
To Search:
File list (Check if you may need any files):
稀疏矩阵运算器.cpp
Download