稀疏矩阵的表示方法

上周王老师讲了，稀疏矩阵的表示方式，一种是三元组，一种十字链表。
下面展示的是十字链表，三元组比较简单。有空补上
这个和我之前说的的有向图的十字链表表示法很像。准确来说就是简化版本。

#include<iostream>
#include<cstdlib>
#include<string>
using namespace std;
typedef int Elemtype;
typedef struct OLNode {
	int i, j;
	Elemtype e;
	struct OLNode *right, *down;
}OLNode, *OLink;
typedef struct {
	OLink *rhead, *chead;
	int mu, nu, tu;
}CrossList;
void CreateMatrix(CrossList &M)
{
	//创建稀疏矩阵M，采用十字链表存储表示
	int i, j;
	Elemtype e;
	cout << "小刘，请输入行数列数和非零元素的个数" << endl;
	cin >> M.mu >> M.nu >> M.tu;
	M.rhead = (OLink *)malloc(sizeof(OLink)*(M.mu + 1)); //0~n
	for (int i = 0; i <= M.mu; i++)M.rhead[i] = NULL;  //初始化 
	M.chead = (OLink *)malloc(sizeof(OLink)*(M.nu + 1));
	for (int i = 0; i <= M.nu; i++) M.chead[i] = NULL;
	if (M.rhead == NULL) cout << "内存分配失败!!!" << endl;
	if (M.chead == NULL) cout << "内存分配失败!!!" << endl;
	for (int k = 1; k <= M.tu; k++)
	{
		cin >> i >> j >> e;
		OLink p = (OLink)malloc(sizeof(OLNode)), q;
		if (!p) cout << "内存分配失败!!!" << endl;
		p->i = i, p->j = j, p->e = e;
		if (M.rhead[i] == NULL || M.rhead[i]->j > j) //表为空或者要在表头做插入 
		{
			p->right = M.rhead[i];
			M.rhead[i] = p;
		}
		else {
			for (q = M.rhead[i]; q->right&&q->right->j < j; q = q->right);//注意分号
			p->right = q->right, q->right = p;  //插入 
		}
		if (M.chead[j] == NULL || M.chead[j]->i > i)
		{
			p->down = M.chead[j];
			M.chead[j] = p;
		}
		else {
			for (q = M.chead[j]; q->down&&q->down->i < i; q = q->down);
			p->down = q->down, q->down = p;
		}
	}

}
void OutMatrix(const CrossList &M)
{
	for (int i = 1; i <= M.mu; i++)
	{
		OLink p = M.rhead[i];
		while (p)
		{
			cout << p->i << "->" << p->j << "=" << p->e << endl;
			p = p->right;
		}
	}
}
void Insert(CrossList &M)
{
	int i, j, e;
	cout << "输入要插入的行和列和值" << endl;
	cin >> i >> j >> e;
	OLink p = (OLink)malloc(sizeof(OLNode)), q;
	p->i = i, p->j = j, p->e = e;
	if (M.rhead[i] == NULL || M.rhead[i]->j > j)
	{
		p->right = M.rhead[i];
		M.rhead[i] = p;
	}
	else {
		for (q = M.rhead[i]; q->right&&q->right->j < j; q = q->right);//分号
		p->right = q->right, q->right = p;
	}
	if (M.chead[j] == NULL || M.chead[j]->i > i)
	{
		p->down = M.chead[j];
		M.chead[j] = p;
	}
	else {
		for (q = M.chead[j]; q->down&&q->down->i < i; q = q->down);
		p->down = q->down, q->down = p;
	}
	M.tu++;
}
void Delete(CrossList &M)
{
	int i, j;
	cout << "要删除的行和列" << endl; //比如删除 1 1 
	cin >> i >> j;
	OLink p = NULL, r = NULL;
	if (M.rhead[i] == NULL) { cout << "输入错误" << endl; return; }
	if (M.chead[j] == NULL) { cout << "输入错误" << endl; return; }
	if (M.rhead[i]->j == j) M.rhead[i]= M.rhead[i]->right;
	else {
		for (p = M.rhead[i]; p->j < j&&p; p = p->right) r = p;
		r->right = p->right;
	}
	if(M.chead[j]->i==i) M.chead[j] = M.chead[j]->down;
	else {
		for (p = M.chead[j]; p->i < i&&p; p = p->down) r = p;
		r->down = p->down;
	}
	free(p);
	M.tu -= 1;
}
int main()
{
	string s;
	CrossList M;
	CreateMatrix(M);
	while (cin >> s)
	{
		if (s == "insert") Insert(M);
		if (s == "print") OutMatrix(M);
		if (s == "delete") Delete(M);
		if (s == "exit") break;
	}
	return(0);
}
/*
3 4 4
1 1 3
1 4 5
2 2 -1
3 1 2
print
insert
1 2 4
delete
1 1
*/