2b:null 2c:["$","title",null,{"children":"Infinite Love Triangles (and other Graph Coloring Experiments) | Jasmine Otto | Observable"}] 31:T517,conditions = (db) => [ // returns [EgocentricGraph => Bool], parallel to `states` // type EgocentricGraph // | vs: list of neighboring node IDs // | u, links: not used // i.e. ["traitor", "enabler", "victim", "bystander", "helper"] rules, in that order (u, vs, links) => !vs.map((v) => db.node(v).state).every((s) => s == "traitor") && // not all of my neighbors are traitors vs.map((v) => db.node(v).state).some((s) => s == "victim"), // adjacent to at least one victim (u, vs, links) => !vs.map((v) => db.node(v).state).every((s) => s == "enabler") && // not all of my neighbors are enablers vs.map((v) => db.node(v).state).some((s) => s == "traitor"), // adjacent to at least one traitor (u, vs, links) => !vs.map((v) => db.node(v).state).every((s) => s == "victim") && // not all of my neighbors are victims vs.map((v) => db.node(v).state).some((s) => s == "traitor"), // adjacent to at least one traitor (u, vs, links) => !vs.map((v) => db.node(v).state).some((s) => s == "bystander"), // none of my neighbors are bystanders (u, vs, links) => !vs.map((v) => db.node(v).state).every((s) => s == "helper") && // not all of my neighbors are helpers vs.map((v) => db.node(v).state).some((s) => s == "victim") // adjacent to at least one victim ]32:T7bc,md`# References Based on my Roguelike Celebration 2023 talk, [Cyclic Plot Generation in a Narrative Instrument](https://www.youtube.com/watch?v=NjIDVIIg1lY&pp=ygUicm9ndWVsaWtlIGNlbGVicmF0aW9uIGphc21pbmUgb3R0bw%3D%3D). c.f. Boris' extensive [documentation of cyclic dungeon generation](https://www.boristhebrave.com/2021/04/10/dungeon-generation-in-unexplored/) in Unexplored (2017); and if you can track it down, see also Joris Dormans' [chapter from Procedural Generation in Game Design](https://www.taylorfrancis.com/chapters/edit/10.1201/9781315156378-11/cyclic-generation-joris-dormans). For a history of WFC and its underlying relationship to "good old fashioned AI" planning and answer-set programming, see Karth & Smith 2017: [WaveFunctionCollapse is constraint solving in the wild](https://pcgworkshop.com/archive/karth2017wavefunctioncollapse.pdf). For the more general notion of **story sifting** as events occur over time, so that splots may be introduced either prospectively or retrospectively, see Kreminski, Dickinson, & Mateas 2021: [Winnow: a domain-specific language for incremental story sifting](https://mkremins.github.io/publications/Winnow_AIIDE2021.pdf). For a recent survey of **constraint-based** game design patterns, including narrative planners and story sifters, see Sandhu & McCoy 2023: [Exploring the Union Between Procedural Narrative and Procedural Content Generation](https://link.springer.com/chapter/10.1007/978-3-031-47658-7_24). For a more complete discussion of script generation through splot linearization, see Treynor & McCoy 2024: [College ruled: a pathfinding approach to generative storytelling](https://dl.acm.org/doi/pdf/10.1145/3649921.3649994). You can play [an experimental idle game](https://l00tkek.github.io/shepherd/) based on this technology, from Deo, Chung & McCoy 2024: [Shepherd: an incremental story sifting-based drama manager](https://ojs.aaai.org/index.php/AIIDE/article/download/31887/34054/35956). `33:T765,wfc = (g, verbose = false) => { // each node has `obs`: [Bool], whether each choice of state is possible let choices = states; let init = choices.map((_) => true); // initialize the graph 'g' with every node in a superposition, with no choices of state ruled out g.nodes().forEach((u) => g.setNode(u, { obs: [...init] })); while (true) { // Collapse state by making arbitrary decisions, starting from a promising node let [min, idx] = g.nodes().reduce( // for each node u... (minSeen, u) => { let el = g.node(u).obs; // get observation state if (!el) return minSeen; // oops let rank = el.filter((b) => b).length; // count possible states return rank < minSeen[0] ? [rank, u] : minSeen; }, [Infinity, null] // accumulates to the node with the smallest number of possible states ); if (idx !== null) { g.setNode(idx, { state: pick(choices, g.node(idx).obs) }); // source of randomness if (verbose) console.log("set node " + idx + " to " + g.node(idx).state); if (g.node(idx).state === undefined) throw new Error("contradiction at node " + idx); // TODO: backtracking } else break; // exit once all nodes have collapsed // Propagate information g.successors(idx).forEach((u) => { let mask = g.node(u).obs; if (!mask) return; // can't propagate to a collapsed node if (verbose) console.log(" updating " + u + " for " + idx); // adjacency rules let update = conditions(g).map((f) => f(u, g.predecessors(u), g.inEdges(u)) ); let res = mask.map((_, i) => mask[i] && update[i]); // let ban = choices.indexOf(g.node(idx)); // mask[ban] = false; // neighbors can't be the same if (verbose) console.log(" " + res); g.node(u).obs = res; // g.setNode(u, {obs: res}); }); } return g; }34:T499,diff = (g, h, frame) => { let res = h.edges().map((goal) => { // annotate each edge with its diff status let candidates = g.edges().filter((match) => match.v == goal.v), candidates_ = g.edges().filter((match) => match.w == goal.v); // discard direction let isMatched = candidates.find((match) => match.w == goal.w) || candidates_.find((match) => match.v == goal.w) || false; // (had g.edges() instead of candidates, for an incomplete tour) // mutable debug = isMatched; let isTrivial = isMatched ? h.edge(isMatched.v, isMatched.w).kind == "knows" : false; // BRITTLE let props = h.edge(goal); // let isChanged = isMatched ? props.kind != g.edge(isMatched).kind : true; // WIP let isInFrame = frame.has(goal.v) && frame.has(goal.w); return { v: goal.v, w: goal.w, isMatched, isTrivial, isInFrame }; }); return { threadsHere: res.filter((sig) => sig.isInFrame), threadsLoose: res.filter( (sig) => !sig.isInFrame && !sig.isMatched && !sig.isTrivial ) }; /* return { gainedNodes: [], lostNodes: [], gainedEdges: [], lostEdges: [], editedNodes: []}; */ }35:Tc3c,step = (state, goal, frame) => { let laundry = diff(state, goal, frame); let result = graphlib.json.read(graphlib.json.write(state)); let thread = null; let resFrame = new Set(frame); if (laundry.threadsHere.length > 0) { thread = pick(laundry.threadsHere.filter((t) => !t.isMatched)); if (thread) { let v = thread.v, w = thread.w; if (!thread.isMatched) { let nextFaction = pick([result.node(v).faction, result.node(w).faction, undefined]) || pick(factionKeys), vFaction = result.node(v).faction || nextFaction, wFaction = result.node(w).faction || nextFaction; result.setNode(v, { faction: vFaction, ...result.node(v) }); result.setNode(w, { faction: wFaction, ...result.node(w) }); let k = goal.edge(v, w).kind; result.setEdge(v, w, { ...goal.edge(v, w), // pass through datum label: gloss[k](v, w) }); // mutable debug = [result.edge(v, w), goal.edge(v, w)]; } thread = result.edge(v, w).label; } } if (!thread && laundry.threadsLoose.length > 0) { thread = pick( laundry.threadsLoose.filter((a) => frame.has(a.v) || frame.has(a.w)) ); if (!thread) // HACK: oops, no threads, let's cheat thread = pick(laundry.threadsLoose); let v = thread.v, w = thread.w; // state generated at runtime is hard to reason about /* if (!thread.isMatched) { let nextFaction = pick(factionKeys), vFaction = result.node(v).faction || nextFaction, wFaction = result.node(w).faction || nextFaction; result.setNode(v, { faction: vFaction, ...result.node(v) }); result.setNode(w, { faction: wFaction, ...result.node(w) }); } */ // change frame let isCut = resFrame.size > 2 ? true : pick([true, false]); if (isCut) resFrame = new Set(); // 50% chance of dropping scene let whoJoins = resFrame.has(w) && resFrame.has(v) ? "" : resFrame.has(w) ? "v" : resFrame.has(v) ? "w" : "vw"; resFrame.add(v); resFrame.add(w); // render scene header let vText = `${nameOf[v]}`; // `the ${result.node(v).faction} ${nameOf[v]}`; let wText = `${nameOf[w]}`; // `the ${result.node(w).faction} ${nameOf[w]}`; thread = isCut ? `${vText} and ${wText} were together. ` : whoJoins == "vw" ? `${vText} and ${wText} joined ${[...resFrame] .filter((x) => x != v) .map((x) => nameOf[x]) .join(" and ")}. ` : whoJoins == "v" ? `${vText} joined ${[...resFrame] .filter((x) => x != v) .map((x) => nameOf[x]) .join(" and ")}. ` : whoJoins == "w" ? `${wText} joined ${[...resFrame] .filter((x) => x != w) .map((x) => nameOf[x]) .join(" and ")}. ` : `${wText} and ${vText} remained.`; // shouldn't happen // thread += [...resFrame]; } // falls through if there are neither threadsHere nor threadsLoose, ending the chapter. return [result, goal, resFrame, thread]; }36:T718,trace = { reroll; // problem: jobs are getting rerolled :( let ret = [initial], // graphs accumulate state init = pick(initial.nodes()), // // start walk from a random log = [`${nameOf[init]} was there, right?`]; let frame = new Set(init); for (let t = 0; t < 30; ++t) { let [res, _, frame_, gloss] = step(ret[0], social, frame); if (gloss) { log.unshift(gloss); frame = frame_; ret.unshift(res); } else { log.unshift( pick([ "I dunno either.", "And that's why everyone is angry now.", "Why are we like this?", "Yep, I think that's about it.", "Seriously? That’s… complicated.", "I’m not sure I follow.", "Well, that's a problem, isn’t it?", "Just... let me think about that for a moment.", "Is that even a question?", "I have no idea what's going on.", "That’s… a lot to process.", "Maybe we should just drop it?", "Ugh, this is awkward.", "I think I need a break.", "So… that’s the situation?", "I’m honestly bewildered.", "Don’t look at me, okay?", "I just... don’t get it.", "What’s going on with you?", "I want to know what you’ve been up to?", "What’s been happening with you?", "Uh, tell me your news.", "What’s new with you?", "Let’s hear yours.", "Alright, your turn.", "What's been occupying your time?", "And you?", "Okay, that should be everything. What's been happening on your side?", "What’s been going on with you?" ]) ); ret.unshift(); break; } } return { log, graphs: ret }; }37:T42d,givenNames = `Louise Mette Maria Camilla Christina Anne Line Pernille Stine Sara Karina Katrine Marie Rikke Julie Trine Tina Charlotte Ditte Helle Signe Heidi Malene Mia Janni Martin Kasper Morten Thomas Michael Jesper Anders Rasmus Jacob Soren Daniel Peter Dennis Kenneth Jonas Lasse Henrik Kim Lars Simon Brian Andreas Emma Alma Clara Freja Sofia Karla Agnes Ella Olivia Anna Nora Alberte Ida Luna Josefine Asta Ellie Laura Isabella Lily Frida Aya Astrid Ellen Mathilde Laerke Maja Esther Liva Sofie Marie Mille Victoria Emily Saga Andrea Molly Liv Emilie Vilma Alba Lea Leonora Merle Mynte Rosa Sara Eva Hannah Gry William Alfred Oscar Noah Karl Lucas Oliver Arthur August Malthe Valdemar Emil Victor Aksel Elias Magnus Viggo Anton Felix Frederik Nohr Alexander Theo Elliot Otto Lauge Hugo Liam Villads Theodor Loui Milas Anker Albert Johan Storm Adam Mikkel Christian Matheo Konrad Pelle Villum Benjamin Erik Asger Mads Walter Marius Mathias`.split( " " ) // union(2019, 1985) from https://www.dst.dk/en/Statistik/emner/befolkning-og-valg/navne/navne-til-nyfoedte38:[] 2f:{"id":"2af39b1aa90a199a","slug":"infinite-love-triangles","title":"Infinite Love Triangles (and other Graph Coloring Experiments)","thumbnail":"49e3b8e7b5c25c76853ac31b4ed41e895e2facb91573182f4e68e995d0ccb899","access_level":"public","create_time":"$D2021-07-19T15:28:26.709Z","update_time":"$D2025-09-05T19:12:40.393Z","view_time":null,"first_public_time":"$D2025-09-05T01:18:22.999Z","fork":{"id":"c35890b7ce6b312b","slug":"social-state-initializer","title":"social state initializer","owner":{"id":"43e035ce64fad801","login":"jazztap","name":"Jasmine Otto"}},"stars":1,"starred":false,"owner":{"type":"team","id":"43e035ce64fad801","login":"jazztap","name":"Jasmine Otto","avatar_url":"https://avatars-next.observableusercontent.com/1d847b962089e3524d821a011682b5ec09925cb269ab3f15456fb6e38e574bcc","tier":"starter_2024"},"version":2264,"publish_version":null,"role":null,"authored":false,"authors":[{"type":"individual","id":"91a3f7bf83a60ddd","login":"jazztap","name":"Jasmine Otto","avatar_url":"https://avatars-next.observableusercontent.com/1d847b962089e3524d821a011682b5ec09925cb269ab3f15456fb6e38e574bcc","tier":null}],"members":[{"type":"individual","id":"91a3f7bf83a60ddd","login":"jazztap","name":"Jasmine Otto","avatar_url":"https://avatars-next.observableusercontent.com/1d847b962089e3524d821a011682b5ec09925cb269ab3f15456fb6e38e574bcc","tier":null,"role":"editor"},{"type":"team","id":"43e035ce64fad801","login":"jazztap","name":"Jasmine Otto","avatar_url":"https://avatars-next.observableusercontent.com/1d847b962089e3524d821a011682b5ec09925cb269ab3f15456fb6e38e574bcc","tier":"starter_2024","role":"viewer"}],"comments":[],"custom_thumbnail":false,"trashed":false,"subscribed":null,"forks":1,"collection":{"id":"fa0ea72c692c6c26","slug":"druid-game","title":"druid game prototypes","owner":{"id":"43e035ce64fad801","login":"jazztap","name":"Jasmine Otto"}},"type":"notebook","body":{"title":"Infinite Love Triangles (and other Graph Coloring Experiments)","cells":[{"id":0,"value":"md`# Infinite Love Triangles (and other Graph Coloring Experiments)\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":2110,"value":"md`Wave Function Collapse (WFC) is an algorithm for constraint propagation on adjacency graphs. Game designers use it to procedurally generate interesting levels for players to traverse. Let's use it to generate toxic relationships instead.`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":321,"value":"states = ['traitor', 'enabler', 'victim', 'bystander', 'helper']","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1070,"value":"{\n // swatches\n let ret = d3.select(html``);\n let colors = states.map((u, i) => colormap(i / states.length));\n\n ret\n .selectAll('rect')\n .data(colors)\n .join('rect')\n .attr('x', (d, i) => i * 60)\n .attr('y', 0)\n .attr('width', 50)\n .attr('height', 50)\n .style('fill', d => d);\n\n return ret.node();\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1859,"value":"md`Now we have a bunch of interesting relationship roles that might get thrown around when heartbreak happens. Red is for traitors, orange is for their enablers, and yellow is for people who got hurt. (Green doesn't care, and teal tries to help.)`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1866,"value":"md`Use these buttons to assign new roles to people at random, while respecting the constraints of each role (e.g. a betrayer must have someone to betray). Since the graph is still the same, let's call each assignment a **splot**.\n\nIf the graph is hard to read, type a character's name into the text field to zoom in.`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1773,"value":"html`${viewof reshape} ${viewof perturb} ${viewof reroll}`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1294,"value":"viewof focus = html``","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":2234,"value":"$${local} ${[...trace.log].reverse().join(' \\n')}","pinned":false,"hidden":false,"mode":"html","author":"$undefined","summary":"$undefined"},{"id":87,"value":"local = {\n let ret = html``;\n yield ret; // renderer fails if the node isn't attached to page\n\n if (focus !== \"\") {\n let close = social\n .nodes()\n .filter((u) => nameOf[u].toLowerCase().includes(focus.toLowerCase()));\n let res = new Set(close);\n close.forEach((v) => {\n social.predecessors(v).forEach((u) => res.add(u));\n // predecessors(social, focus, 1).forEach(u => close.add(u));\n // predecessors(social, focus, 2).forEach(u => close.add(u));\n social.successors(v).forEach((u) => res.add(u));\n });\n\n render(\n ret,\n filter(social, (u) => res.has(u))\n );\n } else {\n render(ret, social);\n }\n return ret;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1906,"value":"md`\\`conditions\\` has the constraints which WFC tries to satisfy for each of these roles. \nTry commenting some of them out and see what happens.`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":2201,"value":"states","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1044,"value":"$31","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1876,"value":"$32","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":561,"value":"// stylesheet for user-defined states\nhtml``","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1686,"value":"viewof reshape = html``","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":743,"value":"viewof perturb = {\n let ret = html``;\n /* ret.onclick = () => {\n let target = mutable focus;\n\n social.setNode(target, {\n // change the state of the focus at random\n state: pick(states.filter(s => s != social.node(target).state))\n });\n mutable active = [...mutable active, ...social.neighbors(target), target]; // flag it\n }; */\n return ret;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1678,"value":"viewof reroll = html``","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":96,"value":"$33","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1270,"value":"initial = {\n let st = graphlib.json.read(graphlib.json.write(social)); // deep copy of splotted graph\n st.edges().forEach(e => st.removeEdge(e));\n return st;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1282,"value":"$34","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1602,"value":"graphlib.json.write(social)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1691,"value":"graphlib.json.write(trace.graphs[1])","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1334,"value":"$35","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1624,"value":"gloss = ({\n \"abetted-by\": (v, w) => `${nameOf[v]} was enabled by ${nameOf[w]}.`,\n \"betrayed-them\": (v, w) => `${nameOf[v]} hurt ${nameOf[w]}.`,\n \"abetted-them\": (v, w) => `${nameOf[v]} enabled ${nameOf[w]}.`,\n \"conspired-with\": (v, w) => `${nameOf[v]} helped ${nameOf[w]}.`,\n \"sided-against\": (v, w) => `${nameOf[v]} checked ${nameOf[w]}.`,\n \"conspired-against\": (v, w) => `${nameOf[v]} didn't help ${nameOf[w]}.`,\n \"betrayed-by\": (v, w) => `${nameOf[v]} was hurt by ${nameOf[w]}.`,\n \"protected-by\": (v, w) => `${nameOf[v]} was helped by ${nameOf[w]}.`,\n \"protected-them\": (v, w) => `${nameOf[v]} protected ${nameOf[w]}.`,\n \"defended-against\": (v, w) => `${nameOf[v]} censured ${nameOf[w]}.`,\n knows: (v, w) => `` // `${v} saw ${w}.`\n})","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":2253,"value":"abettedTable = [\n // WIP\n \"I can't believe X covered for Y.\",\n \"X helped Y? Unbelievable.\",\n \"Seriously, X shielded Y?\",\n \"X backing Y? Outrageous!\",\n \"I can’t believe X aided Y.\",\n \"X protected Y? That’s shocking.\",\n \"X helped Y get away with it.\",\n \"Unbelievable, X shielded Y.\",\n \"X covered for Y – it’s insane.\",\n \"I can’t fathom X assisting Y.\",\n \"X’s support for Y is appalling.\",\n \"That’s a betrayal – X helping Y.\",\n \"X shielded Y. I’m stunned.\",\n \"X backed Y. Absolutely wrong.\",\n \"Unbelievable X aided Y’s escape.\"\n]","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1392,"value":"trace.graphs[0].edges()","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1276,"value":"$36","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1098,"value":"colormap = t => d3.interpolateSpectral(.1 + t * .9)","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1943,"value":"// TODO: pick without replacement\nnameOf = Object.fromEntries(\n shape.nodes().reduce(\n ([acc, pool], u) => {\n let choice = pick(pool);\n acc.push([u, choice]);\n return [acc, pool.filter((s) => s != choice)];\n },\n [[], givenNames]\n )[0]\n)","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1940,"value":"$37","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1512,"value":"factionKeys = [\"alchemist\", \"cleric\", \"scholar\", \"mystic\", \"outlaw\"]","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1495,"value":"// VERIFY: this isn't very interesting for 4-ary splots\nfocus ? [triples(focus), wedges(focus)] : []","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1146,"value":"// find triangles, ignoring directionality\ntriples = (u) => {\n let g = social;\n return g\n .predecessors(u)\n .map((v) => {\n // v -> u, v -> w, w -> u\n let a = g.successors(v).filter((w) => g.successors(w).includes(u));\n // v -> u -> w, v -> w\n let b = g.successors(v).filter((w) => g.successors(u).includes(w));\n return [v, [...a, ...b]]; // return pairs [v,[...ws]]\n })\n .reduce((arr, u) => {\n // splat to pairs [v,w]\n return u[1] ? [...arr, ...u[1].map((v) => [u[0], v])] : arr;\n }, []);\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1154,"value":"wedges = (u) => {\n let g = social;\n return g\n .predecessors(u)\n .map((v) => {\n let ws = g.neighbors(v);\n return [v, ws.filter((w) => w != u)];\n })\n .reduce(\n (arr, u) => (u[1] ? [...arr, ...u[1].map((v) => [u[0], v])] : arr),\n []\n );\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":841,"value":"filter = (g, f) => {\n let ret = graphlib.json.read(graphlib.json.write(g));\n g.nodes().forEach(u => {\n if (!f(u)) ret.removeNode(u);\n });\n return ret;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":464,"value":"render = (svg, db) => {\n let sel = d3.select(svg);\n sel.append(\"g\").call(new dagred3.render(), db);\n sel.attr(\"viewBox\", `0, 0, ${db.graph().width}, ${db.graph().height}`);\n // .attr(\"height\", db.graph().height + 20);\n\n // bind style hook\n let ids = db.nodes(),\n d = (i) => db.node(ids[i]);\n sel.selectAll(\".node\").attr(\"class\", (_, i) => d(i).state + \" node\");\n\n return sel;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1609,"value":"eventsMatrix = {\n let ret = {\n traitor: { enabler: \"abetted-by\", victim: \"betrayed-them\" },\n enabler: {\n traitor: \"abetted-them\",\n enabler: \"conspired-with\",\n helper: \"sided-against\",\n victim: \"conspired-against\"\n },\n victim: {\n traitor: \"betrayed-by\",\n helper: \"protected-by\"\n },\n bystander: {},\n helper: {\n victim: \"protected-them\",\n helper: \"conspired-with\",\n enabler: \"sided-against\",\n traitor: \"defended-against\"\n }\n };\n /* for (let i in ret) {\n for (let j in ret[i]) {\n // make an event tag from each label\n ret[i][j] = [\"event\", ret[i][j]];\n }\n } */\n return ret;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":590,"value":"social = {\n perturb; // reroll button\n\n let ret = undefined;\n for (let take = 0; take < 500; ++take) {\n try {\n ret = wfc(shape, false);\n } catch {\n // swallow a finite number of wfc failures\n } finally {\n if (ret) break;\n }\n }\n if (!ret)\n throw Error(\"wfc failed too many times, please try splot generation again\");\n\n ret.nodes().forEach((u) => {\n ret.node(u).label = nameOf[u];\n });\n ret.edges().forEach(({ v, w }) => {\n ret.edge(v, w).kind =\n eventsMatrix[ret.node(v).state][ret.node(w).state] || \"knows\";\n });\n return ret;\n}\n// shape.setNode(\"D\", null); // to test resolution","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":94,"value":"shape = {\n reshape;\n\n const g = new graphlib.Graph();\n g.setGraph({});\n let link = (u, v) => {\n g.setEdge(u, v, {}); // {kind: 'knows'}\n g.setEdge(v, u, {});\n };\n\n // make sure everyone has at least one relationship, and the entire graph is connected\n [...\"ABCDEF\"].forEach((u, i, arr) => {\n g.setNode(u);\n let rando = pick(arr.slice(0, i || 1)); // pick someone we already saw\n if (u != rando) link(u, rando);\n\n // also, pick a number of additional people (redundancy possible)\n if (Math.random() < 0.3) link(u, pick(arr.filter((v) => v != u)));\n if (Math.random() < 0.1) link(u, pick(arr.filter((v) => v != u)));\n });\n\n g.graph().rankDir = \"UD\"; // 'LR'\n return g;\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":1420,"value":"/* {\n let next = step(initial, social, new Set(['A', 'D']));\n return diff(next[0], social, new Set(['A', 'E']));\n} */\n\n/* states = ['fine', 'stressed', 'upset']\nconditions = db => [\n // edit me - these are simple, 'I can't match any neighbor' conditions\n (reactor, kith, links) =>\n !kith.map(v => db.node(v).state).some(s => s == 'upset'),\n (reactor, kith, links) =>\n !kith.map(v => db.node(v).state).some(s => s == 'stressed'),\n (reactor, kith, links) =>\n !kith.map(v => db.node(v).state).some(s => s == 'stressed')\n] \n.fine rect { fill: #aaaaaa; }\n.stressed rect { fill: #aa8888; }\n.upset rect { fill: #aa5555; }*/","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":528,"value":"md`#### dependencies`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":110,"value":"pick = (choices, mask = choices.map(_ => true)) => {\n let res = choices.filter((_, i) => mask[i]);\n return res[Math.floor(Math.random() * res.length)];\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":77,"value":"d3 = require('d3@v5')","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":2,"value":"// https://observablehq.com/@hastebrot/hello-graphlib\ngraphlib = require('https://dagrejs.github.io/project/graphlib/v2.1.2/graphlib.min.js')","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":80,"value":"import { dagred3 } from \"@mbostock/hello-dagre\"","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":450,"value":"html // https://observablehq.com/@mbostock/hello-dagre\n``","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"}],"files":"$W38","stdlib":"1","titling":"auto"}} 30:"$2f:body"