稀疏矩阵三元组行链表.cpp

矩阵的一些算法应用

#include "iostream.h"
typedef int ElemType;
#define MAX 30
typedef struct Lnode 
{  int i,j;
ElemType e;
struct Lnode *right;
}MLnode;
typedef  struct matrix
{
	MLnode *h[MAX];
	int m,n,t;
}MNode;

MNode *init()
{MNode *head;
	int i;
	head=new MNode;
	cout<<"输入稀疏矩阵的行数、列数、非零元素个数：";cin>>head->m>>head->n>>head->t;
   	for(i=1;i<=head->m;i++)
   {head->h[i]=new MLnode;
    head->h[i]->right=0;
   }
return head;
}
//建立行指针的链表存储
void rowcreate(MNode *head)
{MLnode *p,*q;
int i,row,col,value;

 for(i=0;i<head->t;i++)
 {  cout<<"按行、列、值顺序输入非零元素值："<<endl;
  cin>>row>>col>>value;

   p=new MLnode;
   p->i=row;
   p->j=col;
   p->e=value;
   p->right=0;
  if(head->h[row]->right==0) head->h[row]->right=p;
   else
   {
   q=head->h[row]->right;
   while(q->right!=0) q=q->right;
   q->right=p;
   }
 }
}
void print(MNode *head)
{
	MLnode *p;
int i,j;
  for(i=1;i<=head->m;i++)
  {
   p=head->h[i]->right;
    for(j=1;j<=head->n;j++)
      if(p!=0 && p->i==i&&p->j==j)
	  {cout<<p->e;p=p->right;}
      else
		cout<<"0";
cout<<endl;
    
  
  }
}

void main()
{
	MNode *row;
	row=init();
	rowcreate(row);
	print(row);
}