// just for test，无向图，邻接矩阵，书上图 6.17(a) void CreateUDG_AMG_Test(AMGraph &g){ g.vexnum = 8; g.arcnum = 9; // vertices string temp[] = {"V1", "V2", "V3","V4", "V5", "V6","V7", "V8"}; for (int i=0; i<g.vexnum; i++){ g.vexs[i] = temp[i]; } // init arcs as 0 for (int j=0; j<g.vexnum; j++) for (int k=0; k<g.vexnum; k++){ g.arcs[j][k] = 0; } // arcs int arc_i[] = {0, 0, 1, 1, 2, 2, 3, 4, 5}; int arc_j[] = {1, 2, 3, 4, 5, 6, 7, 7, 6}; int i, j; for (int k=0; k<g.arcnum; k++){ i = arc_i[k]; j = arc_j[k]; g.arcs[i][j] = 1; g.arcs[j][i] = 1; } return; } // just for test，无向网，邻接矩阵，书上图 6.19 void CreateUDN_AMG_Test(AMGraph &g){ g.vexnum = 6; g.arcnum = 10; // vertices string temp[] = {"V1", "V2", "V3","V4", "V5", "V6"}; for (int i=0; i<g.vexnum; i++){ g.vexs[i] = temp[i]; } // init arcs as MaxInt for (int j=0; j<g.vexnum; j++){ for (int k=0; k<g.vexnum; k++){ g.arcs[j][k] = MaxInt; } } // arcs int arc_i[] = {0, 0, 0, 1, 1, 2, 2, 2, 3, 4}; int arc_j[] = {1, 2, 3, 2, 4, 3, 4, 5, 5, 5}; int weights[] = {6, 1, 5, 5, 3, 5, 6, 4, 2, 6}; int i, j; for (int k=0; k<g.arcnum; k++){ i = arc_i[k]; j = arc_j[k]; g.arcs[i][j] = weights[k]; g.arcs[j][i] = weights[k]; } return; } // just for test，有向网，邻接矩阵 void CreateDN_AMG_Test(AMGraph &g, int vexnum, int arcnum, string vertices[], int arc_i[], int arc_j[], int weights[]){ g.vexnum = vexnum; g.arcnum = arcnum; // vertices for (int i=0; i<g.vexnum; i++){ g.vexs[i] = vertices[i]; } // init arcs as MaxInt for (int j=0; j<g.vexnum; j++){ for (int k=0; k<g.vexnum; k++){ g.arcs[j][k] = MaxInt; } } // arcs int i, j; for (int k=0; k<g.arcnum; k++){ i = arc_i[k]; j = arc_j[k]; g.arcs[i][j] = weights[k]; } return; }如何根据这个来编写以邻接矩阵存储创建无向网
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
