function value = graph_adj_is_nodewise_connected_walks ( A )

%*****************************************************************************80
%
%% graph_adj_is_nodewise_connected_walks() determines if a graph is nodewise connected.
%
%  Discussion:
%
%    The function computes W(I,J), the number of walks from any node i 
%    to any node j.
%
%    If any W(I,J) is zero, the graph is not nodewise connected.
%
%  Licensing:
%
%    This code is distributed under the MIT license.
%
%  Modified:
%
%    30 August 2022
%
%  Author:
%
%    John Burkardt
%
  value = matrix_is_adjacency ( A );

  if ( ~ value )
    fprintf ( 1, '\n' );
    fprintf ( 1, 'graph_adj_is_nodewise_connected_walks(): Fatal error!\n' );
    fprintf ( 1, '  The input is not a legal adjacency matrix.\n' );  
    error ( 'graph_adj_is_nodewise_connected_walks(): Fatal error!\n' );
  end
%
%  Compute the walks.
%
  W = graph_adj_walks ( A );
  z = find ( W == 0 );
  value = ( 0 == length ( z ) );

  return
end

