《Data Structures》-公开·课件设计.pptVIP

* The Code (2) MatrixNode::MatrixNode(bool b, Triple *t) // constructor { head = b; if (b) {right = down = this;} // row/column header node else triple = *t; // element node or header node for list of header nodes } class Matrix{ friend istream operator(istream, Matrix); public: ~Matrix(); // destructor private: MatrixNode *headnode; }; * Reading in a Sparse Matrix (1) 1 istream operator(istream is, Matrix matrix) 2 {// Reading in a matrix and set up its linked representation. 3 Triple s; 4 is s.row s.col s.value; // matrix dimensions 5 int p = max(s.row, s.col); 6 // set up header node for list of header nodes 7 matrix.headnode = new MatrixNode(false, s); 8 if (p = = 0) { matrix.headnode ? right = matrix.headnode; return is;} 9 // at least one row or column 10 MatrixNode **head = new MatrixNode * [p ]; 11 for (int i = 0; i p; i++) 12 head[i] = new MatrixNode(true, 0); 13 int currentRow = 0; 14 int MatrixNode *last = head[0]; // last node in current row * Reading in a Sparse Matrix (2) 15 for (i = 0; i s.value; i++) // input triples 16 { 17 Triple t; 18 is t.rowt.colt.value; 19 if (t.row currentRow) { // close current row 20 last ? right = head[currentRow]; 21 currentRow = t.row; 22 last = head[currentRow]; 23 } // end of if 24 last = last ? right = new MatrixNode(false, t); // link new node into new list 25 head[t.col] ? next = head[t.col] ? next? down = last; // link into column list 26 } //?end of for * Reading in a Sparse Matrix (3) 27 last? right = head[currentRow]; // close last row 28 for (i = 0; i s.col; i++) head[i] ? next? down = head[i] // close all column lists 29 // link the header nodes together 30 for (i = 0; i p; i++) head[i] ? next = head[i + 1]; 31 head[p -1] ? next = matrix.headnode; 32 matrix.headnode? right = head[0]; 33 delete [] head; 34 return is; 35 } * Analysis of operator The total time O(max{m,n}+r)=O(n+m+r) It is asymptotically better than