function edge_sort_test ( )

%*****************************************************************************80
%
%% edge_sort_test tests edge_sort().
%
%  Licensing:
%
%    This code is distributed under the MIT license.
%
%  Modified:
%
%    12 November 2020
%
%  Author:
%
%    John Burkardt
%
  fprintf ( 1, '\n' );
  fprintf ( 1, 'edge_sort_test\n' );
  fprintf ( 1, '  edge_sort() sorts the edge list of a polyiamond.\n' );
  fprintf ( 1, '  Since the vertices must stay in counterclockwise order,\n' );
  fprintf ( 1, '  sorting can only rotate the ordering.\n' );

  for k = 1 : 12
    name = name_hexiamond ( k );
    e = edge_hexiamond ( k );
    edge_print ( e, name );
    e2 = edge_sort ( e );
    edge_print ( e2, [ name, ' (sorted)' ] );
  end
%
%  Terminate.
%
  fprintf ( 1, '\n' );
  fprintf ( 1, 'edge_sort_test\n' );
  fprintf ( 1, '  Normal end of execution.\n' );

  return
end
