图的邻接表存储表存储表示(国外英语资料).doc

图的邻接表存储表存储表示(国外英语资料) Adjacency list storage //------------------ map that C #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; //{directed graph, directed, undirected graph, undirected network} Typedef struct ArcNode { Int adjvex; Struct ArcNode *nextarc; InfoType *info; / / pointer to the arc of relevant information }ArcNode; Typedef struct VNode { VertexType data; ArcNode *firstarc; }VNode, AdjList[MAX_VERTEX_NUM]; Typedef struct { AdjList vertices; Int, vexnum, arcnum; Int kind; }ALGraph; For the vertices in the graph / position 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; } / / Map Status CreateGraph (ALGraph *G) { Int, I, J, K, w; VertexType, V1, v2; ArcNode *p; Printf (enter the type of graph (digraph: 0, directed network: 1, undirected graph: 2, undirected network: 3).); Scanf (%d, (*G).Kind); Printf (enter the number of vertices and the number of edges:); Scanf (%d,%d, (*G).Vexnum, (*G).Arcnum; Printf (enter the value of%d vertices (maximum%d characters): \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 (enter the value of each edge + arc end + arc head: \n); Else Printf (enter the arc end of each edge + arc head: \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 (ArcNo