function partial_digest_recur_test02 ( ) %*****************************************************************************80 % %% PARTIAL_DIGEST_RECUR_TEST02 considers tests from a library. % % Licensing: % % This code is distributed under the GNU LGPL license. % % Modified: % % 10 January 2018 % % Author: % % John Burkardt % timestamp ( ); fprintf ( 1, '\n' ); fprintf ( 1, 'PARTIAL_DIGEST_RECUR_TEST02:\n' ); fprintf ( 1, ' PARTIAL_DIGEST_RECUR generates solutions to the partial\n' ); fprintf ( 1, ' digest problem, using recursion\n' ); fprintf ( 1, ' TEST_PARTIAL_DIGEST creates test problems for the\n' ); fprintf ( 1, ' partial digest problem.\n' ); % % Request a sample problem. % k = 6; dmax = 20; seed = 123456789; fprintf ( 1, '\n' ); fprintf ( 1, ' Number of nodes = %d\n', k ); fprintf ( 1, ' Maximum distance = %d\n', dmax ); [ locate, d, seed ] = test_partial_digest ( k, dmax, seed ); % % Sort the data. % locate = sort ( locate ); d = sort ( d ); % % Print the data. % i4vec_print ( k, locate, ' Locations:' ); i4vec_print ( k * ( k - 1 ) / 2, d, ' Distances:' ); % % Solve the problem. % partial_digest_recur ( k, d ); % % Terminate. % fprintf ( 1, '\n' ); fprintf ( 1, 'PARTIAL_DIGEST_RECUR_TEST02:\n' ); fprintf ( 1, ' Normal end of execution.\n' ); fprintf ( 1, '\n' ); timestamp ( ); return end