function graph_adj_walks_test ( )

%*****************************************************************************80
%
%% graph_adj_walks_test() tests graph_adj_walks().
%
%  Licensing:
%
%    This code is distributed under the MIT license.
%
%  Modified:
%
%    30 August 2022
%
%  Author:
%
%    John Burkardt
%
  A = [ ...
    0, 1, 0, 1, 0, 0, 0, 0, 0; ...
    1, 0, 0, 0, 0, 0, 0, 0, 0; ...
    0, 0, 0, 0, 0, 1, 0, 0, 1; ...
    1, 0, 0, 0, 1, 0, 1, 0, 0; ...
    0, 0, 0, 1, 0, 0, 0, 1, 0; ...
    0, 0, 1, 0, 0, 0, 0, 0, 1; ...
    0, 0, 0, 1, 0, 0, 0, 1, 0; ...
    0, 0, 0, 0, 1, 0, 1, 0, 0; ...
    0, 0, 1, 0, 0, 1, 0, 0, 0 ];

  B = [ ...
    0, 1, 0, 1, 0, 0, 0, 0, 0; ...
    1, 0, 0, 0, 0, 0, 0, 0, 0; ...
    0, 0, 0, 0, 0, 0, 0, 0, 1; ...
    1, 0, 0, 0, 1, 0, 1, 0, 0; ...
    0, 0, 0, 1, 0, 1, 0, 1, 0; ...
    0, 0, 0, 0, 1, 0, 0, 0, 1; ...
    0, 0, 0, 1, 0, 0, 0, 1, 0; ...
    0, 0, 0, 0, 1, 0, 1, 0, 0; ...
    0, 0, 1, 0, 0, 1, 0, 0, 0 ];

  fprintf ( 1, '\n' );
  fprintf ( 1, 'graph_adj_walks_test( ):\n' );
  fprintf ( 1, '  Count the walks from node I to node J of any length.\n' );

  WA = graph_adj_walks ( A );

  fprintf ( 1, '\n' );
  fprintf ( 1, '  Walks for graph A:\n' );
  disp ( WA );

  WB = graph_adj_walks ( B );

  fprintf ( 1, '\n' );
  fprintf ( 1, '  Walks for graph B:\n' );
  disp ( WB );

  return
end

