Fri Mar 27 19:24:29 2026

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

  The node-to-node distance matrix
array([[ 0.,  2., inf,  6., inf],
       [ 2.,  0.,  3.,  8.,  5.],
       [inf,  3.,  0., inf,  7.],
       [ 6.,  8., inf,  0.,  9.],
       [inf,  5.,  7.,  9.,  0.]])

  #  I  J  weight(I,J)
  0  1  0  2
  1  2  1  3
  2  4  1  5
  3  3  0  6

prim_test():
  Normal end of execution.
Fri Mar 27 19:24:29 2026