Question 9891 – Sorting
November 26, 2023Question 11372 – Digital-Logic-Design
November 26, 2023Question 6359 – Algorithms
An undirected graph G (V, E) contains n (n > 2) nodes named v1 , v2 ,…,vn. Two nodes vi and vj are connected if and only if 0 <│i−j│≤2. Each edge (vi , vj ) is assigned a weight i+j. The cost of the minimum spanning tree of such a graph with 10 nodes is:
Correct Answer: B
Question 330 Explanation:
Method-1:


88
91
49
21
Subscribe
Login
0 Comments