Test by Bikram | Algorithms | Test 2 | Question: 20

Question

Consider the following Graph G:

 

The number of minimum cost spanning trees using Kruskal's Algorithm is _________ .

Answer 1

Edges included in all MST's are - EH,EI,FI

Remaining Edges - 

MST 1 - FG,GJ

MST 2 - IJ,GJ

MST 3 - FG ,IJ

MST 4 - IG,IJ

MST 5 - IG ,GJ

Comments

Edges included in all MST's are - EH,EI,FI

Shouldn't it be EH,EF,FI ???? 

---

Yes it's EF  EH  FI.