• 2022-06-27
    1802fa93cc8362c.png从顶点1开始,用prim算法按次序输出最小生成树的边( )
    A: (1,2)(2,3)(3,6)(6,5)(5,4)
    B: (1,2)(2,4)(4,5)(5,6)(6,3)
    C: (1,2)(2,3)(2,4)(4,5)(5,6)
    D: (5,6)(4,5)(2,4)(1,2)(2,3)
    E: (1,2)(2,4)(4,5)(5,6)(2,3)