数据结构C语言版 图的邻接表存储表示和实现(国外英文资料).docVIP

数据结构C语言版 图的邻接表存储表示和实现(国外英文资料) C language data structure layout and realize that the.Txt adjacency list storage , you are my devil, were closer to you, is far away from the buddha...... Junior high school physical education teacher said: who dares to wear my skirt in class, just punish her upside down.. * Data structure, adjacency list of C language layout, storage, representation and Implementation P163 Compile environment: Dev-C++ 4.9.9.2 Date: February 15, 2011 * / #include stdio.h / / the adjacency table storage representation #define MAX_NAME / / 3 vertices of the maximum length of a string +1 #define MAX_VERTEX_NUM 20 Typedef int InfoType; / / store network weights Typedef char VertexType[MAX_NAME]; / / string type Typedef enum{DG, DN, AG, AN}GraphKind; / / {directed graph, directed, undirected graph, undirected network} Typedef struct ArcNode { Int adjvex; / / the arc at the vertex position Struct ArcNode *nextarc; / / pointer to an arc InfoType *info; / / pointer) net weight }ArcNode; / / table node Typedef struct VNode { VertexType data; / / vertex information ArcNode *firstarc; / / the first table node address pointer to the first attachment of the vertex of arc }VNode, AdjList[MAX_VERTEX_NUM]; / / head Typedef struct { AdjList vertices; Int vexnum, arcnum; / / the graph vertices and arcs Int kind; / / symbol graph type }ALGraph; Typedef int QElemType; / / queue type A single queue, the queue / chain store structure Typedef struct QNode { QElemType data; / / data domain Struct QNode *next; / / pointer domain }QNode, *QueuePtr; Typedef struct { QueuePtr front / / team head pointer, the pointer points to the element domain team head Rear; / / pointer pointing to the tail, the tail elements }LinkQueue; If the u in the G / / vertex, returns the vertex position in the graph; otherwise it returns -1. 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; } / / the adjacency list st