9 May 2025   9:26:10.382 PM
 
partial_digest_test():
  FORTRAN90 version
  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:
 
         1            13
         2            15
         3            38
         4            90
         5             2
         6            25
         7            77
         8            23
         9            75
        10            52

  Consider Y =   77

  This Y is acceptable
 
  New X array:
 
         1             0
         2            90
         3            77
 
  New L array:
 
         1            52
         2            15
         3            38
         4             2
         5            25
         6            23
         7            75

  Consider Y =   35

  This Y is not acceptable
 
i4_uniform_ab_test():
  i4_uniform_ab() computes pseudorandom values 
  in an interval [A,B].
 
  The lower endpoint A =         -100
  The upper endpoint B =          200
 
         1        83
         2       143
         3        71
         4       -80
         5       -64
         6       -99
         7       118
         8       -32
         9        99
        10        23
        11       122
        12        98
        13       198
        14       158
        15        33
        16       -65
        17        85
        18        40
        19        87
        20        83
 
I4VEC_MAX_LAST_TEST():
  I4VEC_MAX_LAST() identifies the largest element in an
  I4VEC, and moves it to the final entry.
 
  Input vector:
 
         1            18
         2             7
         3             2
         4            12
         5             4
         6            30
         7            27
         8             7
         9             3
        10            22
 
  Maximum:                        30
 
  Output vector:
 
         1            18
         2             7
         3             2
         4            12
         5             4
         6            27
         7             7
         8             3
         9            22
        10            30
 
I4VEC_PRINT_TEST
  I4VEC_PRINT prints an I4VEC
 
  The I4VEC:
 
         1            91
         2            92
         3            93
         4            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:
 
         1             2
         2             2
         3             3
         4             3
         5             4
         6             5
         7             6
         8             7
         9             8
        10            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:
 
         1             0
         2            10
         3             8
         4             3
         5             6
 
  Solution:
 
         1             0
         2            10
         3             2
         4             7
         5             4
 9 May 2025   9:26:10.382 PM

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:
 
         1             0
         2             6
         3             9
         4            15
         5            19
         6            20
 
  Distances:
 
         1             1
         2             3
         3             4
         4             5
         5             6
         6             6
         7             9
         8             9
         9            10
        10            11
        11            13
        12            14
        13            15
        14            19
        15            20
 
  Solution:
 
         1             0
         2            20
         3            19
         4            15
         5             6
         6             9
 
  Solution:
 
         1             0
         2            20
         3             1
         4             5
         5            14
         6            11

PARTIAL_DIGEST_RECUR_TEST02:
  Normal end of execution.

 9 May 2025   9:26:10.382 PM
 
PARTIAL_DIGEST_TEST:
  Normal end of execution.
 
 9 May 2025   9:26:10.382 PM