*****  To join INSNA, visit http://www.insna.org  *****

The simplest representation uses a square grid, with additional diagonal
edges one way across each square.  Thus for instance you could use a
two-dimensional array in which element (i,j) is a neighbor of:

   (i+1,j)
   (i-1,j)
   (i,j+1)
   (i,j-1)
   (i+1,j+1)
   (i-1,j-1)

This gives the topology of a triangular lattice.

If you prefer to use a one-dimensional array, there is also a simple
one-dimensional representation using helical boundary conditions.

Mark



On 11/05/2009 11:19 AM, Moses Boudourides wrote:
>
> Say we have a triangular grid (tiling) formed by nxm vertices (i.e., a
> graph in which all internal vertices have degree 6). What I want to
> obtain is the structure of the matrix (or list) representation of its
> edges. Of course, this depends on the enumeration of vertices. Thus,
> the question is what re-ordering gives the simplest general form of
> such a matrix (or list) and what is exactly this form?

_____________________________________________________________________
SOCNET is a service of INSNA, the professional association for social
network researchers (http://www.insna.org). To unsubscribe, send
an email message to [log in to unmask] containing the line
UNSUBSCRIBE SOCNET in the body of the message.