function test_graph_arc_test ( )

%*****************************************************************************80
%
%% test_graph_arc_test() tests test_graph_arc().
%
%  Licensing:
%
%    This code is distributed under the MIT license. 
%
%  Modified:
%
%    23 April 2026
%
%  Author:
%
%    John Burkardt
%
  addpath ( '../test_graph_arc' );

  timestamp ( );
  fprintf ( 1, '\n' );
  fprintf ( 1, 'test_graph_arc_test():\n' );
  fprintf ( 1, '  MATLAB/Octave version %s\n', version ( ) );
  fprintf ( 1, '  Test test_graph_arc().\n' );

  graph_arc_diamond_test ( );
  graph_arc_knight_test ( );
%
%  Terminate.
%
  fprintf ( 1, '\n' );
  fprintf ( 1, 'test_graph_arc_test():\n' );
  fprintf ( 1, '  Normal end of execution.\n' );
  timestamp ( );

  rmpath ( '../test_graph_arc' );

  return
end
function graph_arc_diamond_test ( )

%*****************************************************************************80
%
%% graph_arc_diamond_test() tests graph_arc_diamond().
%
%  Licensing:
%
%    This code is distributed under the MIT license.
%
%  Modified:
%
%    24 April 2026
%
%  Author:
%
%    John Burkardt
%
  fprintf ( 1, '\n' );
  fprintf ( 1, 'graph_arc_diamond_test():\n' );
  fprintf ( 1, '  Test graph_arc_diamond()\n' );

  L = graph_arc_diamond ( );

  arc_num = size ( L, 1 );
  node_num = max ( max ( L ) );

  fprintf ( 1, '\n' );
  fprintf ( 1, '  Number of nodes = %d\n', node_num );
  fprintf ( 1, '  Number of edges = %d\n', arc_num );

  fprintf ( 1, '\n' );
  fprintf ( 1, '  "diamond" arc list L:\n' );
  disp ( L );

  return
end
function graph_arc_knight_test ( )

%*****************************************************************************80
%
%% graph_arc_knight_test() tests graph_arc_knight().
%
%  Licensing:
%
%    This code is distributed under the MIT license.
%
%  Modified:
%
%    23 April 2026
%
%  Author:
%
%    John Burkardt
%
  fprintf ( 1, '\n' );
  fprintf ( 1, 'graph_arc_knight_test():\n' );
  fprintf ( 1, '  Test graph_arc_knight()\n' );

  m = 4;
  n = 5;
  L = graph_arc_knight ( m, n );

  arc_num = size ( L, 1 );
  node_num = max ( max ( L ) );

  fprintf ( 1, '\n' );
  fprintf ( 1, '  Number of nodes = %d\n', node_num );
  fprintf ( 1, '  Number of edges = %d\n', arc_num );

  fprintf ( 1, '\n' );
  fprintf ( 1, '  "knight" arc list L:\n' );
  disp ( L );

  return
end
function timestamp ( )

%*****************************************************************************80
%
%% timestamp() prints the YMDHMS date as a timestamp.
%
%  Licensing:
%
%    This code is distributed under the MIT license.
%
%  Modified:
%
%    14 November 2022
%
%  Author:
%
%    John Burkardt
%
  t = now ( );
  c = datevec ( t );
  s = datestr ( c, 0 );
  fprintf ( 1, '%s\n', s );

  return
end

