1 votes 1 votes Algorithms made-easy-test-series algorithms minimum-spanning-tree + – dileswar sahu asked Jul 19, 2016 • edited Mar 5, 2019 by akash.dinkar12 dileswar sahu 789 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes For prims order is ae, ag,ab,ec,cd,cf,fi,fh Krusskal order is ae,ag,ab,ec,fi,fh,cd,cf So ans is (CD= 7-5) or (CF= 8-6) which is 2 papesh answered Jul 19, 2016 papesh comment Share Follow See all 3 Comments See all 3 3 Comments reply dileswar sahu commented Jul 19, 2016 reply Follow Share here starting vertex not mention.In prime's algo we can choose any vertex as starting vertext.so i choose D vertex as starting vertex .so DC edge as 1st edge & its position shoud be 1.but in kruskal algo its position should be 7.so |1-7|=6 which is max......If im wrong plz correct me. 0 votes 0 votes Nishant Arora commented Jul 19, 2016 reply Follow Share @dileswar sahu this is made easy workbook TRY YOURSELF QUESTION..and algo teacher made correction in the class as to choose starting vertex as A for prims algo...dont worry it will be mention in the question otherwise it will take more time to calculate for every vertex. 0 votes 0 votes dileswar sahu commented Jul 20, 2016 reply Follow Share @ Nishant Arora tnka a lot.. 0 votes 0 votes Please log in or register to add a comment.