稀疏矩阵的转置

要求：

1 稀疏矩阵采用三元组顺序表的存储结构

2 能够实现两种转置算法：按列序为主序进行转置和快速转置。

3 输出矩阵转置前后的三元组。-Sparse matrix transpose

requirements: 1 sparse matrix using the table triples storage structure 2 in order to achieve the two transpose algorithm: order by column to transpose the main sequence and rapid transposition. 3 before and after the output matrix transpose triples.