Return to Question

added 79 characters in body

edited May 4, 2024 at 22:55

You are given a subset of vertices Si=S_i={Ai,1, AiA_i,1,2 A_i,2, ,...,Ai,KiA_i,Ki} consisting of KiK_i vertices. For every pair u,v such that u,v ∈ SiS_i and u<v, add an edge between vertices u and v with weight CiC_i.

After performing all M operations, determine whether G is connected. If it is, find the total weight of the edges in a minimum spanning tree of G.

You are given a subset of vertices Si={Ai,1, Ai,2, ,...,Ai,Ki} consisting of Ki vertices. For every pair u,v such that u,v ∈ Si and u<v, add an edge between vertices u and v with weight Ci. After performing all M operations, determine whether G is connected. If it is, find the total weight of the edges in a minimum spanning tree of G.

You are given a subset of vertices S_i={A_i,1, A_i,2, ,...,A_i,Ki} consisting of K_i vertices. For every pair u,v such that u,v ∈ S_i and u<v, add an edge between vertices u and v with weight C_i.