矩阵数乘.docVIP

矩阵数乘 #includeiostream.h #includeconio.h #includestdlib.h #includeiomanip.h #includefstream.h struct Node //建立链表 { double Date; Node*Next; }; class Matrix //定义矩阵类 { int Row,Line; Node *Head,*Rear;//*CurrentNode; public: Matrix(); //默认的构造函数 Matrix(int,int); //带行列数的构造函数 ~Matrix(); //析构函数 void SetDate(); //输入矩阵元素的函数 void Insert(Node*); void ReadFromFile(char t[]); //从文件中读入矩阵 int GetRow(){return Row;} //返回矩阵的行数 int GetLine(){return Line;} //返回矩阵的列数 void SetCMatrix(int row,int line){Row=row; Line=line;} Node*GetHead(){return Head;} //返回链表头指针的函数 doubleGetElement(int IndexRow,int IndexLine); //从链表中得到某行某列的元素 void DestroyAll(); void Print(); //输出矩阵 }; Matrix::Matrix() { Row=Line=0; Head=NULL; Rear=NULL; } Matrix::Matrix(int row,int line) { int i; Head=NULL; Rear=NULL; Row=row; Line=line; Node*NewNode; for(i=1;i=Row*Line;i++) { NewNode=new Node; NewNode-Date=0; Insert(NewNode); } } Matrix::~Matrix() { Node *tempNode,*CurrentNode; CurrentNode=Head; while(CurrentNode) { tempNode=CurrentNode; CurrentNode=CurrentNode-Next; delete tempNode; } Head=NULL; CurrentNode=NULL; Rear=NULL; } void Matrix::SetDate() { Node *CurrentNode=Head; int i,j; double temp; for(i=0;iRow;i++) { for(j=0;jLine;j++) { cout请输入第i+1行第j+1个元素endl; cintemp; CurrentNode-Date=temp; CurrentNode=CurrentNode-Next; } } } void Matrix::ReadFromFile(char filename[]) //从文件中读入矩阵 { Node*CurrentNode=Head; int i,j; double temp; ifstream ins; ins.open(filename,ios::in|ios::nocreate); if(!ins) { cerr\n文件打开错误!\n; exit(1); } insRow; insLine; for(i=0;iRow;i++) { for(j=0;jLine;j++) { instemp; CurrentNode-Date=temp; CurrentNode=CurrentNode-Next; } } } void Matrix::Insert(Node*NewNode) { if(Head==NULLRear==NULL) { Head=NewNode; Rear=NewNode; Rear-Next=NULL; } else { Rear-Next=NewNode; Rear=NewNode; Rear-Next=NULL; } } doubleMatrix::GetElement(int IndexRow,int