Thu Mar 26 18:57:42 2026

dijkstra_test():
  numpy version:  1.26.4
  python version: 3.10.12
  dijkstra() uses Dijkstra's algorithm to determine the minimum
  distance from node 0 to each node in a graph,
  given the distances between each pair of nodes.

  Case 0: Graph is connected:

  One-link pairwise distance matrix:
array([[  0.,  40.,  15.,  inf,  inf,  inf],
       [ 40.,   0.,  20.,  10.,  25.,   6.],
       [ 15.,  20.,   0., 100.,  inf,  inf],
       [ inf,  10., 100.,   0.,  inf,  inf],
       [ inf,  25.,  inf,  inf,   0.,   8.],
       [ inf,   6.,  inf,  inf,   8.,   0.]])

  Any path minimal distance to node 0:
array([ 0., 35., 15., 45., 49., 41.])

  Case 1: Graph is not connected:

  One-link pairwise distance matrix:
array([[  0.,  40.,  15.,  inf,  inf,  inf],
       [ 40.,   0.,  20.,  10.,  inf,  inf],
       [ 15.,  20.,   0., 100.,  inf,  inf],
       [ inf,  10., 100.,   0.,  inf,  inf],
       [ inf,  inf,  inf,  inf,   0.,   8.],
       [ inf,  inf,  inf,  inf,   8.,   0.]])

  Any path minimal distance to node 0:
array([ 0., 35., 15., 45., inf, inf])

dijkstra_test():
  Normal end of execution.
Thu Mar 26 18:57:43 2026