Description: Compressed storage sparse matrix: Implementing sparse matrix compression storage and realization matrix transpose and summation. When you enter the matrix, you first need to enter the number of non-zero elements of the matrix are input and line number, column number and value. Losers 2 matrix, the automatic calculation of a matrix transpose and matrix and the two. Example: Enter the following: Number of lines 100 905 // matrix is 100, the number of columns is 90, a total of five non-zero elements. 1 10 100 // a (1,10) = 100 50 60 200 // a (50,60) = 200 50 80 100 // a (50,80) = 100 60 60 200 // a (60,60) = 200 99 89 10 // a (99,89) = 10 100 90 4 // matrix b is the number of lines is 100, the number of columns is 90, a total of four non-zero elements. 1 1 10 // b (1,1) = 10 50 60-200 // b (50,60) =- 200 50 80 100 // b (50,80) = 100 70 70 10 // b (70, 70) = 10
To Search:
File list (Check if you may need any files):
实验4
.....\44.cpp
.....\44.dsp
.....\44.dsw
.....\44.ncb
.....\44.opt
.....\44.plg
.....\Debug
.....\.....\44.exe
.....\.....\44.ilk
.....\.....\44.obj
.....\.....\44.pdb
.....\.....\vc60.idb
.....\.....\vc60.pdb
.....\题目.txt
Download