北林oj数据结构280

基于邻接表的边的删除

描述

给定一个无向图，在此无向图中删除一条边。

输入

多组数据，每组m+2行。第一行有两个数字n和m，代表有n个顶点和m条边。顶点编号为1到n。第二行到第m+1行每行有两个数字h和k，代表边依附的两个顶点。第m+2行有两个数字f和g，代表删除的边所依附的两个顶点。当n和m都等于0时，输入结束。

输出

每组数据输出n行。为删除边后的邻接表。每两个数字之间用空格隔开。

输入样例 1 

3 2
1 2
2 3
3 2
3 1
1 2
1 2
0 0

输出样例 1

1 2
2 1
3
1
2
3

#include<iostream>
using namespace std;
#define Max 100

typedef struct LNode {
	int data;
	struct LNode* next;
}LNode,*LinkList;

typedef struct {
	int vexnum;
	int argnum;
	LinkList v[Max];
}Graph;

void Create(Graph& g, int n, int m) {
	g.vexnum = n;
	g.argnum = m;
	for (int i = 1; i <= n; i++) {
		g.v[i] = new LNode;
		g.v[i]->data = i;
		g.v[i]->next = NULL;
	}
	for (int i = 0; i < m; i++) {
		int x, y;
		cin >> x >> y;
		LNode* p = new LNode;
		p->data = y;
		p->next = g.v[x]->next;
		g.v[x]->next = p;
		LNode* q = new LNode;
		q->data = x;
		q->next = g.v[y]->next;
		g.v[y]->next = q;
	}
}

void Insert(Graph& g, int x,int y) {
	g.argnum = g.argnum + 1;
	LNode *p = new LNode;
	p->data = y;
	p->next = g.v[x]->next;
	g.v[x]->next = p;

	LNode* q = new LNode;
	q->data = x;
	q->next = g.v[y]->next;
	g.v[y]->next = q;
}

void Delete(Graph& g, int x,int y) {
	LNode* p = g.v[y];
	while (p) {
		if (p->next->data == x) {
			p->next = p->next->next;
			break;
		}
		p = p->next;
	}
	LNode* q = g.v[x];
	while (q) {
		if (q->next->data == y) {
			q->next = q->next->next;
			break;
		}
		q = q->next;
	}
	g.argnum = g.argnum - 1;
}

void output(Graph g ){
	for (int i = 1; i <= g.vexnum; i++) {
		LNode* p = g.v[i];
		while (p->next) {
			cout << p->data << " ";
			p = p->next;
		}
		cout << p->data << endl;
	}
}

int main() {
	int n, m;
	while (cin >> n >> m && n != 0 && m != 0) {
		Graph g;
		Create(g, n, m);
		int x,y;
		cin >> x>>y;
		Delete(g, x, y);
		output(g);
	}
}