0 votes 0 votes closed as a duplicate of: MadeEasy Test Series: Algorithms - Minimum Spanning Trees How to solve such type of questions ? Algorithms made-easy-test-series algorithms minimum-spanning-tree + – Avijit Shaw asked Dec 20, 2018 • closed Jan 9 by Hira Thakur Avijit Shaw 678 views comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments Avijit Shaw commented Dec 20, 2018 reply Follow Share Ans given in key is 14 but I doubt maybe wrong . 0 votes 0 votes kumar.dilip commented Dec 20, 2018 reply Follow Share The main concept is to form a cycle of minimum length. ==> here 1 and 2 we have select. But for 3 we have an option. we can put this weight in the cycle of length three. ==>So, we can't select the weight 3 because it will form the cycle. using this concept we can further proceed the question 0 votes 0 votes register_user_19 commented Dec 23, 2018 reply Follow Share i am getting 14. A ->B = 1 B -> D = 2 A-> D = 3. ( Can't select because form a cycle) A->C = 4. B -> C = 5. ( can't select because it will form a cycle) C->E = 6. take C -> D = 6, C -> E = 7 . MST 1+2+4+7=14 0 votes 0 votes Please log in or register to add a comment.
