0 votes 0 votes Algorithms ace-test-series algorithms minimum-spanning-tree + – jhaanuj2108 asked Jan 4, 2019 edited Mar 3, 2019 by I_am_winner jhaanuj2108 432 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply jhaanuj2108 commented Jan 4, 2019 reply Follow Share According to me if we apply Prim's algorithm then we will get <ab> = 6 because if we start from 'a' we will choose -2 and reach 'c' and then if we choose 5<ed> among 5<ed> and <ab> then obviously <ab> should be greater than 5. So, according to me, the minimum should have been 6. But the answer says something else. 0 votes 0 votes Deepanshu commented Jan 4, 2019 reply Follow Share question is wrong specified many times ....that wavy edge thing i remember ....... it is wrong 0 votes 0 votes Please log in or register to add a comment.