采用邻接矩阵表示法，创建无向图graph。 实现功能: 1、打印无向图void printUDN(AMGraph graph) 2、增加顶点Status InsertVex(AMGraph &G, int v) 3、增加边Status DeleteVex(AMGraph &G, int v) 4、删除顶点Status InsertArc( AMGraph &G, int v, int w) 5、删除边Status DeleteArc(AMGraph &G, int v, int w)

好的，针对您的需求，我提供一份C++的代码实现，如下所示： ```c++ #include <iostream> #include <vector> using namespace std; #define MAX_VERTEX_NUM 100 // 邻接矩阵表示法 typedef struct { char vexs[MAX_VERTEX_NUM]; // 存储顶点信息 int arcs[MAX_VERTEX_NUM][MAX_VERTEX_NUM]; // 存储边信息 int vexnum, arcnum; // 记录图的顶点数和边数 } AMGraph; // 打印无向图 void printUDN(AMGraph graph) { cout << "Graph has " << graph.vexnum << " vertexes and " << graph.arcnum << " arcs." << endl; cout << "Vertexes: "; for (int i = 0; i < graph.vexnum; i++) { cout << graph.vexs[i] << " "; } cout << endl; cout << "Arcs: " << endl; for (int i = 0; i < graph.vexnum; i++) { for (int j = i+1; j < graph.vexnum; j++) { if (graph.arcs[i][j] != 0) { cout << "(" << graph.vexs[i] << ", " << graph.vexs[j] << ")" << endl; } } } } // 增加顶点 bool InsertVex(AMGraph &G, char v) { if (G.vexnum == MAX_VERTEX_NUM) return false; G.vexs[G.vexnum] = v; G.vexnum++; return true; } // 删除顶点 bool DeleteVex(AMGraph &G, char v) { int k = -1; for (int i = 0; i < G.vexnum; i++) { if (G.vexs[i] == v) { k = i; break; } } if (k == -1) return false; // 删除第k个顶点和相关的边 for (int i = k; i < G.vexnum-1; i++) { G.vexs[i] = G.vexs[i+1]; } for (int i = 0; i < G.vexnum-1; i++) { for (int j = k; j < G.vexnum-1; j++) { G.arcs[i][j] = G.arcs[i][j+1]; } } for (int i = 0; i < G.vexnum-1; i++) { for (int j = k; j < G.vexnum-1; j++) { G.arcs[j][i] = G.arcs[j+1][i]; } } G.vexnum--; G.arcnum--; return true; } // 增加边 bool InsertArc(AMGraph &G, char v, char w) { int i, j; // 查找v和w在顶点数组中的下标 for (i = 0; i < G.vexnum; i++) { if (G.vexs[i] == v) break; } for (j = 0; j < G.vexnum; j++) { if (G.vexs[j] == w) break; } if (i == G.vexnum || j == G.vexnum) return false; if (G.arcs[i][j] != 0) return false; G.arcs[i][j] = G.arcs[j][i] = 1; G.arcnum++; return true; } // 删除边 bool DeleteArc(AMGraph &G, char v, char w) { int i, j; // 查找v和w在顶点数组中的下标 for (i = 0; i < G.vexnum; i++) { if (G.vexs[i] == v) break; } for (j = 0; j < G.vexnum; j++) { if (G.vexs[j] == w) break; } if (i == G.vexnum || j == G.vexnum) return false; if (G.arcs[i][j] == 0) return false; G.arcs[i][j] = G.arcs[j][i] = 0; G.arcnum--; return true; } int main() { AMGraph graph; graph.vexnum = 0; graph.arcnum = 0; InsertVex(graph, 'A'); InsertVex(graph, 'B'); InsertVex(graph, 'C'); InsertVex(graph, 'D'); InsertVex(graph, 'E'); InsertArc(graph, 'A', 'B'); InsertArc(graph, 'A', 'C'); InsertArc(graph, 'B', 'C'); InsertArc(graph, 'B', 'D'); InsertArc(graph, 'C', 'D'); InsertArc(graph, 'C', 'E'); InsertArc(graph, 'D', 'E'); printUDN(graph); DeleteArc(graph, 'A', 'B'); DeleteVex(graph, 'C'); printUDN(graph); return 0; } ``` 这份代码实现了您提出的功能，具体包括： 1. 打印无向图：`printUDN()`函数； 2. 增加顶点：`InsertVex()`函数； 3. 删除顶点：`DeleteVex()`函数； 4. 增加边：`InsertArc()`函数； 5. 删除边：`DeleteArc()`函数。 同时，这份代码使用了邻接矩阵表示法来存储图，也就是用二维数组 $arcs[i][j]$ 存储顶点 $i$ 和顶点 $j$ 之间的边，如果 $arcs[i][j]$ 的值为 0，表示没有边，如果值为 1，表示有边。其中，数组 $vexs$ 存储顶点信息，$vexnum$ 存储图的顶点数，$arcnum$ 存储图的边数。 希望这份代码能够对您有所帮助！