Tue May 20 22:21:56 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      21
     1       7
     2       2
     3      14
     4      16
     5      26
     6      22
     7      19
     8      29
     9      23

  Maximum: 29

  Output vector:

     0       7
     1       2
     2      14
     3      16
     4      21
     5      22
     6      19
     7      26
     8      23
     9      29

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       3
     3      13
     4      14
     5      20

  Distances:

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

  Solution:

     0       0
     1      20
     2      18
     3      17
     4       6
     5       7

  Solution:

     0       0
     1      20
     2       2
     3       3
     4      14
     5      13

partial_digest_test():
  Normal end of execution.
Tue May 20 22:21:57 2025