用三元组表实现稀疏矩阵的转置运算

一个阶数较大的矩阵中的非零元素个数S相对于矩阵元素的总个数t很小时,即非

零元素个数s占矩阵元素的总个数t的25%~30%时,称该矩阵为稀疏矩阵称.

由于稀疏矩阵中非零元素的分布没有任何规律,在存储非零元素时,必须保存该非

零元素所对应的行下标和列下标.这样,存储的每个稀疏矩阵中的非零元素都需要(行

下标,列下标,元素值)三个参量来唯一确定,将这种存储结构称为稀疏矩阵的三元组

表示法.

稀疏矩阵中的所有非零元素构成三元组线性表.若把稀疏矩阵的三元组线性表按顺

序存储结构存储,则称为稀疏矩阵的三元组顺序表.

-group table with three yuan achieve sparse matrix transpose operation of a larger order of the matrix number of non-zero elements relative S matrix elements in the total number t very hour, that is the number of non-zero elements s matrix elements for the total number of t 25% ~ 30%, matrix said the sparse matrix said. because of sparse matrix distribution of non-zero elements of no laws, storage nonzero elements, we must preserve the non-zero elements corresponding to the line indexed and listed indices. so, each storage sparse matrix of non-zero elements are required (under the demarcation line are indexed, elements of value) three parameters to determine only, This storage structure will be known as the sparse matrix method ternary group said. Sparse Matrix of all non-zero elements cons