数据结构C语言实现稀疏矩阵的压缩及运算的三元组顺序表表示法.docVIP

×ü?á￡oèy?a×é?3Dò±íê?·¨±íê???êè???óóDò??¨μ????TD? ￡? ì?±eê??ú???óμ?3?·¨μ?ê±oò￡?·?3￡?′?ó?￡ í·???t #ifndef SYZHEAD_H_INCLUDED #define SYZHEAD_H_INCLUDED #include lt;stdio.hgt; #include lt;stdlib.hgt; typedef int ElemType ; typedef struct { int row ; int col ; ElemType elem ; } Triple ; typedef struct { Triple* pdata ; int rnum ; int cnum ; int tnum ; } TSMatrix ; int CreateMatrix( TSMatrix* M ) ; int DestroyMatrix( TSMatrix* M ) ; int PrintMatrix( TSMatrix* M ) ; int PrintTriple( TSMatrix* M ) ; int CopyMatrix( TSMatrix* Dest , TSMatrix Source ) ; int TransposeMatrix( TSMatrix* Dest , TSMatrix Source ) ; int AddMatrix( TSMatrix* Q , TSMatrix M , TSMatrix N ) ; int SubMatrix( TSMatrix* Q , TSMatrix M , TSMatrix N ) ; int MultMatrix( TSMatrix* Q , TSMatrix M , TSMatrix N ) ; #endif // SYZHEAD_H_INCLUDED oˉêyμ?êμ?? #include quot;syzhead.hquot; int CreateMatrix( TSMatrix* M ) { printf( quot;please input the rnum , cnum , tnum of M\nquot; ) ; scanf( quot;%d%d%dquot; , amp;M-gt;rnum , amp;M-gt;cnum , amp;M-gt;tnum ) ; M-gt;pdata = ( Triple* )malloc( ( M-gt;tnum #43; 1 )* sizeof( Triple ) ) ; if( !M-gt;pdata ) { exit( 1 ) ; } int count = 1 ; while( count lt;= M-gt;tnum ) { scanf( quot;%d%d%dquot; , amp;M-gt;pdata[count].row , amp;M-gt;pdata[count].col , amp;M-gt;pdata[count].elem ) ; if( M-gt;pdata[count].row gt; M-gt;rnum || M-gt;pdata[count].col gt; M-gt;cnum ) { printf( quot;Index ERROR!\nquot; ) ; exit( 1 ) ; } count#43;#43; ; } return 0 ; } int DestroyMatrix( TSMatrix* M ) { if( !M-gt;pdata ) { printf( quot;ERROR!\nquot; ) ; exit( 1 ) ; } free( M-gt;pdata ) ; M-gt;pdata = NULL ; M-gt;cnum = 0 ; M-gt;rnum = 0 ; M-gt;tnum = 0 ; return 0 ; } int PrintMatrix( TSMatrix* M ) { int i , j ; int count = 1 ; for( i = 1 ; i lt;= M-gt;rnum ; i#43;#43; ) { for( j = 1 ; j lt;= M-gt;cnum ; j#43;#43; ) { if( ( M-gt;pdata[count].row == i ) amp;amp; ( M-gt;pdata[count].col == j ) ) { printf( quot;%d\tquot; , M-gt;pdata[count].elem ) ; count#43;#43; ; } else { printf( quot;0\tquot; ) ; }