1 votes 1 votes DS minimum-spanning-tree graph-algorithms + – biranchi asked Jan 23, 2017 biranchi 662 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Aboveallplayer commented Jan 23, 2017 reply Follow Share what is the answer given? 0 votes 0 votes Rahul Jain25 commented Jan 23, 2017 reply Follow Share Shoukd be option C) bcoz what if given graph is traingle which is cycle of lenth 3 and all are involved in cycle. 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes It should Be Option D bad_engineer answered Jan 23, 2017 bad_engineer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes For 3 https://cp-algorithms.com/graph/second_best_mst.html#toc-tgt-1 A-B: 4 A-C: 5 A-D: 2 B-D: 3 C-D: 6 MST: 2,3,5 weight edge 2nd MST: 2,4,5 and 2.3,6. Rest are correct. smsubham answered Dec 17, 2019 smsubham comment Share Follow See all 0 reply Please log in or register to add a comment.
