shujujiegou.rar_shujujiegou_图的储存

#include <stdio.h> #include <iostream> #define max 20 typedef struct{ int vert[max]; int edge[max][max]; int n,e; }graph; typedef struct node { int adjvex; struct node *next; }edgenode; typedef struct vnode { int vertex; edgenode *firstedge; }vertexnode; typedef vertexnode adjlist[max]; typedef struct { adjlist adjlist; int n,e; }algraph; void displayalgraph(algraph *g) //邻接链表的显示 { int i; edgenode *e; for(i=0;i<g->n;i++) { e=g->adjlist[i].firstedge; printf("vert(%d)",i); if(e==NULL) printf("->null\n"); else { do{ printf("->(%d)",e->adjvex); e=e->next; } while(e); printf("\n"); } } } void creatgraph(graph *g) //创建图的邻接矩阵 { int i,j,k; printf("请输入结点个数：\n"); scanf("%d",&g->n); printf("请输入边数数：\n"); scanf("%d",&g->e); for(i=0;i<g->n;i++) g->vert[i]=i; for(i=0;i<g->n;i++) for(j=0;j<g->n;j++) g->edge[i][j]=0; for(k=0;k<g->e;k++) { printf("请输入边：\n"); scanf("%d%d",&i,&j); g->edge[i][j]=1; g->edge[j][i]=1; } printf("图的邻接矩阵如下：\n"); } void display(graph *g) //图的邻接矩阵显示 { int i,j; for(i=0;i<g->n;i++) { for(j=0;j<g->n;j++) printf("%2d",g->edge[i][j]); printf("\n"); } } void exchange(graph *g,algraph *alg)//图的邻接矩阵转换成邻接链表 { int i,j; edgenode *e; alg->n=g->n; alg->e=g->e; printf("邻接链表储存如下：\n"); for(i=0;i<g->n;i++) alg->adjlist[i].vertex=g->vert[i]; for(i=0;i<g->n;i++) { alg->adjlist[i].vertex=i; alg->adjlist[i].firstedge=NULL; } for(i=0;i<g->n;i++) for(j=0;j<g->n;j++) if(g->edge[i][j]==1) { e=(edgenode*)malloc(sizeof(edgenode)); e->adjvex=j; e->next=alg->adjlist[i].firstedge; alg->adjlist[i].firstedge=e; e=(edgenode*)malloc(sizeof(edgenode)); e->adjvex=i; e->next=alg->adjlist[j].firstedge; alg->adjlist[j].firstedge=e; } } void main() { graph g1; algraph g2; creatgraph(&g1); display(&g1); exchange(&g1,&g2); displayalgraph(&g2); printf("thank for use! :)\n"); }