3 votes 3 votes Am getting 7. The answer given is 10. A - B , A - D , D - E , E - C are the edges i have included. Algorithms ace-test-series graph-algorithms algorithms spanning-tree minimum-spanning-tree + – smsubham asked Jan 6, 2018 • edited Mar 6, 2019 by Rishi yadav smsubham 540 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Ashwin Kulkarni commented Jan 6, 2018 reply Follow Share vertex A should be the leaf node hence it cannot have A-B and A-D. it should have only one edge. 2 votes 2 votes smsubham commented Jan 6, 2018 reply Follow Share Missed that! 1 votes 1 votes Please log in or register to add a comment.
