矩阵算法（Matrix algorithm）.docVIP

矩阵算法（Matrix algorithm） An algorithm for computing the C language matrix #include iostream #include iomanip Using namespace std; Const int MAXSIZE=100; / / define non zero elements of a number Const int MAXROW=10; / / the maximum number of rows defined array Typedef struct / / definition three tuple elements { Int, I, j; Int e; }Triple; Typedef struct / / define common three tuple object { Triple data[MAXSIZE+1]; Int, mu, Nu, tu; }TSMatrix; Typedef struct// defines three tuple objects with link information { Triple data[MAXSIZE+2]; Int rpos[MAXROW+1]; Int, mu, Nu, tu; }RLSMatrix; Template class P Bool InPutTSMatrix (P T, int y) / / input matrix, according to the three tuple format input { Cout the number of rows, columns, and nonzero elements of the input matrix: endl; CinT.muT.nuT.tu; Cout please output the location and value of nonzero elements: endl; Int k=1; For ((k=T.tu; k++) CinT.data[k].iT.data[k].jT.data[k].e; Return true; } Template class P Int OutPutSMatrix (P T) / / output matrix, according to the standard output format { Int, m, N, k=1; For (m=0; mT.mu; m++) { For (n=0; nT.nu; n++) { If ((T.data[k].i-1) ==m (T.data[k].j-1) ==n) { Cout.width (4); CoutT.data[k++].e; } Else { Cout.width (4); Cout 0; } } Coutendl; } Return 1; } / / transpose matrix Int, TransposeSMatrix () { TSMatrix M, T; / / define pre transpose matrix InPutTSMatrix (M, 0); / / input matrix Int num[MAXROW+1]; Int cpot[MAXROW+1]; / / the construction of auxiliary array Int, Q, P, t; T.tu=M.tu; T.mu=M.nu; T.nu=M.mu; If (T.tu) { For (int col=1; col=M.nu; col++) num[col]=0; For (t=1; t=M.tu; t++) ++num[M.data[t].j]; Cpot[1]=1; For (int i=2; i=M.nu; cpot[i]=cpot[i-1]+num[i-1]; / / i++) for nonzero elements in three tuple positions in each column For (p=1; p=M.tu; p++) { Col=M.data[p].j; q=cpot[col]; T.data[q].i=col; T.data[q].j=M.data[p].i; T.data[q].e=M.data[p].e; ++cpot[col]; } } Cout the transpose of the input matrix is endl; OutPutSMatrix (T); Return 1; } Bool Count (RLSMatrix T) { Int num[