edited by
680 views

Please log in or register to answer this question.

Related questions

3 votes
3 votes
0 answers
1
smsubham asked Jan 6, 2018
519 views
Am getting 7. The answer given is 10.A - B , A - D , D - E , E - C are the edges i have included.
1 votes
1 votes
1 answer
2
Ram Swaroop asked Jan 30, 2019
1,561 views
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...
0 votes
0 votes
2 answers
4
Nidhi Budhraja asked Aug 31, 2018
734 views
Q1) Why is the path between a pair of vertices in a minimum Spanning tree of an undirected graph not the shortest( minimum weight) path?