邻接表存储图深度优先广度优先遍历(国外英文资料).docVIP

邻接表存储图深度优先广度优先遍历(国外英文资料) / / with adjacency table storage map, and then use the depth first and breadth first traversal of the whole graph respectively. #includemalloc.h #define Max 20 #includestdio.h Typedef struct arcnode { Int num; Struct arcnode *nextarc; }arcnode; Typedef struct vexnode { Char data; Arcnode *firstarc; }vexnode; Typedef struct { Vexnode vertex[max]; Int vexnum; Int arcnum; }ALG; Typedef struct { Int data[max+10]; Int front; Int rear; }queue; Int visited[max]; Queue q; Int locate (ALG, *g, char, V) { Int i; For (i=0; ig-vexnum; i++) If (g-vertex[i].data==v) Break; Return (I); } Void creatgraph (ALG *g) { Int i; Char c; Arcnode, *rear, *temp; Printf (the vertex number and the edge number \n of the input graph); Scanf (%d%d, g-vexnum, g-arcnum); Getchar (); Printf (enter all vertex \n); For (i=0; ig-vexnum; i++) { Scanf (%c, (g-vertex[i].data)); G-vertex[i].firstarc=NULL; } Getchar (); For (i=0; ig-vexnum; i++) { Printf (enter all vertices connected to%c and end \n with *, g-vertex[i].data); ((c=getchar) (if) =*!) { Rear= (arcnode *) malloc (sizeof (arcnode)); G-vertex[i].firstarc=rear; Rear-num=locate (g, C); ((c=getchar) (while) =*!) { Temp= (arcnode *) malloc (sizeof (arcnode)); Temp-num=locate (g, C); Rear-nextarc=temp; Rear=temp; } } Rear-nextarc=NULL; Getchar (); } } Void depthfirstsearch (ALG, *g, int, VI) { Arcnode *rear; Putchar (g-vertex[vi].data); Visited[vi]=1; Rear=g-vertex[vi].firstarc; While ((rear! =NULL) (visited[rear-num]!)) { Depthfirstsearch (g, rear-num); Rear=rear-nextarc; } } Void travel (ALG *g) { Int v; For (v=0; vg-vexnum; v++) If (... Visited[v]) Depthfirstsearch (g, V); } Void enterqueue (int V) { Q.data[q.rear]=v; Q.rear++; } Int, deletequeue () { Int t; T=q.data[q.front]; Q.front++; Return (t); } Int, empty () { If (q.front==q.rear) Return 1; Return 0; } Void breadfirstsearch (ALG *g) { Int, V, t; Arcnode *rear; For (v=0; vg-vexnum; v++) { If (... Visited[v]) { Putchar (g-vertex[v].data); Visited[v]=1; Enterqueue (