1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154
| #include <stdio.h> #include <stdlib.h>
#define MAX_VERTEX_NUM 20 #define INF INT_MAX typedef int InfoType; typedef int VertexType; typedef struct ArcNode{ int adjvex; int value; struct ArcNode* nexttarc; InfoType *info; }; typedef struct VNode{ VertexType data; ArcNode *firsttarc; }VNode, AdjList[MAX_VERTEX_NUM];
typedef struct{ AdjList Vertices; int vexnum, arcnum; int kind; }ALGraph;
int visited[MAX_VERTEX_NUM]; int finished[MAX_VERTEX_NUM]; int count; #define LENGTH 4 #define ARCLENGTH 5
int graph[LENGTH][LENGTH] = { INF, 1, 1, INF, INF, INF, INF, INF, 1, INF, INF, INF, 1, INF, 1, INF };
void DFS(ALGraph G, int v){ visited[v] = true; printf("v%d-->", v); ArcNode * p = G.Vertices[v].firsttarc; while(p!=NULL){ if (!visited[p->adjvex]){ DFS(G, p->adjvex); } p = p->nexttarc; } printf("^\n"); } void DFSTraverse(ALGraph G){ for (int v = 0; v < G.vexnum; v++){ visited[v] = false; } for (int v = 0; v < G.vexnum; v++){ if (!visited[v]){ DFS(G, v); } } }
void FORST_DFS(ALGraph G, int v){ visited[v] = true; printf("v%d", v); ArcNode * p = G.Vertices[v].firsttarc; while (p != NULL){ if (!visited[p->adjvex]){ FORST_DFS(G, p->adjvex); } p = p->nexttarc; } finished[count] = v; count++; } void FORST_DFSTraverse(ALGraph G){ count = 0; for (int v = 0; v < G.vexnum; v++){ visited[v] = false; } for (int v = 0; v < G.vexnum; v++){ if (!visited[v]){ FORST_DFS(G, v); } } }
void Director_FORST(ALGraph G){ FORST_DFSTraverse(G); printf("\n"); for (int i = 0; i < G.vexnum; i++){ printf("%d ", finished[i]); } for (int v = 0; v < G.vexnum; v++){ visited[v] = false; } for (int v = finished[G.vexnum - 1]; v >= 0; v--){ if (!visited[v]){ printf("\n"); DFS(G, v); } } }
void CreateGraph(ALGraph &G){ G.vexnum = LENGTH; G.arcnum = ARCLENGTH; for (int i = 0; i < G.vexnum; i++){ G.Vertices[i].data = i; G.Vertices[i].firsttarc = NULL; } for (int i = 0; i < LENGTH; i++){ for (int j = LENGTH-1; j >= 0; j--){ if (graph[i][j] != INF){ ArcNode* p = (ArcNode*)malloc(sizeof(ArcNode)); p->adjvex = j ; p->value = graph[i][j]; p->nexttarc = G.Vertices[i].firsttarc; G.Vertices[i].firsttarc = p; } } } } void DisplayerGraph(ALGraph &G){ int i = 0; ArcNode *p; for (i = 0; i < G.vexnum; i++){ printf("顶点[V%d]的邻接边 ",G.Vertices[i].data); p = G.Vertices[i].firsttarc; while (p){ printf("-->(%d,%d)", p->adjvex, p->value); p = p->nexttarc; } printf("-->(^)\n"); } }
int main(){ ALGraph *G; G = (ALGraph*)malloc(sizeof(ALGraph)); CreateGraph(*G); DisplayerGraph(*G); printf("深度优先搜索:\n"); DFSTraverse(*G); printf("^\n强连通分量求解\n"); Director_FORST(*G);
return 1; }
|