MadeEasy Test Series: Algorithms - Minimum Spanning Trees

Question

Answer 1

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

Comments

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.

---

@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.

---

@ Nishant Arora tnka a lot..