its about Kruskals Algorithm

Question

Consider the cities Q,R,S,T,U,V. The costs of the possible roads between cities are given below:

c(Q,T)=17
c(Q,U)=14
c(Q,V)=11
c(R,S)=10
c(R,T)=16
c(R,U)=13
c(S,T)=15
c(S,V)=9
c(T,U)=18
c(U,V)=12

What is the minimum cost to build a road system that connects all the cities?

Answer 1

Try

 

Q to V to S to R to T to U to V

 

11 + 9 + 10 + 16 + 18 + 12 = 76