【图 代码练习 】

图代码

结构体

//邻接矩阵
#define maxsize 50
typedef struct {
	int vex[maxsize];
	int edg[maxsize][maxsize];
	int numvex, numedg;
}Mgraph;
//邻接表
typedef struct ArcNode {
	int adjvex;
	struct ArcNode* nextarc;
}ArcNode,*Node;
typedef struct {
	int data;
	ArcNode* firstarc;
}VNode;
typedef struct {
	VNode adjlist[maxsize];
	int numvex, numedg;
}AGraph;

4. 邻接表 求各个顶点的出度

void outDegree(AGraph g) {
	int num = 0;
	ArcNode* arc;
	for (int i = 0; i < g.numvex; i++) {
		num = 0;
		arc = g.adjlist[i].firstarc;
		while (arc != NULL) {
			num++;
			arc = arc->nextarc;
		}
		cout <<"顶点" <<i <<"的出度为：" << num << endl;
	}
}

5. 邻接表 求各个顶点的入度

void inDegree(AGraph g) {
	ArcNode* p;
	 int a[g.numvex];
	 for (int i = 0; i < g.numvex; i++) {
		 p = g.adjlist[i].firstarc;
		 while (p != NULL) {
			 a[p->adjvex]++;
			 p = p->nextarc;
		 }
	 }
}

8.邻接矩阵转邻接表

void Convert1(Mgraph  g, AGraph* G) {
	G->numedg = g.numedg;
	G->numvex = g.numvex;
	for (int i = 0; i < g.numvex; i++) {
		G->adjlist[i].firstarc = NULL;
	}
	for (int i = 0; i < g.numvex; i++) {
	    for (int  j = 0; j < g.numvex; j++)
		{
			if (g.edg[i][j] != 0) {
				ArcNode* p = new ArcNode;
				p->adjvex = j;
				p->nextarc = G->adjlist[i].firstarc;
				G->adjlist[i].firstarc = p;

			}
		}
	}
}

9. 邻接表 邻接表转邻接矩阵

void  Convert(AGraph *G,Mgraph g) {
	g.numedg = G->numedg;
	g.numvex = G->numvex;
	for (int i = 0; i < G->numvex; i++) {
		ArcNode  *p = G->adjlist[i].firstarc;
		while (p != NULL) {
			g.edg[i][p->adjvex] =1;
			p = p->nextarc;
		}
	}
}

头插入创建图

AGraph   *a(int v, int e) {
	AGraph* G = new AGraph;
	G->numvex = v;
	G->numedg = e;
	for (int i = 0; i < v; i++)
		G->adjlist[i].firstarc = NULL;
	for (int i = 0; i < e; i++) {
		int v1; int v2;
		cin >> v1;
		cin >> v2;
		ArcNode *p = new ArcNode;
		p->adjvex=v2;
		p->nextarc = G->adjlist[v1].firstarc;
		G->adjlist[v1].firstarc = p;

		ArcNode  *q = new ArcNode;
		q->adjvex = v1;
		q->nextarc = G->adjlist[v2].firstarc;
		G->adjlist[v2].firstarc = q;
	}
		return G;
}