(单选题)10: 已知一个图的顶点集V={1,2,3,4,5,6,7};边集E={( )3, ( )5, ( )8, ( )10, ( )6, ( )15, ( )12, ( )9, ( )4, ( )20, ( )18, ( )25},用克鲁斯卡尔算法得到最小生成树,则在最小生成树中依次得到的各条边为( )。
A: (1,2)3, (4,6)4, (1,3)5, (1,4)8, (2,5)10, (4,7)20
B: (1,2)3, (4,6)4, (1,3)5, (2,3)6, (1,4)8, (3,6)9
C: (1,2)3, (1,3)5, (1,4)8, (4,6)4, (2,5)10, (4,7)20
D: (1,2)3, (1,3)5, (1,4)8, (2,5)10, (4,6)4, (4,7)20
(责任编辑:admin)要这答案加QQ:800020900 或加微信:vq800020900 获取