Mon Mar 30 22:22:17 2026

kruskal_test():
  numpy version:      1.26.4
  python version:     3.10.12
  Use Kruskal's algorithm to compute a minimal weight
  spanning tree for a weighted graph.

  Problem 0:

  W  I  J for full set of edges
array([[2, 0, 1],
       [6, 0, 3],
       [3, 1, 2],
       [8, 1, 3],
       [5, 1, 4],
       [7, 2, 4],
       [9, 3, 4]])

  W  I  J for spanning tree
array([[2, 0, 1],
       [3, 1, 2],
       [5, 1, 4],
       [6, 0, 3]])
  Tree weight is  16

  Problem 1:

  W  I  J for full set of edges
array([[ 7,  0,  1],
       [ 5,  0,  3],
       [ 8,  1,  2],
       [ 9,  1,  3],
       [ 7,  1,  4],
       [ 5,  2,  4],
       [15,  3,  4],
       [ 6,  3,  5],
       [ 8,  4,  5],
       [ 9,  4,  6],
       [11,  5,  6]])

  W  I  J for spanning tree
array([[5, 0, 3],
       [5, 2, 4],
       [6, 3, 5],
       [7, 0, 1],
       [7, 1, 4],
       [9, 4, 6]])
  Tree weight is  39
Mon Mar 30 22:22:17 2026