图的最小生成树（Minimum spanning tree of a graph）.docVIP

图的最小生成树（Minimum spanning tree of a graph） # includes stdio.h # includes stdlib.h # includes conio.h # includes string.h # define ing 9999 int visited [10]; / * 访问标志数组 * / typedef struct arccell { int adj; / * 顶点关系类型, 用1表示相邻, 0表示不相邻 * / } arccell, * * adjmatrix 邻接矩阵; / * * / typedef struct type { char date [3]; / * 顶点值 * / } vertextype; typedef struct { vertextype * vexs 顶点向量; / * * / adjmatrix 邻接矩阵 arcs; / * * / int vexnum, arcnum 图的顶点数和边数; / * * / } mgraph; struct clos { vertextype adjvex; int low-cost; } * closedge; / * 辅助数组, low..为0时就表示已访问过 * / void initgraph (mgraph * g) / * 初始图 * / {int i, nu, mu. printf (\ n输入顶点的个数和 (边) 弧的个数:); scanf (% d% d nu, mu); g - arcs = (arccell * *) malloc (nu * sizeof (arccell *)); for (i = 0; i nu; i + +) / * 分配邻接矩阵空间 * / g - arcs [i] = (arccell *) malloc (nu * sizeof (arccell)); g - vexs = (vertextype *) malloc (nu * sizeof (vertextype)); / * 分配顶点空间 * / g - vexnum = nu; g - arcnum = mu 图的顶点数和边数; / * * / } void insertgraph (mgraph * g, int i, vertextype and 给图顶点向量付值) / * * / {if (i 0 | | g vexnum) return; strcpy (g - vexs [] date, e.data); } int locate (mgraph g, vertextype v1 确定v1在图顶点中的位置) / * * / {int i; for (i = 0; i g.vexnum; i + +) if (strcmp (v1.data, g.vexs [] date) = = 0) return; return - 1; } void createund (mgraph * g) / * 采用数组 (邻接矩阵) * / {int i, j, k, p, q, w; vertextype v1, v2. p = (int *) malloc (g - vexnum * sizeof (int)); for (i = 0; i 10; i + +) p [i] = 0. for (i = 0; i g vexnum; + + i) / * 初始邻接表 * / {for (j = 0 and j g vexnum; + + j) g - arcs [the] [j].adj = ing;} printf (按顺序输入顶点和它们的权值再顶点: 如s v1 3 v2: \ n); for (k = 0; k g arcnum; + + k) {printf (输入第% d 条 (边) 弧: \ n, (k + 1); scanf (% d% d% d, v1.data, w, v2.data 输入相邻的两个点值和权值); / * * / the = if (* g, v1); j = if (g, 2); / * 用i 和j来确定它们的位置 * / g - [the] [j] arcs.adj = w; g - arcs [j] [i].adj = g - arcs [the] [j].adj 有向图时就不用这个; / * * / } } int minimum (mgraph g, struct clos * closedge 求出辅助数组中除0之外最小权值的顶点位置) / * * / {int i, min, j, k; fo