function e = edge_tiny ( )

%*****************************************************************************80
%
%% edge_tiny() describes the tiny polyiamond using anedge list.
%
%  Discussion:
%
%    The tiny polyiamond looks like this:
%
%  ^       2 *-------*-------*-------*
%  |        / \     / \     / \     /
%  J       /   \   /   \   /   \   /
%         /  C  \ /     \ /     \ /
%      1 *-------*-------*-------*
%       / \     / \     / \     /
%      /   \ A / B \   /   \   /
%     /     \ /     \ /     \ /
%  0 *-------*-------*-------*
%    0       1       2       3 
%
%                I -->
%
%    The edge nodes are:
%
%  ^        0,2------*-------*-------*
%  |        / \     / \     / \     /
%  J       /   \   /   \   /   \   /
%         /     \ /     \ /     \ /
%       0,1-----1,1------*-------*
%       / \     / \     / \     /
%      /   \   /   \   /   \   /
%     /     \ /     \ /     \ /
%    *------1,0-----2,0-------*
%
%    This polyiamond has a boundary which is traced by the nodes at 
%    (0,1), (1,0), (2,0), (1,1), (0,2).
%
%    The edge list contains the sequence of parallelogram IJ coordinates
%    of the nodes that lie on the boundary of the polyiamond, listed
%    in counterclockwise order.
%
%  Licensing:
%
%    This code is distributed under the MIT license.
%
%  Modified:
%
%    07 November 2020
%
%  Author:
%
%    John Burkardt
%
%  Output:
%
%    integer E(EN,2): the list of edge nodes.
%
  e = [ ...
    0, 1; ... 
    1, 0; ...
    2, 0; ...
    1, 1; ...
    0, 2 ];

  return
end

