Register

Virtual Gate Test Series: Algorithms - Spanning Tree

• edited by
604 views

1 Answer

0 votes
0 votes
The correct answer will be option A. You can verify this by taking simple example for n=2.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
3 answers
1
Purple asked Jan 11, 2017
1,095 views
Virtual Gate Test Series: Algorithms - Minimum Spanning Tree
I think all options are wrong
I think all options are wrong
User Avatar
1 votes
1 votes
1 answer
2
Ram Swaroop asked Jan 30, 2019
1,585 views
MadeEasy Test Series 2019: Algorithms - Spanning Tree
Consider a simple undirected weighted graph G(V, E) with 10 vertices and 45 edge, assume (u, v) are two vertices weight of a edge is =4lu- vl then the minimum cost of the spanning tree of G_ 36
Consider a simple undirected weighted graph G(V, E) with 10 vertices and 45 edge, assume (u, v) are two vertices weight of a edge is =4lu- vl then the minimum cost of the...
User Avatar
3 votes
3 votes
0 answers
3
smsubham asked Jan 6, 2018
540 views
Ace Test series: Algorithms - Spanning Tree
Am getting 7. The answer given is 10. A - B , A - D , D - E , E - C are the edges i have included.
Am getting 7. The answer given is 10.A - B , A - D , D - E , E - C are the edges i have included.
User Avatar
Link Copied!