function A = digraph_adj_example_cycler ( )

%*****************************************************************************80
%
%% digraph_adj_example_cycler() returns the adjacency matrix for a 9-node example.
%
%  Diagram:
%  
%           A
%           V
%    9--><--7---<--3--><---4
%    |            /|      /
%    V           A |     /
%    |          /  |    /
%    5----<----1   V   A
%    |        /    |  /
%    V       A     | /
%    |      /      |/
%    2-->---8---<--6
%     \------>----/
%
%  Licensing:
%
%    This code is distributed under the MIT license.
%
%  Modified:
%
%    01 March 2020
%
%  Author:
%
%    John Burkardt
%
%  Output:
%
%    integer A(9,9), the adjacency matrix.
%
  node_num = 9;

  A = zeros ( node_num, node_num );

  A(1,3) = 1;
  A(1,5) = 1;

  A(2,6) = 1;
  A(2,8) = 1;

  A(3,4) = 1;
  A(3,6) = 1;
  A(3,7) = 1;

  A(4,3) = 1;

  A(5,2) = 1;

  A(6,4) = 1;
  A(6,8) = 1;

  A(7,7) = 1;
  A(7,9) = 1;

  A(8,1) = 1;

  A(9,5) = 1;
  A(9,7) = 1;

  return
end
