31:T46e,canvas = { const fills = new Array(cellWidth * cellHeight); const width = cellWidth * (cellSize + cellSpacing) + cellSpacing; const height = cellHeight * (cellSize + cellSpacing) + cellSpacing; const context = DOM.context2d(width, height); context.canvas.style.imageRendering = "pixelated"; context.fillStyle = "#000"; context.fillRect(0, 0, width, height); context.fillStyle = "#fff"; fillCells(context); for (let n, l = 0, frontier = [0]; n = frontier.length; ++l) { let frontier1 = []; context.fillStyle = sinebow(l / 1000); for (let i = 0, i0, i1; i < n; ++i) { fillCell(context, i0 = frontier[i]); if (cells[i0] & E && !fills[i1 = i0 + 1]) fillEast(context, i0), fills[i1] = frontier1.push(i1); if (cells[i0] & W && !fills[i1 = i0 - 1]) fillEast(context, i1), fills[i1] = frontier1.push(i1); if (cells[i0] & S && !fills[i1 = i0 + cellWidth]) fillSouth(context, i0), fills[i1] = frontier1.push(i1); if (cells[i0] & N && !fills[i1 = i0 - cellWidth]) fillSouth(context, i1), fills[i1] = frontier1.push(i1); } frontier = frontier1; yield context.canvas; } }32:T4e5,function generate(cellWidth, cellHeight) { const heap = new Queue(); const cells = new Uint8Array(cellWidth * cellHeight); let edge; heap.push({index: 0, direction: N}, Math.random()); heap.push({index: 0, direction: E}, Math.random()); while (edge = heap.pop()) { let i0 = edge.index, i1; let d0 = edge.direction, d1; let x0 = i0 % cellWidth, x1; let y0 = i0 / cellWidth | 0, y1; if (d0 === N) i1 = i0 - cellWidth, x1 = x0, y1 = y0 - 1, d1 = S; else if (d0 === S) i1 = i0 + cellWidth, x1 = x0, y1 = y0 + 1, d1 = N; else if (d0 === W) i1 = i0 - 1, x1 = x0 - 1, y1 = y0, d1 = E; else i1 = i0 + 1, x1 = x0 + 1, y1 = y0, d1 = W; if (cells[i1] === 0) { cells[i0] |= d0, cells[i1] |= d1; if (y1 > 0 && cells[i1 - cellWidth] === 0) { heap.push({index: i1, direction: N}, Math.random()); } if (y1 < cellHeight - 1 && cells[i1 + cellWidth] === 0) { heap.push({index: i1, direction: S}, Math.random()); } if (x1 > 0 && cells[i1 - 1] === 0) { heap.push({index: i1, direction: W}, Math.random()); } if (x1 < cellWidth - 1 && cells[i1 + 1] === 0) { heap.push({index: i1, direction: E}, Math.random()); } } } return cells; }33:[] 2f:{"title":"Prim’s Algorithm Flood","cells":[{"id":0,"value":"md`# Prim’s Algorithm Flood\n\nThis maze is generated using Prim’s algorithm and then flooded with color. Hue encodes Manhattan distance from the starting cell. (This is not an optimal visual encoding, but it suffices and is pretty.)`","pinned":false,"hidden":false,"mode":"ojs"},{"id":125,"value":"viewof replay = html`