function rectangle_node_count_test ( )

%*****************************************************************************80
%
%% rectangle_node_count_test() tests rectangle_node_count ( ).
%
%  Licensing:
%
%    This code is distributed under the MIT license.
%
%  Modified:
%
%    21 January 2021
%
%  Author:
%
%    John Burkardt
%
  fprintf ( 1, '\n' );
  fprintf ( 1, 'rectangle_node_count_test():\n' );
  fprintf ( 1, '  rectangle_node_count() computes the number of nodes\n' );
  fprintf ( 1, '  of a rectangle grid.\n' );

  fprintf ( 1, '\n' );
  fprintf ( 1, '  U1 = prediction from rectangle_node_count()\n' );
  fprintf ( 1, '  U2 = count of generated nodes.\n' );
  fprintf ( 1, '\n' );
  fprintf ( 1, '  NX  NY   U1   U2\n' );
  fprintf ( 1, '\n' );

  nx = 4;
  ny = 4;
  nu1 = rectangle_node_count ( nx, ny );
  u_ij = rectangle_node_ij ( nx, ny );
  nu2 = size ( u_ij, 1 );
  fprintf ( 1, '  %2d  %2d  %3d  %3d\n', nx, ny, nu1, nu2 );

  nx = 4;
  ny = 5;
  nu1 = rectangle_node_count ( nx, ny );
  u_ij = rectangle_node_ij ( nx, ny );
  nu2 = size ( u_ij, 1 );
  fprintf ( 1, '  %2d  %2d  %3d  %3d\n', nx, ny, nu1, nu2 );

  nx = 5;
  ny = 5;
  nu1 = rectangle_node_count ( nx, ny );
  u_ij = rectangle_node_ij ( nx, ny );
  nu2 = size ( u_ij, 1 );
  fprintf ( 1, '  %2d  %2d  %3d  %3d\n', nx, ny, nu1, nu2 );

  nx = 5;
  ny = 4;
  nu1 = rectangle_node_count ( nx, ny );
  u_ij = rectangle_node_ij ( nx, ny );
  nu2 = size ( u_ij, 1 );
  fprintf ( 1, '  %2d  %2d  %3d  %3d\n', nx, ny, nu1, nu2 );

  nx = 10;
  ny = 10;
  nu1 = rectangle_node_count ( nx, ny );
  u_ij = rectangle_node_ij ( nx, ny );
  nu2 = size ( u_ij, 1 );
  fprintf ( 1, '  %2d  %2d  %3d  %3d\n', nx, ny, nu1, nu2 );

  fprintf ( 1, '\n' );
  fprintf ( 1, 'rectangle_node_count_test():\n' );
  fprintf ( 1, '  Normal end of execution.\n' );

  return
end

