graph2m.txt

来自「用vc++编写的关于数据结构的图类的若干算法」· 文本 代码 · 共 24 行

graph2M.cpp运行结果:
输入图的点数n=7
输入图的边数k=20
依次输入无向带权图的每条边的起点和终点
序号及权值!直到输入权值为0的边为止!
邻接矩阵:
   0  50  60  99  99  99  99
  50   0  99  65  40  99  99
  60  99   0  52  99  99  45
  99  65  52   0  50  30  42
  99  40  99  50   0  70  99
  99  99  99  30  70   0  99
  99  99  45  42  99  99   0
输出边集数组中的每条边:
{(0,1,50) (0,2,60) (1,3,65) (1,4,40) (2,3,52) 
(2,6,45) (3,4,50) (3,5,30) (3,6,42) (4,5,70) 
}
输出按升序排列的图的边集数组:
{(3,5,30) (1,4,40) (3,6,42) (2,6,45) (0,1,50) 
(3,4,50) (2,3,52) (0,2,60) (1,3,65) (4,5,70)}
输出最小生成树的边集数组:
{(0,1,50) (1,4,40) (4,3,50) (3,5,30) (3,6,42) 
(6,2,45) }