Register

GAte zeal mock

681 views

2 Answers

0 votes
0 votes

Using Kruskal Algo

9---10 =2

7-----8 =2

9------5=3

5------6=3

3------4=3

8----12=3

2-----6 =4

6-----11=4

11--12 =5

5------1=6

4-----8 =6

answer= 2+2+3+3+3+3+4+4+5+6+6 =41

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

931
views
0 answers
0 votes
Prince Sindhiya asked Dec 21, 2018
931 views
Zeal Test Series 2019: Algorithms - Minimum Spanning Trees
How many of following are correct statements ?(i) A graph where all edge weights are distinct can have more than one shortest path between two vertices u and v ... two vertices u and v (Assume that all edge weights of graph are distinct)
User Avatar
851
views
2 answers
4 votes
gatecse asked Sep 13, 2019
851 views
CMI2019-A-7
An interschool basketball tournament is being held at the Olympic sports complex. There are multiple basketball courts. Matches are scheduled in parallel, with ... minimal spanning tree.Find a minimal cut.Find a minimal vertex cover.
User Avatar
871
views
1 answers
2 votes
Nandkishor3939 asked Jan 25, 2019
871 views
max weighted MST possible
Let G be a complete undirected graph on 5 vertices 10 edges, with weights being 1, 2, 3, 4, 5, 6, 7, 8, 9, 10. Let X be the value of ... 11 but there is no procedure given . Please ,can anyone help me out in understanding the procedure
User Avatar
1.0k
views
3 answers
1 votes
Rishav Kumar Singh asked Aug 22, 2018
1,030 views
Doubt
For a complete graph with 10 vertices, The number of spanning trees is at least_____?
User Avatar
Link Copied!