What is the minimum cost of the spanning tree of the given graph?
What is the minimum cost of the spanning tree of the given graph?
Vertices A to H with weighted edges: A–B 3, A–F 2, B–C 2, B–D 1, C–E 5, C–H 3, D–E 4, E–H 6, E–G 3, F–G 2, G–H 1.
Show answerHide answer
Correct answer: (B) 14