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 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288
| #include <stdio.h> #include <string.h> #include <queue> using namespace std;
#define MaxVertex 100
typedef char VertexType; typedef int EdgeType; typedef struct { VertexType Vex[MaxVertex]; EdgeType Edge[MaxVertex][MaxVertex]; int vernum, arcnum; } Graph;
void PrintMatrix(Graph &graph); int InsertVertex(Graph &graph, VertexType vertexName); int DeleteVertex(Graph &graph, VertexType vertexName); int FindVertexIndex(Graph &graph, VertexType vertexName); int AddEdge(Graph &graph, VertexType x, VertexType y); int RemoveEdge(Graph &graph, VertexType x, VertexType y); VertexType FirstNeighbor(Graph &graph, VertexType x); VertexType NextNeighbor(Graph &graph, VertexType x, VertexType y); void BFS(Graph &graph); void BFS_1(Graph &graph); void DFS(Graph &graph, int v); void Visit(Graph &graph, VertexType x);
VertexType NextNeighbor(Graph &graph, VertexType x, VertexType y) { int index = FindVertexIndex(graph, x); if (index > -1) { char pre = '\0'; for (int i = 0; i < graph.vernum; i++) { if (graph.Edge[index][i] == 1) { if (pre == y) { return graph.Vex[i]; } pre = graph.Vex[i]; } } return '\0'; } else { printf("节点%c不存在\n", x); return '\0'; } }
VertexType FirstNeighbor(Graph &graph, VertexType x) { int index = FindVertexIndex(graph, x); if (index > -1) { for (int i = 0; i < graph.vernum; i++) { if (graph.Edge[index][i] == 1) { return graph.Vex[i]; } } return '\0'; } else { printf("节点%c不存在\n", x); return '\0'; } }
int DeleteVertex(Graph &graph, VertexType vertexName) { int index = FindVertexIndex(graph, vertexName); if (index > -1) { for (int i = 0; i < graph.vernum; i++) { for (int j = index; j < graph.vernum-1; j++) { graph.Edge[i][j] = graph.Edge[i][j+1]; } } for (int i = index; i < graph.vernum; i++) { for (int j = 0; j < graph.vernum-1; j++) { graph.Edge[i][j] = graph.Edge[i+1][j]; } } for (int i = 0; i < graph.vernum; i++) { graph.Edge[graph.vernum - 1][i] = 0; graph.Edge[i][graph.vernum - 1] = 0; } for (int i = index; i < graph.vernum - 1; i++) { graph.Vex[i] = graph.Vex[i + 1]; } graph.vernum--; } else { printf("要删除的节点%c不存在,请检查\n", vertexName); return 0; } }
int FindVertexIndex(Graph &graph, VertexType vertexName) { int index = -1; for (int i = 0; i < graph.vernum; i++) { if (graph.Vex[i] == vertexName) { index = i; break; } } return index; }
int RemoveEdge(Graph &graph, VertexType x, VertexType y) { int x_index = FindVertexIndex(graph, x); int y_index = FindVertexIndex(graph, y); if (x_index > -1 && y_index > -1) { graph.Edge[x_index][y_index] = 0; graph.Edge[y_index][x_index] = 0; graph.arcnum--; return 1; } else { printf("节点%c或%c不存在,请检查\n", x, y); return 0; } }
int AddEdge(Graph &graph, VertexType x, VertexType y) { int x_index = FindVertexIndex(graph, x); int y_index = FindVertexIndex(graph, y); if (x_index > -1 && y_index > -1) { graph.Edge[x_index][y_index] = 1; graph.Edge[y_index][x_index] = 1; graph.arcnum++; return 1; } else { printf("节点%c或%c不存在,请检查\n", x, y); return 0; } }
void PrintMatrix(Graph &graph) { printf("邻接矩阵为:\n"); printf(" "); for (int i = 0; i < graph.vernum; i++) { printf("%c ", graph.Vex[i]); } printf("\n"); for (int i = 0; i < graph.vernum; i++) { printf("%c ", graph.Vex[i]); for (int j = 0; j < graph.vernum; j++) { printf("%d ", graph.Edge[i][j]); } printf("\n"); } printf("\n"); }
int InsertVertex(Graph &graph, VertexType vertexName) { for (int i = 0; i < graph.vernum; i++) { if (graph.Vex[i] == vertexName) { printf("顶点插入重复\n"); return 0; } } graph.Vex[graph.vernum++] = vertexName; return 1; }
void Visit(Graph &graph, VertexType x) { if (FindVertexIndex(graph, x) > -1) { printf("%c", x); } }
void BFS(Graph &graph) { printf("广度优先遍历(1): "); queue<VertexType> Q; bool visited[graph.vernum]; Q.push(graph.Vex[0]); Visit(graph, Q.front()); visited[FindVertexIndex(graph, Q.front())] = true; while (!Q.empty()) { VertexType v = Q.front(); Q.pop(); int times = 0; for (VertexType w = FirstNeighbor(graph, v);; w = NextNeighbor(graph, v, w)) { if (w == FirstNeighbor(graph, v) && times++ > 0 || w == '\0') break; if (!visited[FindVertexIndex(graph, w)]) { Visit(graph, w); visited[FindVertexIndex(graph, w)] = true; Q.push(w); } } } printf("\n"); }
void BFS_1(Graph &graph) { printf("广度优先遍历(2): "); queue<int> Q; bool visited[graph.vernum]; Q.push(0); printf("%c", graph.Vex[0]); visited[0] = true; while (!Q.empty()) { int v = Q.front(); Q.pop(); for (int i = 0; i < graph.vernum; i++) { if (graph.Edge[v][i] && !visited[i]) { printf("%c", graph.Vex[i]); visited[i] = true; Q.push(i); } } } printf("\n"); }
bool visited[MaxVertex]; void DFS(Graph &graph, int v) { printf("%c", graph.Vex[v]); visited[v] = true; int times = 0; for (VertexType w = FirstNeighbor(graph, graph.Vex[v]);; w = NextNeighbor(graph, graph.Vex[v], w)) { if (w == FirstNeighbor(graph, graph.Vex[v]) && times++ > 0 || w == '\0') break; int w_index = FindVertexIndex(graph, w); if (!visited[w_index]) DFS(graph, w_index); } }
int main() { Graph graph; InsertVertex(graph, 'A'); InsertVertex(graph, 'B'); InsertVertex(graph, 'C'); InsertVertex(graph, 'D'); InsertVertex(graph, 'E'); InsertVertex(graph, 'F'); InsertVertex(graph, 'G'); InsertVertex(graph, 'H'); AddEdge(graph, 'A', 'B'); AddEdge(graph, 'A', 'C'); AddEdge(graph, 'B', 'D'); AddEdge(graph, 'B', 'E'); AddEdge(graph, 'C', 'F'); AddEdge(graph, 'C', 'G'); AddEdge(graph, 'D', 'E'); AddEdge(graph, 'D', 'H'); AddEdge(graph, 'E', 'H');
PrintMatrix(graph);
BFS(graph); BFS_1(graph); printf("深度优先遍历(1): "); DFS(graph, 0); printf("\n");
return 0; }
|