Register

MadeEasy Test Series: Algorithms - Spanning Tree

• edited by
690 views

Please log in or register to answer this question.

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

Related questions

3 votes
3 votes
0 answers
1
smsubham asked Jan 6, 2018
543 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
1 votes
1 votes
1 answer
2
Ram Swaroop asked Jan 30, 2019
1,587 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
0 votes
0 votes
3 answers
4
dhingrak asked Dec 12, 2014
808 views
Minimum cost spanning tree
Please explain why the answer is a)
Please explain why the answer is a)
User Avatar
Link Copied!