31:T500,cells = { const cellWidth = width; const cellHeight = height; const heap = new FlatQueue(); 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; }32:[] 2f:{"title":"Prim’s Algorithm V","cells":[{"id":0,"value":"md`# Prim’s Algorithm V\n\nColor-cycling applied to a spanning tree generated by [Prim’s algorithm](/@mbostock/prims-algorithm).\n\n---\nThis fork adds offset-based cycling and some configurable options.\n`","pinned":false,"hidden":false,"mode":"ojs"},{"id":199,"value":"options = ({\n intervals: 3,\n speed: -.05, \n colorBands: 10,\n colorFunc: d3.interpolateSpectral,\n})","pinned":true,"hidden":false,"mode":"ojs"},{"id":14,"value":"canvas = {\n const context = DOM.context2d(width, height, 1);\n const image = context.createImageData(width, height);\n const pixels = new Uint32Array(image.data.buffer);\n const len = colors.length;\n const dmax = distance.reduce((max, v) => v > max ? v : max, 0);\n const ds = len * options.intervals / dmax;\n const mod = (v, n) => ((v % n) + n) % n;\n \n while (true) {\n const o = options.speed * ds * Date.now();\n for (let i = 0; i < n; ++i) pixels[i] = colors[mod(Math.round(distance[i] * ds + o), len)];\n context.putImageData(image, 0, 0);\n yield context.canvas;\n }\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":36,"value":"colors = new Uint32Array(new Uint8ClampedArray(\n Array(options.colorBands).fill()\n .map((_, i, a) => d3.color(options.colorFunc(i/a.length)))\n .flatMap(c => [c.r, c.g, c.b, 255])\n).buffer)","pinned":true,"hidden":false,"mode":"ojs"},{"id":26,"value":"distance = {\n const distance = new Array(n);\n let frontier = [(height - 1) * width];\n distance[frontier[0]] = 0;\n for (let d = 0; frontier.length; ++d) {\n let frontier1 = [];\n for (let i = 0, n0 = frontier.length; i < n0; ++i) {\n let i0 = frontier[i], i1;\n if (cells[i0] & E && distance[i1 = i0 + 1] === undefined) distance[i1] = d, frontier1.push(i1);\n if (cells[i0] & W && distance[i1 = i0 - 1] === undefined) distance[i1] = d, frontier1.push(i1);\n if (cells[i0] & S && distance[i1 = i0 + width] === undefined) distance[i1] = d, frontier1.push(i1);\n if (cells[i0] & N && distance[i1 = i0 - width] === undefined) distance[i1] = d, frontier1.push(i1);\n }\n frontier = frontier1;\n }\n return distance;\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":63,"value":"$31","pinned":true,"hidden":false,"mode":"ojs"},{"id":15,"value":"N = 1 << 0","pinned":true,"hidden":false,"mode":"ojs"},{"id":20,"value":"S = 1 << 1","pinned":true,"hidden":false,"mode":"ojs"},{"id":19,"value":"W = 1 << 2","pinned":true,"hidden":false,"mode":"ojs"},{"id":18,"value":"E = 1 << 3","pinned":true,"hidden":false,"mode":"ojs"},{"id":22,"value":"n = width * height","pinned":true,"hidden":false,"mode":"ojs"},{"id":8,"value":"height = 600","pinned":true,"hidden":false,"mode":"ojs"},{"id":65,"value":"FlatQueue = require(\"flatqueue@1\")","pinned":true,"hidden":false,"mode":"ojs"},{"id":39,"value":"d3 = require(\"d3-color@1\", \"d3-scale-chromatic@1\")","pinned":true,"hidden":false,"mode":"ojs"}],"files":"$W32","stdlib":"1","titling":"auto"}