0 votes 0 votes If the edge weight of minimum spanning tree are given and edge weight of each edge is distinct, then the minimum value of sum (a, b, c, d, e, f, g) is __________. Algorithms algorithms minimum-spanning-tree + – pawan kumarln asked Dec 26, 2017 • retagged May 20, 2021 by Shiva Sagar Rao pawan kumarln 640 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply pawan kumarln commented Dec 26, 2017 reply Follow Share ans given as 82 0 votes 0 votes Aarti3001 commented Dec 26, 2017 i moved by saxena0612 Dec 26, 2017 reply Follow Share What is weight of mst ?? 0 votes 0 votes pawan kumarln commented Dec 26, 2017 reply Follow Share question is saying..."the edge weight of minimum spanning tree are given" ie.with numerical value labeled are MST edges 0 votes 0 votes Please log in or register to add a comment.
Best answer 5 votes 5 votes $a>10$ $11$ $b>7$ $8$ $c>5$ $9$ $d>7$ Because of e $12$ $e>7$ $13$ $f>10$ Because of g $14$ $g>10$ $15$ $Sum =82$ Note: Weights are assigned this way because of 2 reasons : Upper bound because of minimum is asked Edges weight need to be distinct in this graph saxena0612 answered Dec 26, 2017 • selected Dec 26, 2017 by pawan kumarln saxena0612 comment Share Follow See 1 comment See all 1 1 comment reply pawan kumarln commented Dec 26, 2017 reply Follow Share i miss the point "edge weight are distinct" 1 votes 1 votes Please log in or register to add a comment.