Wed Oct  8 08:44:49 2025

partial_digest_test():
  python version: 3.10.12
  numpy version:  1.26.4
  Test partial_digest()

find_distances_test():
  find_distances() takes a candidate location Y
  and determines whether its distance to each point
  in the X array is listed in the L array.

  Initial L array:

     0      13
     1      15
     2      38
     3      90
     4       2
     5      25
     6      77
     7      23
     8      75
     9      52

  Consider Y = 77

  This Y is acceptable.

  New X array:

     0       0
     1      90
     2      77

  New L array:

     0      52
     1      15
     2       2
     3      25
     4      38
     5      23
     6      75

  Consider Y = 35

  This Y is not acceptable.

i4vec_max_last_test():
  i4vec_max_last() identifies the largest element in an
  I4VEC, and moves it to the final entry.

  Input vector:

     0      16
     1       1
     2       3
     3      30
     4      12
     5       8
     6      26
     7       2
     8      17
     9       3

  Maximum: 30

  Output vector:

     0       1
     1       3
     2      16
     3      12
     4       8
     5      26
     6       2
     7      17
     8       3
     9      30

i4vec_print_test():
  i4vec_print() prints an I4VEC.

  Here is an I4VEC:

     0      91
     1      92
     2      93
     3      94

partial_digest_recur_test01():
  partial_digest_recur() generates solutions to the partial
  digest problem, using recursion.

  The number of objects to place is N = 5

  The original placement was 0,3,6,8,10.
  These placements generate the following distances:

  Distance array:

     0       2
     1       2
     2       3
     3       3
     4       4
     5       5
     6       6
     7       7
     8       8
     9      10

  partial_digest_recur() may recover the original placements
  from the pairwise distances.  It may also find other
  placements that have the same distance array.

  Solution:

     0       0
     1      10
     2       8
     3       3
     4       6

  Solution:

     0       0
     1      10
     2       2
     3       7
     4       4

partial_digest_recur_test02():
  partial_digest_recur() generates solutions to the partial
  digest problem, using recursion.
  test_partial_digest() creates test problems for the
  partial digest problem.

  Number of nodes = 6
  Maximum distance = 20

  Locations:

     0       0
     1       2
     2       8
     3       9
     4      12
     5      20

  Distances:

     0       1
     1       2
     2       3
     3       4
     4       6
     5       7
     6       8
     7       8
     8       9
     9      10
    10      11
    11      12
    12      12
    13      18
    14      20

  Solution:

     0       0
     1      20
     2      18
     3      12
     4       8
     5      11

  Solution:

     0       0
     1      20
     2      18
     3       8
     4      12
     5      11

  Solution:

     0       0
     1      20
     2       2
     3      12
     4       8
     5       9

  Solution:

     0       0
     1      20
     2       2
     3       8
     4      12
     5       9

partial_digest_test():
  Normal end of execution.
Wed Oct  8 08:44:49 2025