edges in sorted order:
  (gh)1 (ci)2 (fg)2 (ab)4 (cf)4 (gi)6 (cd)7 (hi)7 (ah)8 (bc)8 (de)9 (ef)10 (bh)11 (df)14

  edge  1: (g,h) w= 1  Find(g)=g Find(h)=h  DIFFERENT -> accept, total=1
  edge  2: (c,i) w= 2  Find(c)=c Find(i)=i  DIFFERENT -> accept, total=3
  edge  3: (f,g) w= 2  Find(f)=f Find(g)=g  DIFFERENT -> accept, total=5
  edge  4: (a,b) w= 4  Find(a)=a Find(b)=b  DIFFERENT -> accept, total=9
  edge  5: (c,f) w= 4  Find(c)=c Find(f)=g  DIFFERENT -> accept, total=13
  edge  6: (g,i) w= 6  Find(g)=c Find(i)=c  SAME -> reject
  edge  7: (c,d) w= 7  Find(c)=c Find(d)=d  DIFFERENT -> accept, total=20
  edge  8: (h,i) w= 7  Find(h)=c Find(i)=c  SAME -> reject
  edge  9: (a,h) w= 8  Find(a)=a Find(h)=c  DIFFERENT -> accept, total=28
  edge 10: (b,c) w= 8  Find(b)=c Find(c)=c  SAME -> reject
  edge 11: (d,e) w= 9  Find(d)=c Find(e)=e  DIFFERENT -> accept, total=37
  edge 12: (e,f) w=10  Find(e)=c Find(f)=c  SAME -> reject
  edge 13: (b,h) w=11  Find(b)=c Find(h)=c  SAME -> reject
  edge 14: (d,f) w=14  Find(d)=c Find(f)=c  SAME -> reject

MST edges, in the order Kruskal accepted them:
  (g,h) w=1
  (c,i) w=2
  (f,g) w=2
  (a,b) w=4
  (c,f) w=4
  (c,d) w=7
  (a,h) w=8
  (d,e) w=9
  edge count = 8  (|V|-1 = 8)
  total weight = 37
  components at the end = 1
