第三章 稀疏矩阵（Chapter iii sparse matrix）.docVIP

第三章 稀疏矩阵（Chapter iii sparse matrix） . Chapter iii the sparse range matrix and generalized table 2008-02-02 10:01 xi 1. Topic selection 1. In the link storage of the band pointer to the sparse matrix, each node in the single linked list has the same node A. A line number B column C element value D address 2. Set a sparse matrix of m * n with t nonzero elements to be stored in order, and find the ordinary of the transpose matrix The time complexity of the transpose algorithm is D. A O (m) (m) (n) (n) (n + t) D O (n * t). 3. When the number of nodes in a generalized table is n, the time complexity of the generalized table depth algorithm is B. A O (1) B O (n) C O (n2) D O (log2n) 2. Fill in the blanks 1. In a sparse matrix, the three tuples corresponding to each non-zero element include the row number, column number, and Element value. In the three-tuple linear table corresponding to the sparse matrix, each trituple element is based on the line number and the column number is auxiliary The sequence of assists. In the function definition of an initial sparse matrix, the matrix parameter should be specified as a reference parameter. 4. In the sequential storage of sparse matrices, an array is used to store non-zero elements, which should be greater than the length of the array Is equal to the length of the corresponding ternary linear table. 5. In the link storage of the sparse matrix with row pointer vector, each node contains four domains, corresponding to each node In cross linked storage, each node contains five domains. 6. In the cross link storage of sparse matrix, the down pointer field of each node points to the next node of the same row number, The right pointer points to the next node of the same number as the column number. 7. Elements in a generalized table are singleton and table elements. 8. The depth of a generalized table is equal to the maximum number of brackets nested. 9. In the storage structure of the generalized table, each node contains three domai