Maze generation: Difference between revisions

→‎The very alternative version: oops forgot some cell linkage
(→‎{{header|C}}: a very different version)
(→‎The very alternative version: oops forgot some cell linkage)
Line 557:
cell tail = head, p, n;
 
while (head) { /* not quite a depth-first search */
for (p = head; p; p = n) {
p->flags |= 1 << V;
Line 618:
 
for (i = 0; i < sy; i++) {
C(i, 0)->nei[W] = C(sy, w - sy + i);
C(sy, w - sy + i)->nei[N] = C(i, 0);
 
C(i, sx - 1)->nei[E] = C(sy, sx + sy - i - 1);
C(sy, sx + sy - i - 1)->nei[N] = C(i, sx - 1);
Line 623 ⟶ 626:
C(h - sy - 1, sx + i)->nei[S] = C(h - 1 - i, sx + sy);
C(h - 1 - i, sx + sy)->nei[W] = C(h - sy - 1, sx + i);
 
C(sy + sz + i, w - sy - 1)->nei[E] = C(sy + sz - 1, w - sy + i);
C(sy + sz - 1, w - sy + i)->nei[S] = C(sy + sz + i, w - sy - 1);
}
 
Anonymous user