Home License -- for personal use only.  Not for government,
	academic, research, commercial, or other organizational use.

13-May-2025 16:16:14

partial_digest_test():
  MATLAB/Octave version 9.11.0.2358333 (R2021b) Update 7
  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:      2
     4:     25
     5:     38
     6:     23
     7:     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:

     1:     25
     2:     28
     3:      4
     4:     28
     5:     19
     6:      3
     7:      9
     8:     17
     9:     29
    10:     29

  Maximum: 29

  Output vector:

     1:     25
     2:      4
     3:     28
     4:     19
     5:      3
     6:      9
     7:     17
     8:     28
     9:     29
    10:     29

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

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:      2
     3:      3
     4:     11
     5:     19
     6:     20

  Distances:

     1:      1
     2:      1
     3:      2
     4:      3
     5:      8
     6:      8
     7:      9
     8:      9
     9:     11
    10:     16
    11:     17
    12:     17
    13:     18
    14:     19
    15:     20

  Solution:

     1:      0
     2:     20
     3:     19
     4:      2
     5:      3
     6:     11

  Solution:

     1:      0
     2:     20
     3:      1
     4:     18
     5:     17
     6:      9

partial_digest_test():
  Normal end of execution.

13-May-2025 16:16:14