数据结构实验题答案.doc

实验四. 稀疏矩阵的三元组顺序表示方法及基本操作的实现（建立、输出、转置）并实现一个主菜单来实现。 #includestdio.h #define maxsize 50 #define maxrow 10 #define maxcol 10 typedef struct { int i,j; int data; }triple; typedef struct { triple elem[maxsize+1]; int mu,nu,tu; }tsmatrix; void createsmatrix (tsmatrix *t){ t=(tsmatrix*)malloc(sizeof(tsmatrix)); if(!t) exit(0); t-mu=0; t-nu=0; t-tu=0; } void transposesmatrix(tsmatrix m,tsmatrix*t){ int q=1,col,p; t-mu=m.nu;t-nu=m.mu;t-tu=m.tu; if(t-tu){ q=1; for(col=1;col=m.nu;col++) for(p=1;p=m.tu;++p) if(m.elem[p].j==col){ t-elem[q].i=m.elem[p].j; t-elem[q].j=m.elem[p].i; t-elem[q].data=m.elem[p].data; ++q; } } } void scanftsmatrix(tsmatrix *t){ int count; printf(enter the nums of matrixs rows:\n); scanf(%d,t-mu); printf(enter the nums of matrixs columns:\n); scanf(%d,t-nu); printf(enter the nums of matrixs datas:\n); scanf(%d,t-tu); for(count=1;count=t-tu;count++){ printf(enter the non-zero numsrow,column,data:\n); scanf(%d%d%d,t-elem[count].i,t-elem[count].j,t-elem[count].data); } } /*void printftsmatrix(tsmatrix*t){ int counter,col; printf(the xishu juzheng is :\n); for(counter=1;counter=t-tu;){ for(col=1;col=t-nu;col++){ if(t-elem[counter].j==col) { printf(%d\t,t-elem[counter].data); counter++; if(t-elem[counter].i==t-elem[counter-1].i) ; else if(col==t-nu) printf(\n); else {for(col++;col=t-nu;col++)printf(*\t); printf(\n); } } else printf(*\t); } } }*/ void printftsmatrix(tsmatrix*t){ int counter,a[maxrow][maxcol]={0},row,col; int*p; p=a; printf(the sparse matrix is :\n); for(counter=1;counter=t-tu;counter++){ a[t-elem[counter].i-1][t-elem[counter].j-1]=t-elem[counter].data; } for(row=1;row=t-mu;row++){ for(col=1;col=t-nu;col++){ printf(%d\t,*p); p++; } printf(\n); p=p+maxcol-col+1; } } void main(){ tsm