On Friday, 15 November 2013 at 18:43:12 UTC, H. S. Teoh wrote:
so the edges of the graph may be thought of as a subset of the
edges of an n-dimensional grid.
Could perhaps elaborate on this point?
As far as I can see, the possible values of the nodes are all the
points in N^n (or Z^n, dunno whether you have negatives) and the
edges are all in the set of i*e_j for i in Z and j in N, where
e_j is the unit vector along one axis, i.e. the edges are the
euclidean basis vectors and their negatives.
How is this the same as the edges of an n-dimensional grid?
