图邻接表存储表存储表示.docVIP

//------------------í?μ?áú?ó±í′?′￠±íê?------------------ #includestdio.h #includemalloc.h #includestring.h #define OK 1 #define ERROR 0 typedef int Status; #define MAX_VERTEX_NUM 20 #define MAX_NAME 3 typedef int InfoType; typedef char VertexType[MAX_NAME]; typedef enum{DG,DN,UDG,UDN}GraphKind;//{óD?òí?,óD?òí?,?T?òí?,?T?òí?} typedef struct ArcNode { int adjvex; struct ArcNode *nextarc; InfoType *info;//????óD1?D??￠μ????? }ArcNode; typedef struct VNode { VertexType data; ArcNode *firstarc; }VNode,AdjList[MAX_VERTEX_NUM]; typedef struct { AdjList vertices; int vexnum,arcnum; int kind; }ALGraph; //?ó?￥μ??úí??Dμ????? int LocateVex(ALGraph G,VertexType u) { int i; for(i=0;iG.vexnum;i++) if(strcmp(u,G.vertices[i].data)==0) return i; return -1; } //?¨í? Status CreateGraph(ALGraph *G) { int i,j,k,w; VertexType v1,v2; ArcNode *p; printf(??ê?è?í?μ?ààDí(óD?òí?:0,óD?òí?:1,?T?òí?:2,?T?òí?:3):); scanf(%d,(*G).kind); printf(??ê?è?í?μ??￥μ?êy,±?êy:); scanf(%d,%d,(*G).vexnum,(*G).arcnum); printf(??ê?è?%d???￥μ?μ??μ(×?′ó?ü???a%d??×?·?):\n,(*G).vexnum,MAX_NAME); for(i=0;i(*G).vexnum;++i) { scanf(%s,(*G).vertices[i].data); (*G).vertices[i].firstarc=NULL; } if((*G).kind==1||(*G).kind==3) printf(ê?è???ì?±?μ?è¨?μ+???2+??í·:\n); else printf(ê?è???ì?±?μ????2+??í·:\n); for(k=0;k(*G).arcnum;++k) { if((*G).kind==1||(*G).kind==3) scanf(%d%s%s,w,v1,v2); else scanf(%s%s,v1,v2); i=LocateVex(*G,v1); j=LocateVex(*G,v2); p=(ArcNode*)malloc(sizeof(ArcNode)); p-adjvex=j; if((*G).kind==1||(*G).kind==3) { p-info=(int *)malloc(sizeof(int)); *(p-info)=w; } else p-info=NULL; p-nextarc=(*G).vertices[i].firstarc; (*G).vertices[i].firstarc=p; if((*G).kind=2) { p=(ArcNode*)malloc(sizeof(ArcNode)); p-adjvex=i; if((*G).kind==3) { p-info=(int*)malloc(sizeof(int)); *(p-info)=w; } else p-info=NULL; p-nextarc=(*G).vertices[j].firstarc; (*G).vertices[j].firstarc=p; } } return OK; } //ê?3?