创建图及相关操作算法（Create diagrams and related algorithms）.docVIP

创建图及相关操作算法（Create diagrams and related algorithms） 图采用邻接矩阵存储结构 # define true 1 # define false 0 # define maxv 20 typedef int vertextype; / / 用顶点编号表示顶点 typedef struct {/ / 图的定义 int edges [maxv] [maxv]; / / 边数组 int n, e; / / 顶点数, 弧数 vertextype vexs [maxv]; / / 顶点信息 mgraph}; 1、创建具有n个顶点e条边的无向图 void createudg (mgraph g, int n, int (e) { int i, j, u, v; g.n = n; g.e = e; / * printf (请输入% d个顶点的编号: \ n, n); for (i = 0; i n; i + +) scanf (% d, g.vexs [in]); * / / / 初始化顶点信息, 假设顶点的编号和顶点在数组内的下标相同 for (i = 0; i n; i + +) g.vexs [in] = i; / / 初始化邻接矩阵 for (i = 0; i n; i + +) for (j = 0, j n; j + +) g.edges [in] [j] = 0; for (j = 0, j e; j + +) { printf (请输入一条边的两个顶点编号:); scanf (% d% d d v); g.edges [d] [v] = g.edges [v] [u] = 1; } } 2、创建具有n个顶点e条弧的有向图 void createdg (mgraph g, int n, int (e) { int i, j, u, v; g.n = n; g.e = e; / * printf (请输入% d个顶点的编号: \ n, n); for (i = 0; i n; i + +) scanf (% d, g.vexs [in]); * / / / 初始化顶点信息, 假设顶点的编号和顶点在数组内的下标相同 for (i = 0; i n; i + +) g.vexs [in] = i; / / 初始化邻接矩阵 for (i = 0; i n; i + +) for (j = 0, j n; j + +) g.edges [in] [j] = 0; for (j = 0, j e; j + +) { printf (请输入一条弧的两个顶点编号 (注意先输入的为弧尾):); scanf (% d% d d v); g.edges [d] [v] = 1; } } 3、求图g中顶点v的第一个邻接点 int firstadjvex (mgraph g, int v) { for (int i = 0; i g.n; i + +) if (g.edges [v] [in] = = 1) return; return 1; } 4、求图g中顶点v相对于w的下一个邻接点 int nextadjvex (mgraph g, int v, int w) { for (int i = w; in g.n; i + +) if (g.edges [v] [in] = = 1) return; return 1; } 5、深度优先搜索算法 boolean visited [maxv]; void dfstravse (mgraph g) { / / 对图 g 作深度优先遍历. for (v = 0; v g.vexnum; + + v) visited [v] = false; / / 访问标志数组初始化 for (v = 0; v g.vexnum; + + v) if (! visited [v]), dfs (g, v); / / 对尚未访问的顶点调用dfs } void dfs (mgraph g, int v) { / / 从顶点v出发, 深度优先搜索遍历连通图 g visited [v] = true; printf (v); for (int w = firstadjvex (g, v); w = 0; w = nextadjvex (g, v, w)) if (! visited [w]), dfs (g, w); / / 对v的尚未访问的邻接顶点w / / 递归调用dfs } / / dfs 6、广度优先搜索算法 void bfstraverse (mgraph g) { for (v = 0; v g.vexnum; + + v) vi