1 votes 1 votes Kindly clarify B) Algorithms minimum-spanning-tree + – Pawan Kumar 2 asked Jan 14, 2018 Pawan Kumar 2 749 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Shivam Chauhan commented Jan 14, 2018 reply Follow Share D) is false option B) says suppose you have a cycle with n edges then all n edges have same weight = w. It's true 2 votes 2 votes srestha commented Jan 14, 2018 reply Follow Share yes D) 0 votes 0 votes vishal chugh commented Jan 14, 2018 reply Follow Share If an edge 'e' isn't included in the Minimum Spanning Tree that means the remaining edges have either same weight as 'e' or less than 'e'. But its mentioned here that 'e' is the with minimum weight so it leaves with other edges having same weight. Therefore, option 'B' is true. 0 votes 0 votes Please log in or register to add a comment.