universal-physics-tensor 10.0.0 → 12.0.0

package/dist/composition/graph-structure.d.ts

@@ -0,0 +1,98 @@
+/**
+ * Map structure from graph algorithms, over the QUANTITY graph of a composition graph.
+ *
+ * The quantity graph has one node per canonical quantity name (`quantityCanonicalizer`). Two
+ * quantities are linked, undirected, when they occur in one equation together (sources and
+ * target), weighted by how many equations hold both. A directed arc runs from each source
+ * quantity to its equation's target. Three readings of it, each stated for what it is:
+ *
+ *   - {@link communitiesOf} — LAYOUT communities of the largest component (MathTS
+ *     `louvainCommunities`, a modularity heuristic). A community is where a drawing may place
+ *     quantities near each other. It is never a physics claim: two quantities in one community
+ *     share equations, which the map already showed; a community boundary is not a regime
+ *     boundary and not a cluster of related physics.
+ *   - {@link derivationCycles} — strongly connected components (MathTS
+ *     `stronglyConnectedComponents`) of the directed source→target graph: the sets of quantities
+ *     each of which can be derived from the others round a loop. That is where over-determination
+ *     lives, and where `retrodict` has two routes to compare.
+ *   - {@link rankHubs} — betweenness centrality (MathTS `betweennessCentrality`, normalised),
+ *     ON DEMAND ONLY: Brandes' algorithm is O(n·m) per call over about five hundred quantity nodes,
+ *     so the default `upt map` path does not call it. A hub by betweenness is a cut quantity of
+ *     the drawing, not a central quantity of physics.
+ *
+ * @module composition/graph-structure
+ */
+import type { BridgeEdge } from './edge.js';
+/** The label every community report and printout carries, so a reader never takes a layout for physics. @internal */
+export declare const COMMUNITY_METHOD: 'layout communities (Louvain, heuristic)';
+/** The quantity graph of a composition graph. @internal */
+export interface QuantityGraph {
+    /** Canonical quantity names, in first-seen order; the index of each is its node. */
+    readonly names: readonly string[];
+    /** Symmetric co-occurrence weights: `undirected[i][j]` is the number of equations holding both. */
+    readonly undirected: number[][];
+    /** Directed arcs: `directed[i][j]` is 1 when an equation derives `j` from a source set containing `i`. */
+    readonly directed: number[][];
+}
+/**
+ * Build the quantity graph of `edges` (canonical names). An equation whose target is also one of
+ * its sources contributes no self-arc and no self-link.
+ *
+ * @internal
+ */
+export declare function quantityGraph(edges: readonly BridgeEdge[]): QuantityGraph;
+/** One layout community: a set of quantities a drawing may place together. @internal */
+export interface LayoutCommunity {
+    /** Sorted canonical quantity names. */
+    readonly quantities: readonly string[];
+    readonly size: number;
+}
+/** The community report of the largest connected component. @internal */
+export interface CommunityReport {
+    /** Always {@link COMMUNITY_METHOD}: the reading is a layout heuristic. */
+    readonly method: typeof COMMUNITY_METHOD;
+    /** Quantity nodes in the largest component (0 on an empty graph). */
+    readonly componentSize: number;
+    /** Communities, largest first, then by first quantity. */
+    readonly communities: readonly LayoutCommunity[];
+}
+/**
+ * Layout communities (Louvain, heuristic) of the largest component's quantity graph, over the
+ * co-occurrence weights. MathTS's Louvain is deterministic (no seed is taken, none is offered)
+ * and not guaranteed optimal. Presented as layout, never as physics: see the module note.
+ *
+ * @internal
+ */
+export declare function communitiesOf(edges: readonly BridgeEdge[]): CommunityReport;
+/** One derivation cycle: quantities each derivable from the others round a loop, and the equations closing it. @internal */
+export interface DerivationCycle {
+    /** Sorted canonical quantity names of the strongly connected component (at least two). */
+    readonly quantities: readonly string[];
+    /** Ids of the equations with a source and the target inside the component, in graph order. */
+    readonly edges: readonly string[];
+}
+/**
+ * The derivation cycles of `edges`: strongly connected components of size two or more in the
+ * directed source→target quantity graph (MathTS `stronglyConnectedComponents`). An equation
+ * whose target is one of its own sources is not a cycle. Largest first, then by first quantity.
+ *
+ * @internal
+ */
+export declare function derivationCycles(edges: readonly BridgeEdge[]): DerivationCycle[];
+/** One quantity's hub rank. @internal */
+export interface HubRank {
+    readonly quantity: string;
+    /** Normalised betweenness centrality in the undirected quantity graph: 0 for a leaf, 1 for the centre of a star. */
+    readonly betweenness: number;
+    /** Distinct quantities it shares an equation with. */
+    readonly degree: number;
+}
+/**
+ * Rank quantities by betweenness centrality (MathTS `betweennessCentrality`, Brandes, normalised
+ * by `(n−1)(n−2)`), highest first, ties by name. ON DEMAND ONLY: not called by the default map
+ * path. A graph of fewer than three quantities has no interior path, so every score is 0.
+ *
+ * @internal
+ */
+export declare function rankHubs(edges: readonly BridgeEdge[]): Promise<HubRank[]>;
+//# sourceMappingURL=graph-structure.d.ts.map

package/dist/composition/graph-structure.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-structure.d.ts","sourceRoot":"","sources":["../../src/composition/graph-structure.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAQH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAG5C,qHAAqH;AACrH,eAAO,MAAM,gBAAgB,EAAG,yCAAkD,CAAC;AAEnF,2DAA2D;AAC3D,MAAM,WAAW,aAAa;IAC5B,oFAAoF;IACpF,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,mGAAmG;IACnG,QAAQ,CAAC,UAAU,EAAE,MAAM,EAAE,EAAE,CAAC;IAChC,0GAA0G;IAC1G,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAC;CAC/B;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,GAAG,aAAa,CAgCzE;AAED,wFAAwF;AACxF,MAAM,WAAW,eAAe;IAC9B,uCAAuC;IACvC,QAAQ,CAAC,UAAU,EAAE,SAAS,MAAM,EAAE,CAAC;IACvC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAED,yEAAyE;AACzE,MAAM,WAAW,eAAe;IAC9B,0EAA0E;IAC1E,QAAQ,CAAC,MAAM,EAAE,OAAO,gBAAgB,CAAC;IACzC,qEAAqE;IACrE,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,0DAA0D;IAC1D,QAAQ,CAAC,WAAW,EAAE,SAAS,eAAe,EAAE,CAAC;CAClD;AAeD;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,GAAG,eAAe,CAa3E;AAED,4HAA4H;AAC5H,MAAM,WAAW,eAAe;IAC9B,0FAA0F;IAC1F,QAAQ,CAAC,UAAU,EAAE,SAAS,MAAM,EAAE,CAAC;IACvC,8FAA8F;IAC9F,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;CACnC;AAED;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,GAAG,eAAe,EAAE,CAwBhF;AAED,yCAAyC;AACzC,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,oHAAoH;IACpH,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,sDAAsD;IACtD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED;;;;;;GAMG;AACH,wBAAsB,QAAQ,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,CAmB/E"}

package/dist/composition/graph-structure.js

@@ -0,0 +1,167 @@
+/**
+ * Map structure from graph algorithms, over the QUANTITY graph of a composition graph.
+ *
+ * The quantity graph has one node per canonical quantity name (`quantityCanonicalizer`). Two
+ * quantities are linked, undirected, when they occur in one equation together (sources and
+ * target), weighted by how many equations hold both. A directed arc runs from each source
+ * quantity to its equation's target. Three readings of it, each stated for what it is:
+ *
+ *   - {@link communitiesOf} — LAYOUT communities of the largest component (MathTS
+ *     `louvainCommunities`, a modularity heuristic). A community is where a drawing may place
+ *     quantities near each other. It is never a physics claim: two quantities in one community
+ *     share equations, which the map already showed; a community boundary is not a regime
+ *     boundary and not a cluster of related physics.
+ *   - {@link derivationCycles} — strongly connected components (MathTS
+ *     `stronglyConnectedComponents`) of the directed source→target graph: the sets of quantities
+ *     each of which can be derived from the others round a loop. That is where over-determination
+ *     lives, and where `retrodict` has two routes to compare.
+ *   - {@link rankHubs} — betweenness centrality (MathTS `betweennessCentrality`, normalised),
+ *     ON DEMAND ONLY: Brandes' algorithm is O(n·m) per call over about five hundred quantity nodes,
+ *     so the default `upt map` path does not call it. A hub by betweenness is a cut quantity of
+ *     the drawing, not a central quantity of physics.
+ *
+ * @module composition/graph-structure
+ */
+import { betweennessCentrality, connectedComponents, louvainCommunities, stronglyConnectedComponents, } from '@danielsimonjr/mathts-functions';
+import { quantityCanonicalizer } from './quantity-clusters.js';
+/** The label every community report and printout carries, so a reader never takes a layout for physics. @internal */
+export const COMMUNITY_METHOD = 'layout communities (Louvain, heuristic)';
+/**
+ * Build the quantity graph of `edges` (canonical names). An equation whose target is also one of
+ * its sources contributes no self-arc and no self-link.
+ *
+ * @internal
+ */
+export function quantityGraph(edges) {
+    const canon = quantityCanonicalizer();
+    const index = new Map();
+    const names = [];
+    const nodeOf = (raw) => {
+        const name = canon(raw);
+        let i = index.get(name);
+        if (i === undefined) {
+            i = names.length;
+            names.push(name);
+            index.set(name, i);
+        }
+        return i;
+    };
+    const members = edges.map((e) => ({
+        sources: [...new Set(e.sources.map((s) => nodeOf(s.name)))],
+        target: nodeOf(e.target.name),
+    }));
+    const n = names.length;
+    const undirected = Array.from({ length: n }, () => new Array(n).fill(0));
+    const directed = Array.from({ length: n }, () => new Array(n).fill(0));
+    for (const m of members) {
+        const all = [...new Set([...m.sources, m.target])];
+        for (let a = 0; a < all.length; a++) {
+            for (let b = a + 1; b < all.length; b++) {
+                undirected[all[a]][all[b]] += 1;
+                undirected[all[b]][all[a]] += 1;
+            }
+        }
+        for (const s of m.sources)
+            if (s !== m.target)
+                directed[s][m.target] = 1;
+    }
+    return { names, undirected, directed };
+}
+/** 0/1 copy of a weighted adjacency. */
+function binary(weighted) {
+    return weighted.map((row) => row.map((w) => (w > 0 ? 1 : 0)));
+}
+/** The connected components of the undirected quantity graph, largest first, each sorted by node index. */
+function undirectedComponents(g) {
+    if (g.names.length === 0)
+        return [];
+    const comps = connectedComponents(binary(g.undirected)).map((c) => [...c].sort((a, b) => a - b));
+    comps.sort((a, b) => b.length - a.length || g.names[a[0]].localeCompare(g.names[b[0]]));
+    return comps;
+}
+/**
+ * Layout communities (Louvain, heuristic) of the largest component's quantity graph, over the
+ * co-occurrence weights. MathTS's Louvain is deterministic (no seed is taken, none is offered)
+ * and not guaranteed optimal. Presented as layout, never as physics: see the module note.
+ *
+ * @internal
+ */
+export function communitiesOf(edges) {
+    const g = quantityGraph(edges);
+    const comps = undirectedComponents(g);
+    if (comps.length === 0)
+        return { method: COMMUNITY_METHOD, componentSize: 0, communities: [] };
+    const largest = comps[0];
+    const sub = largest.map((i) => largest.map((j) => g.undirected[i][j]));
+    const partition = louvainCommunities(sub);
+    const communities = partition.map((group) => {
+        const quantities = group.map((k) => g.names[largest[k]]).sort();
+        return { quantities, size: quantities.length };
+    });
+    communities.sort((a, b) => b.size - a.size || a.quantities[0].localeCompare(b.quantities[0]));
+    return { method: COMMUNITY_METHOD, componentSize: largest.length, communities };
+}
+/**
+ * The derivation cycles of `edges`: strongly connected components of size two or more in the
+ * directed source→target quantity graph (MathTS `stronglyConnectedComponents`). An equation
+ * whose target is one of its own sources is not a cycle. Largest first, then by first quantity.
+ *
+ * @internal
+ */
+export function derivationCycles(edges) {
+    const g = quantityGraph(edges);
+    if (g.names.length === 0)
+        return [];
+    const canon = quantityCanonicalizer();
+    const index = new Map(g.names.map((name, i) => [name, i]));
+    const cycles = [];
+    for (const scc of stronglyConnectedComponents(g.directed)) {
+        if (scc.length < 2)
+            continue;
+        const inside = new Set(scc);
+        const quantities = scc.map((i) => g.names[i]).sort();
+        const closing = edges
+            .filter((e) => {
+            const t = index.get(canon(e.target.name));
+            if (t === undefined || !inside.has(t))
+                return false;
+            return e.sources.some((s) => {
+                const si = index.get(canon(s.name));
+                return si !== undefined && si !== t && inside.has(si);
+            });
+        })
+            .map((e) => e.id);
+        cycles.push({ quantities, edges: closing });
+    }
+    cycles.sort((a, b) => b.quantities.length - a.quantities.length || a.quantities[0].localeCompare(b.quantities[0]));
+    return cycles;
+}
+/**
+ * Rank quantities by betweenness centrality (MathTS `betweennessCentrality`, Brandes, normalised
+ * by `(n−1)(n−2)`), highest first, ties by name. ON DEMAND ONLY: not called by the default map
+ * path. A graph of fewer than three quantities has no interior path, so every score is 0.
+ *
+ * @internal
+ */
+export async function rankHubs(edges) {
+    const g = quantityGraph(edges);
+    const n = g.names.length;
+    const adjacency = binary(g.undirected);
+    const degree = adjacency.map((row) => row.reduce((acc, x) => acc + x, 0));
+    let scores;
+    if (n < 3) {
+        scores = new Array(n).fill(0);
+    }
+    else {
+        const result = await betweennessCentrality(adjacency, { directed: false, normalized: true });
+        const centrality = result.centrality;
+        if (!(centrality instanceof Float64Array) || centrality.length !== n) {
+            throw new TypeError(`betweennessCentrality returned ${String(centrality)} for ${n} nodes`);
+        }
+        scores = Array.from(centrality);
+    }
+    const ranks = g.names.map((quantity, i) => ({ quantity, betweenness: scores[i], degree: degree[i] }));
+    ranks.sort((a, b) => b.betweenness - a.betweenness || a.quantity.localeCompare(b.quantity));
+    return ranks;
+}
+//# sourceMappingURL=graph-structure.js.map

package/dist/composition/graph-structure.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-structure.js","sourceRoot":"","sources":["../../src/composition/graph-structure.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH,OAAO,EACL,qBAAqB,EACrB,mBAAmB,EACnB,kBAAkB,EAClB,2BAA2B,GAC5B,MAAM,iCAAiC,CAAC;AAEzC,OAAO,EAAE,qBAAqB,EAAE,MAAM,wBAAwB,CAAC;AAE/D,qHAAqH;AACrH,MAAM,CAAC,MAAM,gBAAgB,GAAG,yCAAkD,CAAC;AAYnF;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAAC,KAA4B;IACxD,MAAM,KAAK,GAAG,qBAAqB,EAAE,CAAC;IACtC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,MAAM,GAAG,CAAC,GAAW,EAAU,EAAE;QACrC,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACxB,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACpB,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;YACjB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjB,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;IACF,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAChC,OAAO,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3D,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;KAC9B,CAAC,CAAC,CAAC;IACJ,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACjF,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/E,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAChC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO;YAAE,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM;gBAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC3E,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC;AACzC,CAAC;AAmBD,wCAAwC;AACxC,SAAS,MAAM,CAAC,QAAwC;IACtD,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAChE,CAAC;AAED,2GAA2G;AAC3G,SAAS,oBAAoB,CAAC,CAAgB;IAC5C,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACpC,MAAM,KAAK,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxF,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAAC,KAA4B;IACxD,MAAM,CAAC,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;IAC/B,MAAM,KAAK,GAAG,oBAAoB,CAAC,CAAC,CAAC,CAAC;IACtC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,MAAM,EAAE,gBAAgB,EAAE,aAAa,EAAE,CAAC,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC;IAC/F,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACzB,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,MAAM,SAAS,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAC;IAC1C,MAAM,WAAW,GAAsB,SAAS,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QAC7D,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAChE,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,UAAU,CAAC,MAAM,EAAE,CAAC;IACjD,CAAC,CAAC,CAAC;IACH,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9F,OAAO,EAAE,MAAM,EAAE,gBAAgB,EAAE,aAAa,EAAE,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC;AAClF,CAAC;AAUD;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAA4B;IAC3D,MAAM,CAAC,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;IAC/B,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACpC,MAAM,KAAK,GAAG,qBAAqB,EAAE,CAAC;IACtC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,MAAM,MAAM,GAAsB,EAAE,CAAC;IACrC,KAAK,MAAM,GAAG,IAAI,2BAA2B,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC1D,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QAC7B,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5B,MAAM,UAAU,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACrD,MAAM,OAAO,GAAG,KAAK;aAClB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;YACZ,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YAC1C,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACpD,OAAO,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;gBAC1B,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;gBACpC,OAAO,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACxD,CAAC,CAAC,CAAC;QACL,CAAC,CAAC;aACD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACpB,MAAM,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;IAC9C,CAAC;IACD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnH,OAAO,MAAM,CAAC;AAChB,CAAC;AAWD;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,QAAQ,CAAC,KAA4B;IACzD,MAAM,CAAC,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;IAC/B,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;IACzB,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;IACvC,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC1E,IAAI,MAAgB,CAAC;IACrB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACV,MAAM,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC;SAAM,CAAC;QACN,MAAM,MAAM,GAAG,MAAM,qBAAqB,CAAC,SAAS,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC;QAC7F,MAAM,UAAU,GAAY,MAAM,CAAC,UAAU,CAAC;QAC9C,IAAI,CAAC,CAAC,UAAU,YAAY,YAAY,CAAC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrE,MAAM,IAAI,SAAS,CAAC,kCAAkC,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC7F,CAAC;QACD,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAClC,CAAC;IACD,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC5F,OAAO,KAAK,CAAC;AACf,CAAC","sourcesContent":["/**\n * Map structure from graph algorithms, over the QUANTITY graph of a composition graph.\n *\n * The quantity graph has one node per canonical quantity name (`quantityCanonicalizer`). Two\n * quantities are linked, undirected, when they occur in one equation together (sources and\n * target), weighted by how many equations hold both. A directed arc runs from each source\n * quantity to its equation's target. Three readings of it, each stated for what it is:\n *\n *   - {@link communitiesOf} — LAYOUT communities of the largest component (MathTS\n *     `louvainCommunities`, a modularity heuristic). A community is where a drawing may place\n *     quantities near each other. It is never a physics claim: two quantities in one community\n *     share equations, which the map already showed; a community boundary is not a regime\n *     boundary and not a cluster of related physics.\n *   - {@link derivationCycles} — strongly connected components (MathTS\n *     `stronglyConnectedComponents`) of the directed source→target graph: the sets of quantities\n *     each of which can be derived from the others round a loop. That is where over-determination\n *     lives, and where `retrodict` has two routes to compare.\n *   - {@link rankHubs} — betweenness centrality (MathTS `betweennessCentrality`, normalised),\n *     ON DEMAND ONLY: Brandes' algorithm is O(n·m) per call over about five hundred quantity nodes,\n *     so the default `upt map` path does not call it. A hub by betweenness is a cut quantity of\n *     the drawing, not a central quantity of physics.\n *\n * @module composition/graph-structure\n */\n\nimport {\n  betweennessCentrality,\n  connectedComponents,\n  louvainCommunities,\n  stronglyConnectedComponents,\n} from '@danielsimonjr/mathts-functions';\nimport type { BridgeEdge } from './edge.js';\nimport { quantityCanonicalizer } from './quantity-clusters.js';\n\n/** The label every community report and printout carries, so a reader never takes a layout for physics. @internal */\nexport const COMMUNITY_METHOD = 'layout communities (Louvain, heuristic)' as const;\n\n/** The quantity graph of a composition graph. @internal */\nexport interface QuantityGraph {\n  /** Canonical quantity names, in first-seen order; the index of each is its node. */\n  readonly names: readonly string[];\n  /** Symmetric co-occurrence weights: `undirected[i][j]` is the number of equations holding both. */\n  readonly undirected: number[][];\n  /** Directed arcs: `directed[i][j]` is 1 when an equation derives `j` from a source set containing `i`. */\n  readonly directed: number[][];\n}\n\n/**\n * Build the quantity graph of `edges` (canonical names). An equation whose target is also one of\n * its sources contributes no self-arc and no self-link.\n *\n * @internal\n */\nexport function quantityGraph(edges: readonly BridgeEdge[]): QuantityGraph {\n  const canon = quantityCanonicalizer();\n  const index = new Map<string, number>();\n  const names: string[] = [];\n  const nodeOf = (raw: string): number => {\n    const name = canon(raw);\n    let i = index.get(name);\n    if (i === undefined) {\n      i = names.length;\n      names.push(name);\n      index.set(name, i);\n    }\n    return i;\n  };\n  const members = edges.map((e) => ({\n    sources: [...new Set(e.sources.map((s) => nodeOf(s.name)))],\n    target: nodeOf(e.target.name),\n  }));\n  const n = names.length;\n  const undirected = Array.from({ length: n }, () => new Array<number>(n).fill(0));\n  const directed = Array.from({ length: n }, () => new Array<number>(n).fill(0));\n  for (const m of members) {\n    const all = [...new Set([...m.sources, m.target])];\n    for (let a = 0; a < all.length; a++) {\n      for (let b = a + 1; b < all.length; b++) {\n        undirected[all[a]][all[b]] += 1;\n        undirected[all[b]][all[a]] += 1;\n      }\n    }\n    for (const s of m.sources) if (s !== m.target) directed[s][m.target] = 1;\n  }\n  return { names, undirected, directed };\n}\n\n/** One layout community: a set of quantities a drawing may place together. @internal */\nexport interface LayoutCommunity {\n  /** Sorted canonical quantity names. */\n  readonly quantities: readonly string[];\n  readonly size: number;\n}\n\n/** The community report of the largest connected component. @internal */\nexport interface CommunityReport {\n  /** Always {@link COMMUNITY_METHOD}: the reading is a layout heuristic. */\n  readonly method: typeof COMMUNITY_METHOD;\n  /** Quantity nodes in the largest component (0 on an empty graph). */\n  readonly componentSize: number;\n  /** Communities, largest first, then by first quantity. */\n  readonly communities: readonly LayoutCommunity[];\n}\n\n/** 0/1 copy of a weighted adjacency. */\nfunction binary(weighted: readonly (readonly number[])[]): number[][] {\n  return weighted.map((row) => row.map((w) => (w > 0 ? 1 : 0)));\n}\n\n/** The connected components of the undirected quantity graph, largest first, each sorted by node index. */\nfunction undirectedComponents(g: QuantityGraph): number[][] {\n  if (g.names.length === 0) return [];\n  const comps = connectedComponents(binary(g.undirected)).map((c) => [...c].sort((a, b) => a - b));\n  comps.sort((a, b) => b.length - a.length || g.names[a[0]].localeCompare(g.names[b[0]]));\n  return comps;\n}\n\n/**\n * Layout communities (Louvain, heuristic) of the largest component's quantity graph, over the\n * co-occurrence weights. MathTS's Louvain is deterministic (no seed is taken, none is offered)\n * and not guaranteed optimal. Presented as layout, never as physics: see the module note.\n *\n * @internal\n */\nexport function communitiesOf(edges: readonly BridgeEdge[]): CommunityReport {\n  const g = quantityGraph(edges);\n  const comps = undirectedComponents(g);\n  if (comps.length === 0) return { method: COMMUNITY_METHOD, componentSize: 0, communities: [] };\n  const largest = comps[0];\n  const sub = largest.map((i) => largest.map((j) => g.undirected[i][j]));\n  const partition = louvainCommunities(sub);\n  const communities: LayoutCommunity[] = partition.map((group) => {\n    const quantities = group.map((k) => g.names[largest[k]]).sort();\n    return { quantities, size: quantities.length };\n  });\n  communities.sort((a, b) => b.size - a.size || a.quantities[0].localeCompare(b.quantities[0]));\n  return { method: COMMUNITY_METHOD, componentSize: largest.length, communities };\n}\n\n/** One derivation cycle: quantities each derivable from the others round a loop, and the equations closing it. @internal */\nexport interface DerivationCycle {\n  /** Sorted canonical quantity names of the strongly connected component (at least two). */\n  readonly quantities: readonly string[];\n  /** Ids of the equations with a source and the target inside the component, in graph order. */\n  readonly edges: readonly string[];\n}\n\n/**\n * The derivation cycles of `edges`: strongly connected components of size two or more in the\n * directed source→target quantity graph (MathTS `stronglyConnectedComponents`). An equation\n * whose target is one of its own sources is not a cycle. Largest first, then by first quantity.\n *\n * @internal\n */\nexport function derivationCycles(edges: readonly BridgeEdge[]): DerivationCycle[] {\n  const g = quantityGraph(edges);\n  if (g.names.length === 0) return [];\n  const canon = quantityCanonicalizer();\n  const index = new Map(g.names.map((name, i) => [name, i]));\n  const cycles: DerivationCycle[] = [];\n  for (const scc of stronglyConnectedComponents(g.directed)) {\n    if (scc.length < 2) continue;\n    const inside = new Set(scc);\n    const quantities = scc.map((i) => g.names[i]).sort();\n    const closing = edges\n      .filter((e) => {\n        const t = index.get(canon(e.target.name));\n        if (t === undefined || !inside.has(t)) return false;\n        return e.sources.some((s) => {\n          const si = index.get(canon(s.name));\n          return si !== undefined && si !== t && inside.has(si);\n        });\n      })\n      .map((e) => e.id);\n    cycles.push({ quantities, edges: closing });\n  }\n  cycles.sort((a, b) => b.quantities.length - a.quantities.length || a.quantities[0].localeCompare(b.quantities[0]));\n  return cycles;\n}\n\n/** One quantity's hub rank. @internal */\nexport interface HubRank {\n  readonly quantity: string;\n  /** Normalised betweenness centrality in the undirected quantity graph: 0 for a leaf, 1 for the centre of a star. */\n  readonly betweenness: number;\n  /** Distinct quantities it shares an equation with. */\n  readonly degree: number;\n}\n\n/**\n * Rank quantities by betweenness centrality (MathTS `betweennessCentrality`, Brandes, normalised\n * by `(n−1)(n−2)`), highest first, ties by name. ON DEMAND ONLY: not called by the default map\n * path. A graph of fewer than three quantities has no interior path, so every score is 0.\n *\n * @internal\n */\nexport async function rankHubs(edges: readonly BridgeEdge[]): Promise<HubRank[]> {\n  const g = quantityGraph(edges);\n  const n = g.names.length;\n  const adjacency = binary(g.undirected);\n  const degree = adjacency.map((row) => row.reduce((acc, x) => acc + x, 0));\n  let scores: number[];\n  if (n < 3) {\n    scores = new Array<number>(n).fill(0);\n  } else {\n    const result = await betweennessCentrality(adjacency, { directed: false, normalized: true });\n    const centrality: unknown = result.centrality;\n    if (!(centrality instanceof Float64Array) || centrality.length !== n) {\n      throw new TypeError(`betweennessCentrality returned ${String(centrality)} for ${n} nodes`);\n    }\n    scores = Array.from(centrality);\n  }\n  const ranks = g.names.map((quantity, i) => ({ quantity, betweenness: scores[i], degree: degree[i] }));\n  ranks.sort((a, b) => b.betweenness - a.betweenness || a.quantity.localeCompare(b.quantity));\n  return ranks;\n}\n"]}

package/dist/composition/graph-viz-svg.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"graph-viz-svg.d.ts","sourceRoot":"","sources":["../../src/composition/graph-viz-svg.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH;;;;;;GAMG;AACH,qBAAa,2BAA4B,SAAQ,KAAK;IACpD,YACE,OAAO,SAC8B,EAItC;CACF;AASD;;;;;;GAMG;AACH,wBAAsB,cAAc,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CASjE"}
+{"version":3,"file":"graph-viz-svg.d.ts","sourceRoot":"","sources":["../../src/composition/graph-viz-svg.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAIH;;;;;;GAMG;AACH,qBAAa,2BAA4B,SAAQ,KAAK;IACpD,YACE,OAAO,SAC8B,EAItC;CACF;AAWD;;;;;;GAMG;AACH,wBAAsB,cAAc,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CASjE"}

package/dist/composition/graph-viz-svg.js

@@ -34,7 +34,7 @@ export class SvgRendererUnavailableError extends Error {
 export async function renderDotToSvg(dot) {
     let viz;
     try {
-        viz = (await import('@viz-js/viz'));
+        viz = await import('@viz-js/viz');
     }
     catch {
         throw new SvgRendererUnavailableError();

package/dist/composition/graph-viz-svg.js.map

@@ -1 +1 @@
-{"version":3,"file":"graph-viz-svg.js","sourceRoot":"","sources":["../../src/composition/graph-viz-svg.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH;;;;;;GAMG;AACH,MAAM,OAAO,2BAA4B,SAAQ,KAAK;IACpD,YACE,OAAO,GAAG,+DAA+D;QACvE,mCAAmC;QAErC,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,6BAA6B,CAAC;IAC5C,CAAC;CACF;AASD;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAAC,GAAW;IAC9C,IAAI,GAAc,CAAC;IACnB,IAAI,CAAC;QACH,GAAG,GAAG,CAAC,MAAM,MAAM,CAAC,aAAa,CAAC,CAAyB,CAAC;IAC9D,CAAC;IAAC,MAAM,CAAC;QACP,MAAM,IAAI,2BAA2B,EAAE,CAAC;IAC1C,CAAC;IACD,MAAM,QAAQ,GAAG,MAAM,GAAG,CAAC,QAAQ,EAAE,CAAC;IACtC,OAAO,QAAQ,CAAC,YAAY,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;AACvD,CAAC","sourcesContent":["/**\n * SVG rendering for the physics map — render Graphviz DOT source to an SVG\n * string via the optional **`@viz-js/viz`** peer (the real Graphviz compiled to\n * WebAssembly: same `dot` output, in-process, no native binary, no subprocess).\n *\n * Kept separate from `graph-viz.ts` so that module stays pure, synchronous, and\n * dependency-free (text only). The optional-renderer concern — a lazy dynamic\n * import with graceful fallback, mirroring `numerical/formula-registry.ts`'s\n * MathTS-peer pattern — lives here.\n *\n * @module composition/graph-viz-svg\n */\n\n/**\n * Thrown by {@link renderDotToSvg} when the optional `@viz-js/viz` peer is not\n * installed. The message names the install command and the no-install\n * alternative.\n *\n * @public\n */\nexport class SvgRendererUnavailableError extends Error {\n  constructor(\n    message = 'SVG rendering needs the optional renderer: npm i @viz-js/viz ' +\n      '(or use --format=dot | dot -Tsvg)',\n  ) {\n    super(message);\n    this.name = 'SvgRendererUnavailableError';\n  }\n}\n\n/** The shape we use from `@viz-js/viz` — its `instance()` resolves a renderer. */\ninterface VizModule {\n  instance(): Promise<{\n    renderString(src: string, options: { format: string }): string;\n  }>;\n}\n\n/**\n * Render Graphviz DOT source (e.g. {@link buildVizModel}'s `toDot()`) to an SVG\n * document string. Lazy-loads the optional `@viz-js/viz` peer.\n *\n * @throws {SvgRendererUnavailableError} if the peer is not installed.\n * @public\n */\nexport async function renderDotToSvg(dot: string): Promise<string> {\n  let viz: VizModule;\n  try {\n    viz = (await import('@viz-js/viz')) as unknown as VizModule;\n  } catch {\n    throw new SvgRendererUnavailableError();\n  }\n  const renderer = await viz.instance();\n  return renderer.renderString(dot, { format: 'svg' });\n}\n"]}
+{"version":3,"file":"graph-viz-svg.js","sourceRoot":"","sources":["../../src/composition/graph-viz-svg.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAIH;;;;;;GAMG;AACH,MAAM,OAAO,2BAA4B,SAAQ,KAAK;IACpD,YACE,OAAO,GAAG,+DAA+D;QACvE,mCAAmC;QAErC,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,6BAA6B,CAAC;IAC5C,CAAC;CACF;AAWD;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAAC,GAAW;IAC9C,IAAI,GAAc,CAAC;IACnB,IAAI,CAAC;QACH,GAAG,GAAG,MAAM,MAAM,CAAC,aAAa,CAAC,CAAC;IACpC,CAAC;IAAC,MAAM,CAAC;QACP,MAAM,IAAI,2BAA2B,EAAE,CAAC;IAC1C,CAAC;IACD,MAAM,QAAQ,GAAG,MAAM,GAAG,CAAC,QAAQ,EAAE,CAAC;IACtC,OAAO,QAAQ,CAAC,YAAY,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;AACvD,CAAC","sourcesContent":["/**\n * SVG rendering for the physics map — render Graphviz DOT source to an SVG\n * string via the optional **`@viz-js/viz`** peer (the real Graphviz compiled to\n * WebAssembly: same `dot` output, in-process, no native binary, no subprocess).\n *\n * Kept separate from `graph-viz.ts` so that module stays pure, synchronous, and\n * dependency-free (text only). The optional-renderer concern — a lazy dynamic\n * import with graceful fallback, mirroring `numerical/formula-registry.ts`'s\n * MathTS-peer pattern — lives here.\n *\n * @module composition/graph-viz-svg\n */\n\nimport type { Viz } from '@viz-js/viz';\n\n/**\n * Thrown by {@link renderDotToSvg} when the optional `@viz-js/viz` peer is not\n * installed. The message names the install command and the no-install\n * alternative.\n *\n * @public\n */\nexport class SvgRendererUnavailableError extends Error {\n  constructor(\n    message = 'SVG rendering needs the optional renderer: npm i @viz-js/viz ' +\n      '(or use --format=dot | dot -Tsvg)',\n  ) {\n    super(message);\n    this.name = 'SvgRendererUnavailableError';\n  }\n}\n\n/**\n * The part of `@viz-js/viz` this module uses: `instance()` resolves the renderer, whose\n * `renderString` is the peer's own declared type. The peer's types are a devDependency, so the\n * dynamic import is typed without a cast; at runtime the peer stays optional.\n */\ninterface VizModule {\n  instance(): Promise<Viz>;\n}\n\n/**\n * Render Graphviz DOT source (e.g. {@link buildVizModel}'s `toDot()`) to an SVG\n * document string. Lazy-loads the optional `@viz-js/viz` peer.\n *\n * @throws {SvgRendererUnavailableError} if the peer is not installed.\n * @public\n */\nexport async function renderDotToSvg(dot: string): Promise<string> {\n  let viz: VizModule;\n  try {\n    viz = await import('@viz-js/viz');\n  } catch {\n    throw new SvgRendererUnavailableError();\n  }\n  const renderer = await viz.instance();\n  return renderer.renderString(dot, { format: 'svg' });\n}\n"]}

package/dist/composition/graph-viz.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"graph-viz.d.ts","sourceRoot":"","sources":["../../src/composition/graph-viz.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAE5C,OAAO,KAAK,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAEvE;;;;;;GAMG;AACH,MAAM,MAAM,SAAS,GACjB,KAAK,GACL,aAAa,GACb,aAAa,GACb,oBAAoB,GACpB,UAAU,GACV,MAAM,GACN,QAAQ,GACR,aAAa,CAAC;AAElB;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,gBAAgB,EAAE,SAAS,SAAS,EAShD,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,WAAW,WAAW;IAC1B,4CAA4C;IAC5C,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,yBAAyB;IACzB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC;IAC3B,6BAA6B;IAC7B,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,4BAA4B;IAC5B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB;;;;;;OAMG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,YAAY,CAAC;IACjC;;;;OAIG;IACH,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CAC/B;AAED;;;;;;;;;GASG;AACH,MAAM,WAAW,cAAc;IAC7B,8CAA8C;IAC9C,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,0BAA0B;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,wEAAwE;IACxE,QAAQ,CAAC,kBAAkB,EAAE,MAAM,CAAC;IACpC,oEAAoE;IACpE,QAAQ,CAAC,sBAAsB,EAAE,MAAM,CAAC;IACxC,8CAA8C;IAC9C,QAAQ,CAAC,QAAQ,CAAC,EAAE,YAAY,CAAC;IACjC,8CAA8C;IAC9C,QAAQ,CAAC,QAAQ,CAAC,EAAE,WAAW,CAAC;CACjC;AAED;;;;GAIG;AACH,MAAM,WAAW,UAAU;IACzB,sCAAsC;IACtC,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC,qEAAqE;IACrE,QAAQ,CAAC,UAAU,EAAE,SAAS,MAAM,EAAE,CAAC;IACvC,uEAAuE;IACvE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,2EAA2E;IAC3E,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;CAC5B;AAED;;;;GAIG;AACH,MAAM,WAAW,UAAU;IACzB,+CAA+C;IAC/C,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,+EAA+E;IAC/E,QAAQ,CAAC,cAAc,CAAC,EAAE,SAAS,WAAW,EAAE,CAAC;IACjD;;;;;;;;OAQG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,YAAY,CAAC;IACjC;;;;;;;OAOG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,WAAW,CAAC;IAChC;;;;;;;OAOG;IACH,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,WAAW,CAAC,WAAW,CAAC,CAAC;CACtE;AAED;;;;;GAKG;AACH,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,SAAS,EAAE,SAAS,WAAW,EAAE,CAAC;IAC3C,QAAQ,CAAC,QAAQ,EAAE,SAAS,UAAU,EAAE,CAAC;IACzC,0EAA0E;IAC1E,QAAQ,CAAC,WAAW,EAAE,cAAc,CAAC;IACrC,8EAA8E;IAC9E,QAAQ,CAAC,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IACrC,SAAS,IAAI,MAAM,CAAC;IACpB,KAAK,IAAI,MAAM,CAAC;CACjB;AAqBD;;;;4DAI4D;AAC5D,wBAAgB,cAAc,CAAC,IAAI,EAAE,UAAU,GAAG,WAAW,CAW5D;AAgCD;;;;;GAKG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,IAAI,EAAE,IAAI,CAAC,UAAU,EAAE,UAAU,GAAG,UAAU,GAAG,gBAAgB,CAAC,GACjE;IAAE,QAAQ,CAAC,IAAI,EAAE,UAAU,EAAE,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,cAAc,CAAA;CAAE,CA4BjE;AAED;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,cAAc,GAAG,MAAM,GAAG,IAAI,CAUvE;AAiPD;;;;;;GAMG;AACH,wBAAgB,aAAa,CAC3B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,IAAI,GAAE,UAAe,GACpB,QAAQ,CA4DV"}
+{"version":3,"file":"graph-viz.d.ts","sourceRoot":"","sources":["../../src/composition/graph-viz.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAE5C,OAAO,KAAK,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAEvE;;;;;;GAMG;AACH,MAAM,MAAM,SAAS,GACjB,KAAK,GACL,aAAa,GACb,aAAa,GACb,oBAAoB,GACpB,UAAU,GACV,MAAM,GACN,QAAQ,GACR,aAAa,CAAC;AAElB;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,gBAAgB,EAAE,SAAS,SAAS,EAShD,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,WAAW,WAAW;IAC1B,4CAA4C;IAC5C,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,yBAAyB;IACzB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC;IAC3B,6BAA6B;IAC7B,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,4BAA4B;IAC5B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB;;;;;;OAMG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,YAAY,CAAC;IACjC;;;;OAIG;IACH,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CAC/B;AAED;;;;;;;;;GASG;AACH,MAAM,WAAW,cAAc;IAC7B,8CAA8C;IAC9C,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,0BAA0B;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,wEAAwE;IACxE,QAAQ,CAAC,kBAAkB,EAAE,MAAM,CAAC;IACpC,oEAAoE;IACpE,QAAQ,CAAC,sBAAsB,EAAE,MAAM,CAAC;IACxC,8CAA8C;IAC9C,QAAQ,CAAC,QAAQ,CAAC,EAAE,YAAY,CAAC;IACjC,8CAA8C;IAC9C,QAAQ,CAAC,QAAQ,CAAC,EAAE,WAAW,CAAC;CACjC;AAED;;;;GAIG;AACH,MAAM,WAAW,UAAU;IACzB,sCAAsC;IACtC,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC,qEAAqE;IACrE,QAAQ,CAAC,UAAU,EAAE,SAAS,MAAM,EAAE,CAAC;IACvC,uEAAuE;IACvE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,2EAA2E;IAC3E,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;CAC5B;AAED;;;;GAIG;AACH,MAAM,WAAW,UAAU;IACzB,+CAA+C;IAC/C,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,+EAA+E;IAC/E,QAAQ,CAAC,cAAc,CAAC,EAAE,SAAS,WAAW,EAAE,CAAC;IACjD;;;;;;;;OAQG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,YAAY,CAAC;IACjC;;;;;;;OAOG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,WAAW,CAAC;IAChC;;;;;;;OAOG;IACH,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,WAAW,CAAC,WAAW,CAAC,CAAC;CACtE;AAED;;;;;GAKG;AACH,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,SAAS,EAAE,SAAS,WAAW,EAAE,CAAC;IAC3C,QAAQ,CAAC,QAAQ,EAAE,SAAS,UAAU,EAAE,CAAC;IACzC,0EAA0E;IAC1E,QAAQ,CAAC,WAAW,EAAE,cAAc,CAAC;IACrC,8EAA8E;IAC9E,QAAQ,CAAC,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IACrC,SAAS,IAAI,MAAM,CAAC;IACpB,KAAK,IAAI,MAAM,CAAC;CACjB;AAqBD;;;;4DAI4D;AAC5D,wBAAgB,cAAc,CAAC,IAAI,EAAE,UAAU,GAAG,WAAW,CAW5D;AAgCD;;;;;GAKG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,IAAI,EAAE,IAAI,CAAC,UAAU,EAAE,UAAU,GAAG,UAAU,GAAG,gBAAgB,CAAC,GACjE;IAAE,QAAQ,CAAC,IAAI,EAAE,UAAU,EAAE,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,cAAc,CAAA;CAAE,CA4BjE;AAED;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,cAAc,GAAG,MAAM,GAAG,IAAI,CAUvE;AA8MD;;;;;;GAMG;AACH,wBAAgB,aAAa,CAC3B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,IAAI,GAAE,UAAe,GACpB,QAAQ,CA4DV"}

package/dist/composition/graph-viz.js

@@ -18,7 +18,7 @@
  *
  * @module composition/graph-viz
  */
-import { QUANTITY_IDENTIFICATIONS } from './compose.js';
+import { clusterBySharedKeys, quantityCanonicalizer } from './quantity-clusters.js';
 /**
  * Every `VizStatus`, as VALUES.
  *
@@ -147,43 +147,17 @@ export function formatFilterLegend(stats) {
         `${stats.droppedNotMatching} dropped (did not match); ` +
         `${stats.droppedMissingMetadata} dropped (no overlay metadata)`);
 }
-/** Quantity-name canonicalizer from `QUANTITY_IDENTIFICATIONS` (matches `linkageMap`). */
-function makeCanon() {
-    const alias = new Map(QUANTITY_IDENTIFICATIONS.map((id) => [id.from, id.to]));
-    return (n) => alias.get(n) ?? n;
-}
 /** Distinct canonical quantity names of a junction (sources ∪ target). */
 function quantitiesOf(j) {
     return [...new Set([...j.sources, j.target])];
 }
-/** Union-find component grouping of junctions sharing a (canonical) quantity. */
+/**
+ * Component grouping of junctions sharing a (canonical) quantity: the shared partition of
+ * `quantity-clusters.ts`, in the order the map always drew (largest first, then by first
+ * junction id; input order inside). The anchoring rule below is this module's own.
+ */
 function componentsOf(junctions) {
-    const parent = junctions.map((_, i) => i);
-    const find = (x) => parent[x] === x ? x : (parent[x] = find(parent[x]));
-    const union = (a, b) => {
-        parent[find(a)] = find(b);
-    };
-    const qToJunctions = new Map();
-    junctions.forEach((j, i) => {
-        for (const qty of quantitiesOf(j)) {
-            const arr = qToJunctions.get(qty) ?? [];
-            arr.push(i);
-            qToJunctions.set(qty, arr);
-        }
-    });
-    for (const idxs of qToJunctions.values()) {
-        for (let k = 1; k < idxs.length; k++)
-            union(idxs[0], idxs[k]);
-    }
-    const groups = new Map();
-    junctions.forEach((_, i) => {
-        const r = find(i);
-        const arr = groups.get(r) ?? [];
-        arr.push(i);
-        groups.set(r, arr);
-    });
-    const clusters = [...groups.values()].map((idxs) => {
-        const js = idxs.map((i) => junctions[i]);
+    return clusterBySharedKeys(junctions, quantitiesOf, (j) => j.id).map((js) => {
         const quantities = [...new Set(js.flatMap(quantitiesOf))].sort();
         return {
             junctionIds: js.map((j) => j.id),
@@ -197,9 +171,6 @@ function componentsOf(junctions) {
             anchored: js.some((j) => j.status === 'law' || j.status === 'established'),
         };
     });
-    // Deterministic: largest first, then by first junction id.
-    clusters.sort((a, b) => b.size - a.size || a.junctionIds[0].localeCompare(b.junctionIds[0]));
-    return clusters;
 }
 /** A stable, collision-free id factory mapping arbitrary keys to safe ids. */
 function idFactory(prefix) {
@@ -355,7 +326,7 @@ function emitDot(clusters, byId, title, legend) {
  * @public
  */
 export function buildVizModel(edges, opts = {}) {
-    const canon = makeCanon();
+    const canon = quantityCanonicalizer();
     const normalize = (j) => ({
         ...j,
         sources: j.sources.map(canon),

package/dist/composition/graph-viz.js.map

@@ -1 +1 @@
-{"version":3,"file":"graph-viz.js","sourceRoot":"","sources":["../../src/composition/graph-viz.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAGH,OAAO,EAAE,wBAAwB,EAAE,MAAM,cAAc,CAAC;AAoBxD;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAyB;IACpD,KAAK;IACL,aAAa;IACb,aAAa;IACb,oBAAoB;IACpB,UAAU;IACV,MAAM;IACN,QAAQ;IACR,aAAa;CACd,CAAC;AAqIF,iFAAiF;AACjF,MAAM,YAAY,GAEd;IACF,GAAG,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,sBAAsB;IAClF,WAAW,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,uBAAuB;IAC3F,WAAW,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,QAAQ;IAC5E,oBAAoB,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,MAAM;IACnF,QAAQ,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,8BAA8B;IAC9F,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,yBAAyB;IACtF,4EAA4E;IAC5E,8EAA8E;IAC9E,MAAM,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,SAAS;IACxE,iEAAiE;IACjE,2EAA2E;IAC3E,wEAAwE;IACxE,WAAW,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,eAAe;CACnF,CAAC;AAEF;;;;4DAI4D;AAC5D,MAAM,UAAU,cAAc,CAAC,IAAgB;IAC7C,MAAM,MAAM,GAAc,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC;IACxE,OAAO;QACL,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,KAAK,EAAE,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK;QACzD,MAAM;QACN,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;QACxC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI;QACxB,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1D,IAAI,EAAE,IAAI,CAAC,IAAI;KAChB,CAAC;AACJ,CAAC;AAWD,SAAS,KAAK,CACZ,IAAiB,EACjB,IAAkE;IAElE,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QAChC,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS;YAAE,OAAO,kBAAkB,CAAC;QAC3D,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ;YAAE,OAAO,cAAc,CAAC;IAC7D,CAAC;IACD,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QAChC,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI;YAAE,OAAO,kBAAkB,CAAC;QACjD,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC;QACnC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,MAAM,IAAI,KAAK,CACb,0FAA0F,CAC3F,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC;YAAE,OAAO,cAAc,CAAC;IACnE,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CACzB,KAA4B,EAC5B,IAAkE;IAElE,MAAM,IAAI,GAAiB,EAAE,CAAC;IAC9B,IAAI,kBAAkB,GAAG,CAAC,CAAC;IAC3B,IAAI,sBAAsB,GAAG,CAAC,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,QAAQ,KAAK,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;YAClE,KAAK,MAAM;gBACT,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACb,MAAM;YACR,KAAK,cAAc;gBACjB,kBAAkB,IAAI,CAAC,CAAC;gBACxB,MAAM;YACR,KAAK,kBAAkB;gBACrB,sBAAsB,IAAI,CAAC,CAAC;gBAC5B,MAAM;QACV,CAAC;IACH,CAAC;IACD,OAAO;QACL,IAAI;QACJ,KAAK,EAAE;YACL,KAAK,EAAE,KAAK,CAAC,MAAM;YACnB,IAAI,EAAE,IAAI,CAAC,MAAM;YACjB,kBAAkB;YAClB,sBAAsB;YACtB,GAAG,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACnE,GAAG,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACpE;KACF,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAqB;IACtD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,YAAY,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;IAC3E,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,YAAY,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;IAC3E,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACpC,OAAO,CACL,WAAW,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,KAAK,CAAC,KAAK,SAAS;QACrE,GAAG,KAAK,CAAC,kBAAkB,4BAA4B;QACvD,GAAG,KAAK,CAAC,sBAAsB,gCAAgC,CAChE,CAAC;AACJ,CAAC;AAED,0FAA0F;AAC1F,SAAS,SAAS;IAChB,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,wBAAwB,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC9E,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAClC,CAAC;AAED,0EAA0E;AAC1E,SAAS,YAAY,CAAC,CAAc;IAClC,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;AAChD,CAAC;AAED,iFAAiF;AACjF,SAAS,YAAY,CAAC,SAAiC;IACrD,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC1C,MAAM,IAAI,GAAG,CAAC,CAAS,EAAU,EAAE,CACjC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,CAAS,EAAQ,EAAE;QAC3C,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC;IAEF,MAAM,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAC;IACjD,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACzB,KAAK,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;YAClC,MAAM,GAAG,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YACxC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACZ,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC,CAAC,CAAC;IACH,KAAK,MAAM,IAAI,IAAI,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAChE,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACzB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAChC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACZ,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACrB,CAAC,CAAC,CAAC;IAEH,MAAM,QAAQ,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAc,EAAE;QAC7D,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,UAAU,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACjE,OAAO;YACL,WAAW,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAChC,UAAU;YACV,IAAI,EAAE,EAAE,CAAC,MAAM;YACf,+DAA+D;YAC/D,uEAAuE;YACvE,uEAAuE;YACvE,mEAAmE;YACnE,mEAAmE;YACnE,QAAQ,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,KAAK,IAAI,CAAC,CAAC,MAAM,KAAK,aAAa,CAAC;SAC3E,CAAC;IACJ,CAAC,CAAC,CAAC;IACH,2DAA2D;IAC3D,QAAQ,CAAC,IAAI,CACX,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAC9E,CAAC;IACF,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,8EAA8E;AAC9E,SAAS,SAAS,CAAC,MAAc;IAC/B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,OAAO,CAAC,GAAG,EAAE,EAAE;QACb,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC;QAC1B,MAAM,IAAI,GAAG,GAAG,MAAM,IAAI,GAAG,CAAC,OAAO,CAAC,eAAe,EAAE,GAAG,CAAC,EAAE,CAAC;QAC9D,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,EAAE,GAAG,GAAG,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;QAC3C,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACb,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QAClB,OAAO,EAAE,CAAC;IACZ,CAAC,CAAC;AACJ,CAAC;AAED;0EAC0E;AAC1E,MAAM,OAAO,GAAG,CAAC,CAAS,EAAU,EAAE,CACpC,CAAC;KACE,OAAO,CAAC,aAAa,EAAE,GAAG,CAAC;KAC3B,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC;KACtB,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC;KACvB,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC;KACrB,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;AAC3B,qDAAqD;AACrD,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAU,EAAE,CACrC,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAE5E;;;;;;GAMG;AACH,MAAM,iBAAiB,GAAyB;IAC9C,KAAK;IACL,aAAa;IACb,aAAa;IACb,oBAAoB;IACpB,UAAU;IACV,MAAM;IACN,QAAQ;IACR,aAAa;CACd,CAAC;AAEF;;;;;;GAMG;AACH,SAAS,mBAAmB,CAC1B,QAA+B,EAC/B,aAAmF;IAEnF,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;IACjD,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC;IACxD,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACrB,aAAa,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAC/F,CAAC;IACF,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC;QACtB,aAAa,CACX,aAAa,UAAU,CAAC,MAAM,GAAG,EACjC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,EACxC,KAAK,CACN,CAAC;IACJ,CAAC;AACH,CAAC;AAED,SAAS,WAAW,CAClB,QAA+B,EAC/B,IAAsC,EACtC,KAAa,EACb,MAAqB;IAErB,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,YAAY,GAAG,IAAI,GAAG,EAAa,CAAC;IAC1C,MAAM,GAAG,GAAa,CAAC,cAAc,EAAE,MAAM,KAAK,EAAE,CAAC,CAAC;IACtD,6EAA6E;IAC7E,4EAA4E;IAC5E,sBAAsB;IACtB,IAAI,MAAM,KAAK,IAAI;QAAE,GAAG,CAAC,IAAI,CAAC,MAAM,MAAM,EAAE,CAAC,CAAC;IAE9C,MAAM,aAAa,GAAG,CAAC,KAAa,EAAE,WAA8B,EAAE,GAAW,EAAQ,EAAE;QACzF,GAAG,CAAC,IAAI,CAAC,iBAAiB,GAAG,KAAK,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACtD,GAAG,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QAC7B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QACnC,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAU,EAAE;YACxC,MAAM,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;YACrB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACtB,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBAClD,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACnB,CAAC;YACD,OAAO,EAAE,CAAC;QACZ,CAAC,CAAC;QACF,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;YAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YACxB,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YAC3B,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACtB,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,KAAK,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;YAC5D,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO;gBAAE,GAAG,CAAC,IAAI,CAAC,OAAO,QAAQ,CAAC,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,CAAC;YACrE,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,QAAQ,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACnD,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACpB,CAAC,CAAC;IAEF,mBAAmB,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC;IAE7C,IAAI,MAAM,KAAK,IAAI;QAAE,GAAG,CAAC,IAAI,CAAC,aAAa,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;IAEzE,KAAK,MAAM,EAAE,IAAI,iBAAiB,EAAE,CAAC;QACnC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAS;QACpC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,YAAY,CAAC,EAAE,CAAC,CAAC;QAClD,GAAG,CAAC,IAAI,CACN,cAAc,EAAE,SAAS,IAAI,WAAW,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,uBAAuB,CAAC,CAAC,CAAC,EAAE,EAAE,CACzF,CAAC;IACJ,CAAC;IACD,GAAG,CAAC,IAAI,CAAC,4CAA4C,CAAC,CAAC;IACvD,IAAI,MAAM,KAAK,IAAI;QAAE,GAAG,CAAC,IAAI,CAAC,+CAA+C,CAAC,CAAC;IAC/E,OAAO,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;AAC/B,CAAC;AAED,SAAS,OAAO,CACd,QAA+B,EAC/B,IAAsC,EACtC,KAAa,EACb,MAAqB;IAErB,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAa;QACpB,sBAAsB;QACtB,2EAA2E;QAC3E,uEAAuE;QACvE,YAAY,QAAQ,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,MAAM,MAAM,EAAE,CAAC,IAAI;QAC1E,eAAe;QACf,gCAAgC;KACjC,CAAC;IAEF,MAAM,aAAa,GAAG,CAAC,KAAa,EAAE,WAA8B,EAAE,GAAW,EAAQ,EAAE;QACzF,GAAG,CAAC,IAAI,CAAC,sBAAsB,GAAG,IAAI,CAAC,CAAC;QACxC,GAAG,CAAC,IAAI,CAAC,cAAc,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC5C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QACnC,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAU,EAAE;YACxC,MAAM,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;YACrB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACtB,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,0BAA0B,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACjE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACnB,CAAC;YACD,OAAO,EAAE,CAAC;QACZ,CAAC,CAAC;QACF,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;YAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YACxB,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACtB,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YACxD,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,QAAQ,CAAC;YAClD,GAAG,CAAC,IAAI,CACN,OAAO,GAAG,sBAAsB,KAAK,gBAAgB,IAAI,YAAY,MAAM,YAAY,QAAQ,CAC7F,CAAC,CAAC,KAAK,CACR,KAAK,CACP,CAAC;YACF,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO;gBAAE,GAAG,CAAC,IAAI,CAAC,OAAO,QAAQ,CAAC,CAAC,CAAC,OAAO,GAAG,GAAG,CAAC,CAAC;YACrE,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,OAAO,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACnD,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClB,CAAC,CAAC;IAEF,mBAAmB,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC;IAC7C,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACd,OAAO,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;AAC/B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAC3B,KAA4B,EAC5B,IAAI,GAAe,EAAE;IAErB,MAAM,KAAK,GAAG,SAAS,EAAE,CAAC;IAC1B,MAAM,SAAS,GAAG,CAAC,CAAc,EAAe,EAAE,CAAC,CAAC;QAClD,GAAG,CAAC;QACJ,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;QAC7B,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;KACxB,CAAC,CAAC;IACH,MAAM,GAAG,GAAkB;QACzB,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,GAAG,CAAC,IAAI,CAAC,cAAc,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC;KAC9C,CAAC;IACF,mEAAmE;IACnE,4EAA4E;IAC5E,0EAA0E;IAC1E,yEAAyE;IACzE,MAAM,SAAS,GAAkB,EAAE,CAAC;IACpC,IAAI,kBAAkB,GAAG,CAAC,CAAC;IAC3B,IAAI,sBAAsB,GAAG,CAAC,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;QACpB,QAAQ,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;YACvB,KAAK,MAAM;gBACT,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAClB,MAAM;YACR,KAAK,cAAc;gBACjB,kBAAkB,IAAI,CAAC,CAAC;gBACxB,MAAM;YACR,KAAK,kBAAkB;gBACrB,sBAAsB,IAAI,CAAC,CAAC;gBAC5B,MAAM;QACV,CAAC;IACH,CAAC;IACD,MAAM,WAAW,GAAmB;QAClC,KAAK,EAAE,GAAG,CAAC,MAAM;QACjB,IAAI,EAAE,SAAS,CAAC,MAAM;QACtB,kBAAkB;QAClB,sBAAsB;QACtB,GAAG,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACnE,GAAG,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACpE,CAAC;IACF,MAAM,YAAY,GAAG,kBAAkB,CAAC,WAAW,CAAC,CAAC;IACrD,8EAA8E;IAC9E,2EAA2E;IAC3E,MAAM,IAAI,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACpE,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACpB,CAAC;IACD,MAAM,QAAQ,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,iBAAiB,CAAC;IAE9C,OAAO;QACL,SAAS;QACT,QAAQ;QACR,WAAW;QACX,YAAY;QACZ,SAAS,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,YAAY,CAAC;QACjE,KAAK,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,YAAY,CAAC;KAC1D,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Physics-map visualization — turn the composition hypergraph into Mermaid and\n * Graphviz-DOT **source text**.\n *\n * The graph is bipartite in the drawing: round nodes are *quantities*\n * (`mass`, `temperature`, …) and box nodes are *equations* — laws, bridges, or\n * proposed relations — each an n-ary junction (its source quantities point in,\n * its target points out). This makes \"equations as junctions\" literal and draws\n * n-ary edges faithfully (a single Mermaid/DOT edge can only connect two nodes).\n *\n * The model computes its own connected components over the junctions — so a\n * `--proposed` overlay participates in the clustering — and groups each component\n * into its own subgraph so the genuinely disjointed map stays legible. For the\n * pure-`BridgeEdge` case the component count matches the authoritative\n * {@link linkageMap} (pinned by a drift-guard test).\n *\n * Pure string production: no file I/O (the CLI is the only file-touching layer).\n *\n * @module composition/graph-viz\n */\n\nimport type { BridgeEdge } from './edge.js';\nimport { QUANTITY_IDENTIFICATIONS } from './compose.js';\nimport type { EvidenceTag, RelationType } from '../relations/types.js';\n\n/**\n * Epistemic status of a junction — drives node colour/shape. Bridges carry\n * their catalog confidence; `law` is a diagonal/established-physics edge;\n * `proposed` is a machine-derived, unadjudicated relation (rendered quarantined).\n *\n * @public\n */\nexport type VizStatus =\n  | 'law'\n  | 'established'\n  | 'speculative'\n  | 'highly-speculative'\n  | 'proposed'\n  | 'user'\n  | 'poster'\n  | 'association';\n\n/**\n * Every `VizStatus`, as VALUES.\n *\n * Exists so the union can be pinned at RUNTIME. `VizStatus` is a type: the\n * public-surface test pins its NAME and nothing pins its MEMBERS, so widening\n * it is invisible to every existing test. This array is what the three places\n * a status must be registered are checked against — `STATUS_STYLE` (a compile\n * error when incomplete), `STATUSES_IN_ORDER` (a plain array that would\n * SILENTLY omit a Mermaid `classDef`), and the published surface.\n *\n * @internal\n */\nexport const ALL_VIZ_STATUSES: readonly VizStatus[] = [\n  'law',\n  'established',\n  'speculative',\n  'highly-speculative',\n  'proposed',\n  'user',\n  'poster',\n  'association',\n];\n\n/**\n * A normalized equation junction: n source quantities → 1 target. The render\n * model's unit of \"equation\", decoupled from both `BridgeEdge` and the internal\n * `ProposedBridge` type (the CLI converts each into this shape).\n *\n * @public\n */\nexport interface VizJunction {\n  /** Graph id, e.g. `'be-42'` or `'IC-…'`. */\n  readonly id: string;\n  /** Short human label. */\n  readonly label: string;\n  readonly status: VizStatus;\n  /** Source quantity names. */\n  readonly sources: readonly string[];\n  /** Target quantity name. */\n  readonly target: string;\n  /**\n   * The Atlas Phase 1 relation TYPE this junction's edge records, when one was\n   * recorded. Absent means \"nobody has audited this edge\", which is a\n   * different statement from \"this edge is not an approximation\" — the\n   * filtering in {@link buildVizModel} keeps the two apart and counts them\n   * separately.\n   */\n  readonly relation?: RelationType;\n  /**\n   * The catalog id this junction's edge cross-references, when it has one.\n   * Carried so evidence can be DERIVED at read time; no evidence tag is ever\n   * stored on a junction.\n   */\n  readonly beId?: number | null;\n}\n\n/**\n * Why junctions were left out of a filtered map.\n *\n * The two dropped counts are SEPARATE on purpose. An edge dropped for not\n * matching the filter answered the question; an edge dropped for carrying no\n * overlay never got asked. Folding them together would let an unaudited graph\n * render as a complete answer to a question nobody could put to it.\n *\n * @public\n */\nexport interface VizFilterStats {\n  /** Junctions considered, before filtering. */\n  readonly total: number;\n  /** Junctions rendered. */\n  readonly kept: number;\n  /** Dropped because their recorded metadata did not match the filter. */\n  readonly droppedNotMatching: number;\n  /** Dropped because they carry no metadata the filter could read. */\n  readonly droppedMissingMetadata: number;\n  /** The `relation` filter in force, if any. */\n  readonly relation?: RelationType;\n  /** The `evidence` filter in force, if any. */\n  readonly evidence?: EvidenceTag;\n}\n\n/**\n * One connected component of the bipartite graph.\n *\n * @public\n */\nexport interface VizCluster {\n  /** Junction ids in this component. */\n  readonly junctionIds: readonly string[];\n  /** Distinct (canonical) quantity names touched by this component. */\n  readonly quantities: readonly string[];\n  /** Number of junctions (the cluster \"size\", matching `linkageMap`). */\n  readonly size: number;\n  /** Contains a `law`/`established` junction (anchored to known physics). */\n  readonly anchored: boolean;\n}\n\n/**\n * Options for {@link buildVizModel}.\n *\n * @public\n */\nexport interface VizOptions {\n  /** Diagram title (used as the graph label). */\n  readonly title?: string;\n  /** Already-normalized extra junctions to overlay (e.g. proposed relations). */\n  readonly extraJunctions?: readonly VizJunction[];\n  /**\n   * Keep only junctions whose recorded relation is this type.\n   *\n   * ⚠ Setting ANY filter changes what a missing overlay MEANS. Unfiltered, an\n   * edge with no `relation` is kept — the map is about connectivity and an\n   * unaudited edge still connects. Filtered, it is dropped, because it cannot\n   * be shown to satisfy the filter. The count of those drops is reported\n   * separately in {@link VizFilterStats} and printed in the legend.\n   */\n  readonly relation?: RelationType;\n  /**\n   * Keep only junctions whose DERIVED evidence set contains this tag.\n   *\n   * Evidence is never stored. It is derived from the catalog row named by the\n   * junction's `beId`, every time it is asked for; a junction with no numeric\n   * `beId` cannot be evaluated and counts as LACKING metadata, not as\n   * non-matching.\n   */\n  readonly evidence?: EvidenceTag;\n  /**\n   * The derivation used when `evidence` is set. The catalog derivation lives\n   * with the CLI (`cli/map-evidence.ts`), which passes it. This module does\n   * not import that derivation. A junction with a numeric `beId` and no\n   * function here cannot be evaluated, and the filter throws rather than\n   * rendering an unfiltered map as a filtered one. A junction with no numeric\n   * `beId` is lacking metadata and does not call the function.\n   */\n  readonly deriveEvidence?: (beId: number) => ReadonlySet<EvidenceTag>;\n}\n\n/**\n * The render model: normalized junctions, their connected components, and the\n * two serializers.\n *\n * @public\n */\nexport interface VizModel {\n  readonly junctions: readonly VizJunction[];\n  readonly clusters: readonly VizCluster[];\n  /** What filtering did. Present even when no filter was set (all kept). */\n  readonly filterStats: VizFilterStats;\n  /** One-line legend describing the filter, or `null` when none is in force. */\n  readonly filterLegend: string | null;\n  toMermaid(): string;\n  toDot(): string;\n}\n\n/** Fill colour + dashed flag per status. Tweak here to restyle the whole map. */\nconst STATUS_STYLE: Readonly<\n  Record<VizStatus, { readonly fill: string; readonly stroke: string; readonly dashed: boolean }>\n> = {\n  law: { fill: '#cfe3f7', stroke: '#3a6ea5', dashed: false }, // textbook law — blue\n  established: { fill: '#cde7d3', stroke: '#3f8f5b', dashed: false }, // solid bridge — green\n  speculative: { fill: '#fdebc8', stroke: '#c9881b', dashed: false }, // amber\n  'highly-speculative': { fill: '#f5c6c6', stroke: '#c0392b', dashed: false }, // red\n  proposed: { fill: '#e6e6e6', stroke: '#888888', dashed: true }, // unadjudicated — grey dashed\n  user: { fill: '#e9d8fd', stroke: '#6b46c1', dashed: false }, // user-supplied — violet\n  // Poster index (Atlas Phase 3). A derivation is a SOLID box: it is a stated\n  // claim with a recorded relation, not an unadjudicated guess like `proposed`.\n  poster: { fill: '#dbe7ff', stroke: '#4c6ef5', dashed: false }, // indigo\n  // An association is DASHED because it asserts no relation at all\n  // (`atlas/association.ts`): the dash is the only thing in the drawing that\n  // says \"this line is a resemblance, not a claim\". Do not make it solid.\n  association: { fill: '#f3f0e7', stroke: '#8d7b4f', dashed: true }, // khaki dashed\n};\n\n/** Map a `BridgeEdge` to a `VizJunction` (raw quantity names).\n *\n * The display label is the compact catalog id (`BE-<n>`) when the edge is\n * catalog-backed, else the edge's own label — a *map* reads better with short\n * junction names; the full formula stays in the catalog. */\nexport function edgeToJunction(edge: BridgeEdge): VizJunction {\n  const status: VizStatus = edge.kind === 'law' ? 'law' : edge.confidence;\n  return {\n    id: edge.id,\n    label: edge.beId != null ? `BE-${edge.beId}` : edge.label,\n    status,\n    sources: edge.sources.map((s) => s.name),\n    target: edge.target.name,\n    ...(edge.relation ? { relation: edge.relation.type } : {}),\n    beId: edge.beId,\n  };\n}\n\n/** How one junction fared against the filters. */\ntype FilterVerdict = 'keep' | 'not-matching' | 'missing-metadata';\n\n/** The overlay a filter reads off a junction or an edge. */\ninterface OverlayView {\n  readonly relation?: RelationType;\n  readonly beId?: number | null;\n}\n\nfunction judge(\n  item: OverlayView,\n  opts: Pick<VizOptions, 'relation' | 'evidence' | 'deriveEvidence'>,\n): FilterVerdict {\n  if (opts.relation !== undefined) {\n    if (item.relation === undefined) return 'missing-metadata';\n    if (item.relation !== opts.relation) return 'not-matching';\n  }\n  if (opts.evidence !== undefined) {\n    if (item.beId == null) return 'missing-metadata';\n    const derive = opts.deriveEvidence;\n    if (derive === undefined) {\n      throw new Error(\n        'evidence filter has no deriveEvidence function; catalog derivation is not in this module',\n      );\n    }\n    if (!derive(item.beId).has(opts.evidence)) return 'not-matching';\n  }\n  return 'keep';\n}\n\n/**\n * Apply the same filters `buildVizModel` applies, to a raw edge list — so the\n * TEXT map and the visual map can never disagree about what a filter selects.\n *\n * @internal — CLI support, reached through `src/cli-api.ts`.\n */\nexport function filterEdges(\n  edges: readonly BridgeEdge[],\n  opts: Pick<VizOptions, 'relation' | 'evidence' | 'deriveEvidence'>,\n): { readonly kept: BridgeEdge[]; readonly stats: VizFilterStats } {\n  const kept: BridgeEdge[] = [];\n  let droppedNotMatching = 0;\n  let droppedMissingMetadata = 0;\n  for (const e of edges) {\n    switch (judge({ relation: e.relation?.type, beId: e.beId }, opts)) {\n      case 'keep':\n        kept.push(e);\n        break;\n      case 'not-matching':\n        droppedNotMatching += 1;\n        break;\n      case 'missing-metadata':\n        droppedMissingMetadata += 1;\n        break;\n    }\n  }\n  return {\n    kept,\n    stats: {\n      total: edges.length,\n      kept: kept.length,\n      droppedNotMatching,\n      droppedMissingMetadata,\n      ...(opts.relation !== undefined ? { relation: opts.relation } : {}),\n      ...(opts.evidence !== undefined ? { evidence: opts.evidence } : {}),\n    },\n  };\n}\n\n/**\n * The legend line. It always states the lacking-metadata count, including when\n * it is zero: a printed `0` says the graph was checked and nothing was hidden,\n * whereas an omitted line says nothing at all.\n *\n * @internal — CLI support, reached through `src/cli-api.ts`.\n */\nexport function formatFilterLegend(stats: VizFilterStats): string | null {\n  const terms: string[] = [];\n  if (stats.relation !== undefined) terms.push(`relation=${stats.relation}`);\n  if (stats.evidence !== undefined) terms.push(`evidence=${stats.evidence}`);\n  if (terms.length === 0) return null;\n  return (\n    `filter: ${terms.join(' ')} — ${stats.kept} of ${stats.total} kept; ` +\n    `${stats.droppedNotMatching} dropped (did not match); ` +\n    `${stats.droppedMissingMetadata} dropped (no overlay metadata)`\n  );\n}\n\n/** Quantity-name canonicalizer from `QUANTITY_IDENTIFICATIONS` (matches `linkageMap`). */\nfunction makeCanon(): (name: string) => string {\n  const alias = new Map(QUANTITY_IDENTIFICATIONS.map((id) => [id.from, id.to]));\n  return (n) => alias.get(n) ?? n;\n}\n\n/** Distinct canonical quantity names of a junction (sources ∪ target). */\nfunction quantitiesOf(j: VizJunction): string[] {\n  return [...new Set([...j.sources, j.target])];\n}\n\n/** Union-find component grouping of junctions sharing a (canonical) quantity. */\nfunction componentsOf(junctions: readonly VizJunction[]): VizCluster[] {\n  const parent = junctions.map((_, i) => i);\n  const find = (x: number): number =>\n    parent[x] === x ? x : (parent[x] = find(parent[x]));\n  const union = (a: number, b: number): void => {\n    parent[find(a)] = find(b);\n  };\n\n  const qToJunctions = new Map<string, number[]>();\n  junctions.forEach((j, i) => {\n    for (const qty of quantitiesOf(j)) {\n      const arr = qToJunctions.get(qty) ?? [];\n      arr.push(i);\n      qToJunctions.set(qty, arr);\n    }\n  });\n  for (const idxs of qToJunctions.values()) {\n    for (let k = 1; k < idxs.length; k++) union(idxs[0], idxs[k]);\n  }\n\n  const groups = new Map<number, number[]>();\n  junctions.forEach((_, i) => {\n    const r = find(i);\n    const arr = groups.get(r) ?? [];\n    arr.push(i);\n    groups.set(r, arr);\n  });\n\n  const clusters = [...groups.values()].map((idxs): VizCluster => {\n    const js = idxs.map((i) => junctions[i]);\n    const quantities = [...new Set(js.flatMap(quantitiesOf))].sort();\n    return {\n      junctionIds: js.map((j) => j.id),\n      quantities,\n      size: js.length,\n      // DELIBERATE: only `law` and `established` anchor. A `poster`,\n      // `association`, `proposed` or `user` junction never does — the poster\n      // index maps claims and their supports, it does not assert that any of\n      // them is textbook physics. Widening this would make an unanchored\n      // cluster read as anchored the moment a poster overlay touched it.\n      anchored: js.some((j) => j.status === 'law' || j.status === 'established'),\n    };\n  });\n  // Deterministic: largest first, then by first junction id.\n  clusters.sort(\n    (a, b) => b.size - a.size || a.junctionIds[0].localeCompare(b.junctionIds[0]),\n  );\n  return clusters;\n}\n\n/** A stable, collision-free id factory mapping arbitrary keys to safe ids. */\nfunction idFactory(prefix: string): (key: string) => string {\n  const seen = new Map<string, string>();\n  const used = new Set<string>();\n  return (key) => {\n    const cached = seen.get(key);\n    if (cached) return cached;\n    const base = `${prefix}_${key.replace(/[^A-Za-z0-9]/g, '_')}`;\n    let id = base;\n    let n = 1;\n    while (used.has(id)) id = `${base}_${n++}`;\n    used.add(id);\n    seen.set(key, id);\n    return id;\n  };\n}\n\n/** Escape a label for Mermaid `[\"…\"]` — XML-entity-encode the characters that\n *  break the quoted form or are read as entities (`&`, `\"`, `<`, `>`). */\nconst mmLabel = (s: string): string =>\n  s\n    .replace(/\\r\\n|\\r|\\n/g, ' ')\n    .replace(/&/g, '&amp;')\n    .replace(/\"/g, '&quot;')\n    .replace(/</g, '&lt;')\n    .replace(/>/g, '&gt;');\n/** Escape a label for a DOT double-quoted string. */\nconst dotLabel = (s: string): string =>\n  s.replace(/\\r\\n|\\r|\\n/g, ' ').replace(/\\\\/g, '\\\\\\\\').replace(/\"/g, '\\\\\"');\n\n/**\n * Mermaid `classDef` emission order.\n *\n * ⚠ A plain array, so a status MISSING here does not fail to compile — it\n * silently omits that status's `classDef` and the node renders unstyled. That\n * is why `ALL_VIZ_STATUSES` exists and why a test compares the two sets.\n */\nconst STATUSES_IN_ORDER: readonly VizStatus[] = [\n  'law',\n  'established',\n  'speculative',\n  'highly-speculative',\n  'proposed',\n  'user',\n  'poster',\n  'association',\n];\n\n/**\n * Drive a format-specific cluster renderer over the standard layout, identical\n * for both emitters: multi-junction components first (each its own subgraph,\n * keyed `0`,`1`,…, labelled `anchored cluster (n)` / `cluster (n)`), then a\n * single `iso` subgraph collecting all singletons. The callback owns all\n * per-format string production; this owns only the traversal and labelling.\n */\nfunction forEachClusterGroup(\n  clusters: readonly VizCluster[],\n  renderCluster: (label: string, junctionIds: readonly string[], key: string) => void,\n): void {\n  const multi = clusters.filter((c) => c.size > 1);\n  const singletons = clusters.filter((c) => c.size === 1);\n  multi.forEach((c, i) =>\n    renderCluster(`${c.anchored ? 'anchored ' : ''}cluster (${c.size})`, c.junctionIds, String(i)),\n  );\n  if (singletons.length) {\n    renderCluster(\n      `isolated (${singletons.length})`,\n      singletons.flatMap((c) => c.junctionIds),\n      'iso',\n    );\n  }\n}\n\nfunction emitMermaid(\n  clusters: readonly VizCluster[],\n  byId: ReadonlyMap<string, VizJunction>,\n  title: string,\n  legend: string | null,\n): string {\n  const qid = idFactory('q');\n  const jid = idFactory('j');\n  const usedStatuses = new Set<VizStatus>();\n  const out: string[] = [`flowchart LR`, `%% ${title}`];\n  // The legend is a comment AND a rendered node: a comment alone disappears in\n  // every renderer, and a filtered map that does not say it is filtered reads\n  // as the whole graph.\n  if (legend !== null) out.push(`%% ${legend}`);\n\n  const renderCluster = (label: string, junctionIds: readonly string[], key: string): void => {\n    out.push(`  subgraph cl_${key}[\"${mmLabel(label)}\"]`);\n    out.push(`    direction LR`);\n    const declared = new Set<string>();\n    const declareQ = (name: string): string => {\n      const id = qid(name);\n      if (!declared.has(id)) {\n        out.push(`    ${id}([\"${mmLabel(name)}\"]):::qty`);\n        declared.add(id);\n      }\n      return id;\n    };\n    for (const id of junctionIds) {\n      const j = byId.get(id)!;\n      usedStatuses.add(j.status);\n      const jId = jid(j.id);\n      out.push(`    ${jId}[\"${mmLabel(j.label)}\"]:::${j.status}`);\n      for (const s of j.sources) out.push(`    ${declareQ(s)} --> ${jId}`);\n      out.push(`    ${jId} --> ${declareQ(j.target)}`);\n    }\n    out.push(`  end`);\n  };\n\n  forEachClusterGroup(clusters, renderCluster);\n\n  if (legend !== null) out.push(`  legend[\"${mmLabel(legend)}\"]:::legend`);\n\n  for (const st of STATUSES_IN_ORDER) {\n    if (!usedStatuses.has(st)) continue;\n    const { fill, stroke, dashed } = STATUS_STYLE[st];\n    out.push(\n      `  classDef ${st} fill:${fill},stroke:${stroke}${dashed ? ',stroke-dasharray:4 3' : ''}`,\n    );\n  }\n  out.push(`  classDef qty fill:#ffffff,stroke:#999999`);\n  if (legend !== null) out.push(`  classDef legend fill:#ffffff,stroke:#333333`);\n  return out.join('\\n') + '\\n';\n}\n\nfunction emitDot(\n  clusters: readonly VizCluster[],\n  byId: ReadonlyMap<string, VizJunction>,\n  title: string,\n  legend: string | null,\n): string {\n  const qid = idFactory('q');\n  const jid = idFactory('j');\n  const out: string[] = [\n    `digraph PhysicsMap {`,\n    // DOT's label is a single quoted string and `dotLabel` collapses newlines,\n    // so the legend joins the title on one line rather than being dropped.\n    `  label=\"${dotLabel(legend === null ? title : `${title} — ${legend}`)}\";`,\n    `  rankdir=LR;`,\n    `  node [fontname=\"Helvetica\"];`,\n  ];\n\n  const renderCluster = (label: string, junctionIds: readonly string[], key: string): void => {\n    out.push(`  subgraph cluster_${key} {`);\n    out.push(`    label=\"${dotLabel(label)}\";`);\n    const declared = new Set<string>();\n    const declareQ = (name: string): string => {\n      const id = qid(name);\n      if (!declared.has(id)) {\n        out.push(`    ${id} [shape=ellipse,label=\"${dotLabel(name)}\"];`);\n        declared.add(id);\n      }\n      return id;\n    };\n    for (const id of junctionIds) {\n      const j = byId.get(id)!;\n      const jId = jid(j.id);\n      const { fill, stroke, dashed } = STATUS_STYLE[j.status];\n      const style = dashed ? 'filled,dashed' : 'filled';\n      out.push(\n        `    ${jId} [shape=box,style=\"${style}\",fillcolor=\"${fill}\",color=\"${stroke}\",label=\"${dotLabel(\n          j.label,\n        )}\"];`,\n      );\n      for (const s of j.sources) out.push(`    ${declareQ(s)} -> ${jId};`);\n      out.push(`    ${jId} -> ${declareQ(j.target)};`);\n    }\n    out.push(`  }`);\n  };\n\n  forEachClusterGroup(clusters, renderCluster);\n  out.push(`}`);\n  return out.join('\\n') + '\\n';\n}\n\n/**\n * Build the bipartite, clustered render model from a graph (+ optional overlay).\n * Quantity names are canonicalized via `QUANTITY_IDENTIFICATIONS` so the\n * clustering matches the authoritative {@link linkageMap}.\n *\n * @public\n */\nexport function buildVizModel(\n  edges: readonly BridgeEdge[],\n  opts: VizOptions = {},\n): VizModel {\n  const canon = makeCanon();\n  const normalize = (j: VizJunction): VizJunction => ({\n    ...j,\n    sources: j.sources.map(canon),\n    target: canon(j.target),\n  });\n  const all: VizJunction[] = [\n    ...edges.map((e) => normalize(edgeToJunction(e))),\n    ...(opts.extraJunctions ?? []).map(normalize),\n  ];\n  // Filtering is applied to the OVERLAY junctions too. A proposed or\n  // user-supplied junction carries no relation and no beId, so a filtered map\n  // drops it as lacking metadata — the same rule as any other edge, and the\n  // count says so out loud rather than letting the overlay vanish quietly.\n  const junctions: VizJunction[] = [];\n  let droppedNotMatching = 0;\n  let droppedMissingMetadata = 0;\n  for (const j of all) {\n    switch (judge(j, opts)) {\n      case 'keep':\n        junctions.push(j);\n        break;\n      case 'not-matching':\n        droppedNotMatching += 1;\n        break;\n      case 'missing-metadata':\n        droppedMissingMetadata += 1;\n        break;\n    }\n  }\n  const filterStats: VizFilterStats = {\n    total: all.length,\n    kept: junctions.length,\n    droppedNotMatching,\n    droppedMissingMetadata,\n    ...(opts.relation !== undefined ? { relation: opts.relation } : {}),\n    ...(opts.evidence !== undefined ? { evidence: opts.evidence } : {}),\n  };\n  const filterLegend = formatFilterLegend(filterStats);\n  // A duplicate junction id (e.g. a proposed overlay colliding with an edge id)\n  // would silently drop one from the rendered output — make it a loud error.\n  const byId = new Map<string, VizJunction>();\n  for (const j of junctions) {\n    if (byId.has(j.id)) {\n      throw new Error(`buildVizModel: duplicate junction id '${j.id}'`);\n    }\n    byId.set(j.id, j);\n  }\n  const clusters = componentsOf(junctions);\n  const title = opts.title ?? 'UPT physics map';\n\n  return {\n    junctions,\n    clusters,\n    filterStats,\n    filterLegend,\n    toMermaid: () => emitMermaid(clusters, byId, title, filterLegend),\n    toDot: () => emitDot(clusters, byId, title, filterLegend),\n  };\n}\n"]}
+{"version":3,"file":"graph-viz.js","sourceRoot":"","sources":["../../src/composition/graph-viz.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAGH,OAAO,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,MAAM,wBAAwB,CAAC;AAoBpF;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAyB;IACpD,KAAK;IACL,aAAa;IACb,aAAa;IACb,oBAAoB;IACpB,UAAU;IACV,MAAM;IACN,QAAQ;IACR,aAAa;CACd,CAAC;AAqIF,iFAAiF;AACjF,MAAM,YAAY,GAEd;IACF,GAAG,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,sBAAsB;IAClF,WAAW,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,uBAAuB;IAC3F,WAAW,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,QAAQ;IAC5E,oBAAoB,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,MAAM;IACnF,QAAQ,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,8BAA8B;IAC9F,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,yBAAyB;IACtF,4EAA4E;IAC5E,8EAA8E;IAC9E,MAAM,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,SAAS;IACxE,iEAAiE;IACjE,2EAA2E;IAC3E,wEAAwE;IACxE,WAAW,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,eAAe;CACnF,CAAC;AAEF;;;;4DAI4D;AAC5D,MAAM,UAAU,cAAc,CAAC,IAAgB;IAC7C,MAAM,MAAM,GAAc,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC;IACxE,OAAO;QACL,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,KAAK,EAAE,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK;QACzD,MAAM;QACN,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;QACxC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI;QACxB,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1D,IAAI,EAAE,IAAI,CAAC,IAAI;KAChB,CAAC;AACJ,CAAC;AAWD,SAAS,KAAK,CACZ,IAAiB,EACjB,IAAkE;IAElE,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QAChC,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS;YAAE,OAAO,kBAAkB,CAAC;QAC3D,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ;YAAE,OAAO,cAAc,CAAC;IAC7D,CAAC;IACD,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QAChC,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI;YAAE,OAAO,kBAAkB,CAAC;QACjD,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC;QACnC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,MAAM,IAAI,KAAK,CACb,0FAA0F,CAC3F,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC;YAAE,OAAO,cAAc,CAAC;IACnE,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CACzB,KAA4B,EAC5B,IAAkE;IAElE,MAAM,IAAI,GAAiB,EAAE,CAAC;IAC9B,IAAI,kBAAkB,GAAG,CAAC,CAAC;IAC3B,IAAI,sBAAsB,GAAG,CAAC,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,QAAQ,KAAK,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;YAClE,KAAK,MAAM;gBACT,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACb,MAAM;YACR,KAAK,cAAc;gBACjB,kBAAkB,IAAI,CAAC,CAAC;gBACxB,MAAM;YACR,KAAK,kBAAkB;gBACrB,sBAAsB,IAAI,CAAC,CAAC;gBAC5B,MAAM;QACV,CAAC;IACH,CAAC;IACD,OAAO;QACL,IAAI;QACJ,KAAK,EAAE;YACL,KAAK,EAAE,KAAK,CAAC,MAAM;YACnB,IAAI,EAAE,IAAI,CAAC,MAAM;YACjB,kBAAkB;YAClB,sBAAsB;YACtB,GAAG,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACnE,GAAG,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACpE;KACF,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAqB;IACtD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,YAAY,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;IAC3E,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,YAAY,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;IAC3E,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACpC,OAAO,CACL,WAAW,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,KAAK,CAAC,KAAK,SAAS;QACrE,GAAG,KAAK,CAAC,kBAAkB,4BAA4B;QACvD,GAAG,KAAK,CAAC,sBAAsB,gCAAgC,CAChE,CAAC;AACJ,CAAC;AAED,0EAA0E;AAC1E,SAAS,YAAY,CAAC,CAAc;IAClC,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;AAChD,CAAC;AAED;;;;GAIG;AACH,SAAS,YAAY,CAAC,SAAiC;IACrD,OAAO,mBAAmB,CAAC,SAAS,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAc,EAAE;QACtF,MAAM,UAAU,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACjE,OAAO;YACL,WAAW,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAChC,UAAU;YACV,IAAI,EAAE,EAAE,CAAC,MAAM;YACf,+DAA+D;YAC/D,uEAAuE;YACvE,uEAAuE;YACvE,mEAAmE;YACnE,mEAAmE;YACnE,QAAQ,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,KAAK,IAAI,CAAC,CAAC,MAAM,KAAK,aAAa,CAAC;SAC3E,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAED,8EAA8E;AAC9E,SAAS,SAAS,CAAC,MAAc;IAC/B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,OAAO,CAAC,GAAG,EAAE,EAAE;QACb,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC;QAC1B,MAAM,IAAI,GAAG,GAAG,MAAM,IAAI,GAAG,CAAC,OAAO,CAAC,eAAe,EAAE,GAAG,CAAC,EAAE,CAAC;QAC9D,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,EAAE,GAAG,GAAG,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;QAC3C,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACb,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QAClB,OAAO,EAAE,CAAC;IACZ,CAAC,CAAC;AACJ,CAAC;AAED;0EAC0E;AAC1E,MAAM,OAAO,GAAG,CAAC,CAAS,EAAU,EAAE,CACpC,CAAC;KACE,OAAO,CAAC,aAAa,EAAE,GAAG,CAAC;KAC3B,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC;KACtB,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC;KACvB,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC;KACrB,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;AAC3B,qDAAqD;AACrD,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAU,EAAE,CACrC,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAE5E;;;;;;GAMG;AACH,MAAM,iBAAiB,GAAyB;IAC9C,KAAK;IACL,aAAa;IACb,aAAa;IACb,oBAAoB;IACpB,UAAU;IACV,MAAM;IACN,QAAQ;IACR,aAAa;CACd,CAAC;AAEF;;;;;;GAMG;AACH,SAAS,mBAAmB,CAC1B,QAA+B,EAC/B,aAAmF;IAEnF,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;IACjD,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC;IACxD,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACrB,aAAa,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAC/F,CAAC;IACF,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC;QACtB,aAAa,CACX,aAAa,UAAU,CAAC,MAAM,GAAG,EACjC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,EACxC,KAAK,CACN,CAAC;IACJ,CAAC;AACH,CAAC;AAED,SAAS,WAAW,CAClB,QAA+B,EAC/B,IAAsC,EACtC,KAAa,EACb,MAAqB;IAErB,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,YAAY,GAAG,IAAI,GAAG,EAAa,CAAC;IAC1C,MAAM,GAAG,GAAa,CAAC,cAAc,EAAE,MAAM,KAAK,EAAE,CAAC,CAAC;IACtD,6EAA6E;IAC7E,4EAA4E;IAC5E,sBAAsB;IACtB,IAAI,MAAM,KAAK,IAAI;QAAE,GAAG,CAAC,IAAI,CAAC,MAAM,MAAM,EAAE,CAAC,CAAC;IAE9C,MAAM,aAAa,GAAG,CAAC,KAAa,EAAE,WAA8B,EAAE,GAAW,EAAQ,EAAE;QACzF,GAAG,CAAC,IAAI,CAAC,iBAAiB,GAAG,KAAK,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACtD,GAAG,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QAC7B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QACnC,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAU,EAAE;YACxC,MAAM,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;YACrB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACtB,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBAClD,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACnB,CAAC;YACD,OAAO,EAAE,CAAC;QACZ,CAAC,CAAC;QACF,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;YAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YACxB,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YAC3B,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACtB,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,KAAK,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;YAC5D,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO;gBAAE,GAAG,CAAC,IAAI,CAAC,OAAO,QAAQ,CAAC,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,CAAC;YACrE,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,QAAQ,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACnD,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACpB,CAAC,CAAC;IAEF,mBAAmB,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC;IAE7C,IAAI,MAAM,KAAK,IAAI;QAAE,GAAG,CAAC,IAAI,CAAC,aAAa,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;IAEzE,KAAK,MAAM,EAAE,IAAI,iBAAiB,EAAE,CAAC;QACnC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAS;QACpC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,YAAY,CAAC,EAAE,CAAC,CAAC;QAClD,GAAG,CAAC,IAAI,CACN,cAAc,EAAE,SAAS,IAAI,WAAW,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,uBAAuB,CAAC,CAAC,CAAC,EAAE,EAAE,CACzF,CAAC;IACJ,CAAC;IACD,GAAG,CAAC,IAAI,CAAC,4CAA4C,CAAC,CAAC;IACvD,IAAI,MAAM,KAAK,IAAI;QAAE,GAAG,CAAC,IAAI,CAAC,+CAA+C,CAAC,CAAC;IAC/E,OAAO,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;AAC/B,CAAC;AAED,SAAS,OAAO,CACd,QAA+B,EAC/B,IAAsC,EACtC,KAAa,EACb,MAAqB;IAErB,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAa;QACpB,sBAAsB;QACtB,2EAA2E;QAC3E,uEAAuE;QACvE,YAAY,QAAQ,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,MAAM,MAAM,EAAE,CAAC,IAAI;QAC1E,eAAe;QACf,gCAAgC;KACjC,CAAC;IAEF,MAAM,aAAa,GAAG,CAAC,KAAa,EAAE,WAA8B,EAAE,GAAW,EAAQ,EAAE;QACzF,GAAG,CAAC,IAAI,CAAC,sBAAsB,GAAG,IAAI,CAAC,CAAC;QACxC,GAAG,CAAC,IAAI,CAAC,cAAc,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC5C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QACnC,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAU,EAAE;YACxC,MAAM,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;YACrB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACtB,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,0BAA0B,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACjE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACnB,CAAC;YACD,OAAO,EAAE,CAAC;QACZ,CAAC,CAAC;QACF,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;YAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YACxB,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACtB,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YACxD,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,QAAQ,CAAC;YAClD,GAAG,CAAC,IAAI,CACN,OAAO,GAAG,sBAAsB,KAAK,gBAAgB,IAAI,YAAY,MAAM,YAAY,QAAQ,CAC7F,CAAC,CAAC,KAAK,CACR,KAAK,CACP,CAAC;YACF,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO;gBAAE,GAAG,CAAC,IAAI,CAAC,OAAO,QAAQ,CAAC,CAAC,CAAC,OAAO,GAAG,GAAG,CAAC,CAAC;YACrE,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,OAAO,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACnD,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClB,CAAC,CAAC;IAEF,mBAAmB,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC;IAC7C,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACd,OAAO,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;AAC/B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAC3B,KAA4B,EAC5B,IAAI,GAAe,EAAE;IAErB,MAAM,KAAK,GAAG,qBAAqB,EAAE,CAAC;IACtC,MAAM,SAAS,GAAG,CAAC,CAAc,EAAe,EAAE,CAAC,CAAC;QAClD,GAAG,CAAC;QACJ,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;QAC7B,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;KACxB,CAAC,CAAC;IACH,MAAM,GAAG,GAAkB;QACzB,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,GAAG,CAAC,IAAI,CAAC,cAAc,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC;KAC9C,CAAC;IACF,mEAAmE;IACnE,4EAA4E;IAC5E,0EAA0E;IAC1E,yEAAyE;IACzE,MAAM,SAAS,GAAkB,EAAE,CAAC;IACpC,IAAI,kBAAkB,GAAG,CAAC,CAAC;IAC3B,IAAI,sBAAsB,GAAG,CAAC,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;QACpB,QAAQ,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;YACvB,KAAK,MAAM;gBACT,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAClB,MAAM;YACR,KAAK,cAAc;gBACjB,kBAAkB,IAAI,CAAC,CAAC;gBACxB,MAAM;YACR,KAAK,kBAAkB;gBACrB,sBAAsB,IAAI,CAAC,CAAC;gBAC5B,MAAM;QACV,CAAC;IACH,CAAC;IACD,MAAM,WAAW,GAAmB;QAClC,KAAK,EAAE,GAAG,CAAC,MAAM;QACjB,IAAI,EAAE,SAAS,CAAC,MAAM;QACtB,kBAAkB;QAClB,sBAAsB;QACtB,GAAG,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACnE,GAAG,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACpE,CAAC;IACF,MAAM,YAAY,GAAG,kBAAkB,CAAC,WAAW,CAAC,CAAC;IACrD,8EAA8E;IAC9E,2EAA2E;IAC3E,MAAM,IAAI,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACpE,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACpB,CAAC;IACD,MAAM,QAAQ,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,iBAAiB,CAAC;IAE9C,OAAO;QACL,SAAS;QACT,QAAQ;QACR,WAAW;QACX,YAAY;QACZ,SAAS,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,YAAY,CAAC;QACjE,KAAK,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,YAAY,CAAC;KAC1D,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Physics-map visualization — turn the composition hypergraph into Mermaid and\n * Graphviz-DOT **source text**.\n *\n * The graph is bipartite in the drawing: round nodes are *quantities*\n * (`mass`, `temperature`, …) and box nodes are *equations* — laws, bridges, or\n * proposed relations — each an n-ary junction (its source quantities point in,\n * its target points out). This makes \"equations as junctions\" literal and draws\n * n-ary edges faithfully (a single Mermaid/DOT edge can only connect two nodes).\n *\n * The model computes its own connected components over the junctions — so a\n * `--proposed` overlay participates in the clustering — and groups each component\n * into its own subgraph so the genuinely disjointed map stays legible. For the\n * pure-`BridgeEdge` case the component count matches the authoritative\n * {@link linkageMap} (pinned by a drift-guard test).\n *\n * Pure string production: no file I/O (the CLI is the only file-touching layer).\n *\n * @module composition/graph-viz\n */\n\nimport type { BridgeEdge } from './edge.js';\nimport { clusterBySharedKeys, quantityCanonicalizer } from './quantity-clusters.js';\nimport type { EvidenceTag, RelationType } from '../relations/types.js';\n\n/**\n * Epistemic status of a junction — drives node colour/shape. Bridges carry\n * their catalog confidence; `law` is a diagonal/established-physics edge;\n * `proposed` is a machine-derived, unadjudicated relation (rendered quarantined).\n *\n * @public\n */\nexport type VizStatus =\n  | 'law'\n  | 'established'\n  | 'speculative'\n  | 'highly-speculative'\n  | 'proposed'\n  | 'user'\n  | 'poster'\n  | 'association';\n\n/**\n * Every `VizStatus`, as VALUES.\n *\n * Exists so the union can be pinned at RUNTIME. `VizStatus` is a type: the\n * public-surface test pins its NAME and nothing pins its MEMBERS, so widening\n * it is invisible to every existing test. This array is what the three places\n * a status must be registered are checked against — `STATUS_STYLE` (a compile\n * error when incomplete), `STATUSES_IN_ORDER` (a plain array that would\n * SILENTLY omit a Mermaid `classDef`), and the published surface.\n *\n * @internal\n */\nexport const ALL_VIZ_STATUSES: readonly VizStatus[] = [\n  'law',\n  'established',\n  'speculative',\n  'highly-speculative',\n  'proposed',\n  'user',\n  'poster',\n  'association',\n];\n\n/**\n * A normalized equation junction: n source quantities → 1 target. The render\n * model's unit of \"equation\", decoupled from both `BridgeEdge` and the internal\n * `ProposedBridge` type (the CLI converts each into this shape).\n *\n * @public\n */\nexport interface VizJunction {\n  /** Graph id, e.g. `'be-42'` or `'IC-…'`. */\n  readonly id: string;\n  /** Short human label. */\n  readonly label: string;\n  readonly status: VizStatus;\n  /** Source quantity names. */\n  readonly sources: readonly string[];\n  /** Target quantity name. */\n  readonly target: string;\n  /**\n   * The Atlas Phase 1 relation TYPE this junction's edge records, when one was\n   * recorded. Absent means \"nobody has audited this edge\", which is a\n   * different statement from \"this edge is not an approximation\" — the\n   * filtering in {@link buildVizModel} keeps the two apart and counts them\n   * separately.\n   */\n  readonly relation?: RelationType;\n  /**\n   * The catalog id this junction's edge cross-references, when it has one.\n   * Carried so evidence can be DERIVED at read time; no evidence tag is ever\n   * stored on a junction.\n   */\n  readonly beId?: number | null;\n}\n\n/**\n * Why junctions were left out of a filtered map.\n *\n * The two dropped counts are SEPARATE on purpose. An edge dropped for not\n * matching the filter answered the question; an edge dropped for carrying no\n * overlay never got asked. Folding them together would let an unaudited graph\n * render as a complete answer to a question nobody could put to it.\n *\n * @public\n */\nexport interface VizFilterStats {\n  /** Junctions considered, before filtering. */\n  readonly total: number;\n  /** Junctions rendered. */\n  readonly kept: number;\n  /** Dropped because their recorded metadata did not match the filter. */\n  readonly droppedNotMatching: number;\n  /** Dropped because they carry no metadata the filter could read. */\n  readonly droppedMissingMetadata: number;\n  /** The `relation` filter in force, if any. */\n  readonly relation?: RelationType;\n  /** The `evidence` filter in force, if any. */\n  readonly evidence?: EvidenceTag;\n}\n\n/**\n * One connected component of the bipartite graph.\n *\n * @public\n */\nexport interface VizCluster {\n  /** Junction ids in this component. */\n  readonly junctionIds: readonly string[];\n  /** Distinct (canonical) quantity names touched by this component. */\n  readonly quantities: readonly string[];\n  /** Number of junctions (the cluster \"size\", matching `linkageMap`). */\n  readonly size: number;\n  /** Contains a `law`/`established` junction (anchored to known physics). */\n  readonly anchored: boolean;\n}\n\n/**\n * Options for {@link buildVizModel}.\n *\n * @public\n */\nexport interface VizOptions {\n  /** Diagram title (used as the graph label). */\n  readonly title?: string;\n  /** Already-normalized extra junctions to overlay (e.g. proposed relations). */\n  readonly extraJunctions?: readonly VizJunction[];\n  /**\n   * Keep only junctions whose recorded relation is this type.\n   *\n   * ⚠ Setting ANY filter changes what a missing overlay MEANS. Unfiltered, an\n   * edge with no `relation` is kept — the map is about connectivity and an\n   * unaudited edge still connects. Filtered, it is dropped, because it cannot\n   * be shown to satisfy the filter. The count of those drops is reported\n   * separately in {@link VizFilterStats} and printed in the legend.\n   */\n  readonly relation?: RelationType;\n  /**\n   * Keep only junctions whose DERIVED evidence set contains this tag.\n   *\n   * Evidence is never stored. It is derived from the catalog row named by the\n   * junction's `beId`, every time it is asked for; a junction with no numeric\n   * `beId` cannot be evaluated and counts as LACKING metadata, not as\n   * non-matching.\n   */\n  readonly evidence?: EvidenceTag;\n  /**\n   * The derivation used when `evidence` is set. The catalog derivation lives\n   * with the CLI (`cli/map-evidence.ts`), which passes it. This module does\n   * not import that derivation. A junction with a numeric `beId` and no\n   * function here cannot be evaluated, and the filter throws rather than\n   * rendering an unfiltered map as a filtered one. A junction with no numeric\n   * `beId` is lacking metadata and does not call the function.\n   */\n  readonly deriveEvidence?: (beId: number) => ReadonlySet<EvidenceTag>;\n}\n\n/**\n * The render model: normalized junctions, their connected components, and the\n * two serializers.\n *\n * @public\n */\nexport interface VizModel {\n  readonly junctions: readonly VizJunction[];\n  readonly clusters: readonly VizCluster[];\n  /** What filtering did. Present even when no filter was set (all kept). */\n  readonly filterStats: VizFilterStats;\n  /** One-line legend describing the filter, or `null` when none is in force. */\n  readonly filterLegend: string | null;\n  toMermaid(): string;\n  toDot(): string;\n}\n\n/** Fill colour + dashed flag per status. Tweak here to restyle the whole map. */\nconst STATUS_STYLE: Readonly<\n  Record<VizStatus, { readonly fill: string; readonly stroke: string; readonly dashed: boolean }>\n> = {\n  law: { fill: '#cfe3f7', stroke: '#3a6ea5', dashed: false }, // textbook law — blue\n  established: { fill: '#cde7d3', stroke: '#3f8f5b', dashed: false }, // solid bridge — green\n  speculative: { fill: '#fdebc8', stroke: '#c9881b', dashed: false }, // amber\n  'highly-speculative': { fill: '#f5c6c6', stroke: '#c0392b', dashed: false }, // red\n  proposed: { fill: '#e6e6e6', stroke: '#888888', dashed: true }, // unadjudicated — grey dashed\n  user: { fill: '#e9d8fd', stroke: '#6b46c1', dashed: false }, // user-supplied — violet\n  // Poster index (Atlas Phase 3). A derivation is a SOLID box: it is a stated\n  // claim with a recorded relation, not an unadjudicated guess like `proposed`.\n  poster: { fill: '#dbe7ff', stroke: '#4c6ef5', dashed: false }, // indigo\n  // An association is DASHED because it asserts no relation at all\n  // (`atlas/association.ts`): the dash is the only thing in the drawing that\n  // says \"this line is a resemblance, not a claim\". Do not make it solid.\n  association: { fill: '#f3f0e7', stroke: '#8d7b4f', dashed: true }, // khaki dashed\n};\n\n/** Map a `BridgeEdge` to a `VizJunction` (raw quantity names).\n *\n * The display label is the compact catalog id (`BE-<n>`) when the edge is\n * catalog-backed, else the edge's own label — a *map* reads better with short\n * junction names; the full formula stays in the catalog. */\nexport function edgeToJunction(edge: BridgeEdge): VizJunction {\n  const status: VizStatus = edge.kind === 'law' ? 'law' : edge.confidence;\n  return {\n    id: edge.id,\n    label: edge.beId != null ? `BE-${edge.beId}` : edge.label,\n    status,\n    sources: edge.sources.map((s) => s.name),\n    target: edge.target.name,\n    ...(edge.relation ? { relation: edge.relation.type } : {}),\n    beId: edge.beId,\n  };\n}\n\n/** How one junction fared against the filters. */\ntype FilterVerdict = 'keep' | 'not-matching' | 'missing-metadata';\n\n/** The overlay a filter reads off a junction or an edge. */\ninterface OverlayView {\n  readonly relation?: RelationType;\n  readonly beId?: number | null;\n}\n\nfunction judge(\n  item: OverlayView,\n  opts: Pick<VizOptions, 'relation' | 'evidence' | 'deriveEvidence'>,\n): FilterVerdict {\n  if (opts.relation !== undefined) {\n    if (item.relation === undefined) return 'missing-metadata';\n    if (item.relation !== opts.relation) return 'not-matching';\n  }\n  if (opts.evidence !== undefined) {\n    if (item.beId == null) return 'missing-metadata';\n    const derive = opts.deriveEvidence;\n    if (derive === undefined) {\n      throw new Error(\n        'evidence filter has no deriveEvidence function; catalog derivation is not in this module',\n      );\n    }\n    if (!derive(item.beId).has(opts.evidence)) return 'not-matching';\n  }\n  return 'keep';\n}\n\n/**\n * Apply the same filters `buildVizModel` applies, to a raw edge list — so the\n * TEXT map and the visual map can never disagree about what a filter selects.\n *\n * @internal — CLI support, reached through `src/cli-api.ts`.\n */\nexport function filterEdges(\n  edges: readonly BridgeEdge[],\n  opts: Pick<VizOptions, 'relation' | 'evidence' | 'deriveEvidence'>,\n): { readonly kept: BridgeEdge[]; readonly stats: VizFilterStats } {\n  const kept: BridgeEdge[] = [];\n  let droppedNotMatching = 0;\n  let droppedMissingMetadata = 0;\n  for (const e of edges) {\n    switch (judge({ relation: e.relation?.type, beId: e.beId }, opts)) {\n      case 'keep':\n        kept.push(e);\n        break;\n      case 'not-matching':\n        droppedNotMatching += 1;\n        break;\n      case 'missing-metadata':\n        droppedMissingMetadata += 1;\n        break;\n    }\n  }\n  return {\n    kept,\n    stats: {\n      total: edges.length,\n      kept: kept.length,\n      droppedNotMatching,\n      droppedMissingMetadata,\n      ...(opts.relation !== undefined ? { relation: opts.relation } : {}),\n      ...(opts.evidence !== undefined ? { evidence: opts.evidence } : {}),\n    },\n  };\n}\n\n/**\n * The legend line. It always states the lacking-metadata count, including when\n * it is zero: a printed `0` says the graph was checked and nothing was hidden,\n * whereas an omitted line says nothing at all.\n *\n * @internal — CLI support, reached through `src/cli-api.ts`.\n */\nexport function formatFilterLegend(stats: VizFilterStats): string | null {\n  const terms: string[] = [];\n  if (stats.relation !== undefined) terms.push(`relation=${stats.relation}`);\n  if (stats.evidence !== undefined) terms.push(`evidence=${stats.evidence}`);\n  if (terms.length === 0) return null;\n  return (\n    `filter: ${terms.join(' ')} — ${stats.kept} of ${stats.total} kept; ` +\n    `${stats.droppedNotMatching} dropped (did not match); ` +\n    `${stats.droppedMissingMetadata} dropped (no overlay metadata)`\n  );\n}\n\n/** Distinct canonical quantity names of a junction (sources ∪ target). */\nfunction quantitiesOf(j: VizJunction): string[] {\n  return [...new Set([...j.sources, j.target])];\n}\n\n/**\n * Component grouping of junctions sharing a (canonical) quantity: the shared partition of\n * `quantity-clusters.ts`, in the order the map always drew (largest first, then by first\n * junction id; input order inside). The anchoring rule below is this module's own.\n */\nfunction componentsOf(junctions: readonly VizJunction[]): VizCluster[] {\n  return clusterBySharedKeys(junctions, quantitiesOf, (j) => j.id).map((js): VizCluster => {\n    const quantities = [...new Set(js.flatMap(quantitiesOf))].sort();\n    return {\n      junctionIds: js.map((j) => j.id),\n      quantities,\n      size: js.length,\n      // DELIBERATE: only `law` and `established` anchor. A `poster`,\n      // `association`, `proposed` or `user` junction never does — the poster\n      // index maps claims and their supports, it does not assert that any of\n      // them is textbook physics. Widening this would make an unanchored\n      // cluster read as anchored the moment a poster overlay touched it.\n      anchored: js.some((j) => j.status === 'law' || j.status === 'established'),\n    };\n  });\n}\n\n/** A stable, collision-free id factory mapping arbitrary keys to safe ids. */\nfunction idFactory(prefix: string): (key: string) => string {\n  const seen = new Map<string, string>();\n  const used = new Set<string>();\n  return (key) => {\n    const cached = seen.get(key);\n    if (cached) return cached;\n    const base = `${prefix}_${key.replace(/[^A-Za-z0-9]/g, '_')}`;\n    let id = base;\n    let n = 1;\n    while (used.has(id)) id = `${base}_${n++}`;\n    used.add(id);\n    seen.set(key, id);\n    return id;\n  };\n}\n\n/** Escape a label for Mermaid `[\"…\"]` — XML-entity-encode the characters that\n *  break the quoted form or are read as entities (`&`, `\"`, `<`, `>`). */\nconst mmLabel = (s: string): string =>\n  s\n    .replace(/\\r\\n|\\r|\\n/g, ' ')\n    .replace(/&/g, '&amp;')\n    .replace(/\"/g, '&quot;')\n    .replace(/</g, '&lt;')\n    .replace(/>/g, '&gt;');\n/** Escape a label for a DOT double-quoted string. */\nconst dotLabel = (s: string): string =>\n  s.replace(/\\r\\n|\\r|\\n/g, ' ').replace(/\\\\/g, '\\\\\\\\').replace(/\"/g, '\\\\\"');\n\n/**\n * Mermaid `classDef` emission order.\n *\n * ⚠ A plain array, so a status MISSING here does not fail to compile — it\n * silently omits that status's `classDef` and the node renders unstyled. That\n * is why `ALL_VIZ_STATUSES` exists and why a test compares the two sets.\n */\nconst STATUSES_IN_ORDER: readonly VizStatus[] = [\n  'law',\n  'established',\n  'speculative',\n  'highly-speculative',\n  'proposed',\n  'user',\n  'poster',\n  'association',\n];\n\n/**\n * Drive a format-specific cluster renderer over the standard layout, identical\n * for both emitters: multi-junction components first (each its own subgraph,\n * keyed `0`,`1`,…, labelled `anchored cluster (n)` / `cluster (n)`), then a\n * single `iso` subgraph collecting all singletons. The callback owns all\n * per-format string production; this owns only the traversal and labelling.\n */\nfunction forEachClusterGroup(\n  clusters: readonly VizCluster[],\n  renderCluster: (label: string, junctionIds: readonly string[], key: string) => void,\n): void {\n  const multi = clusters.filter((c) => c.size > 1);\n  const singletons = clusters.filter((c) => c.size === 1);\n  multi.forEach((c, i) =>\n    renderCluster(`${c.anchored ? 'anchored ' : ''}cluster (${c.size})`, c.junctionIds, String(i)),\n  );\n  if (singletons.length) {\n    renderCluster(\n      `isolated (${singletons.length})`,\n      singletons.flatMap((c) => c.junctionIds),\n      'iso',\n    );\n  }\n}\n\nfunction emitMermaid(\n  clusters: readonly VizCluster[],\n  byId: ReadonlyMap<string, VizJunction>,\n  title: string,\n  legend: string | null,\n): string {\n  const qid = idFactory('q');\n  const jid = idFactory('j');\n  const usedStatuses = new Set<VizStatus>();\n  const out: string[] = [`flowchart LR`, `%% ${title}`];\n  // The legend is a comment AND a rendered node: a comment alone disappears in\n  // every renderer, and a filtered map that does not say it is filtered reads\n  // as the whole graph.\n  if (legend !== null) out.push(`%% ${legend}`);\n\n  const renderCluster = (label: string, junctionIds: readonly string[], key: string): void => {\n    out.push(`  subgraph cl_${key}[\"${mmLabel(label)}\"]`);\n    out.push(`    direction LR`);\n    const declared = new Set<string>();\n    const declareQ = (name: string): string => {\n      const id = qid(name);\n      if (!declared.has(id)) {\n        out.push(`    ${id}([\"${mmLabel(name)}\"]):::qty`);\n        declared.add(id);\n      }\n      return id;\n    };\n    for (const id of junctionIds) {\n      const j = byId.get(id)!;\n      usedStatuses.add(j.status);\n      const jId = jid(j.id);\n      out.push(`    ${jId}[\"${mmLabel(j.label)}\"]:::${j.status}`);\n      for (const s of j.sources) out.push(`    ${declareQ(s)} --> ${jId}`);\n      out.push(`    ${jId} --> ${declareQ(j.target)}`);\n    }\n    out.push(`  end`);\n  };\n\n  forEachClusterGroup(clusters, renderCluster);\n\n  if (legend !== null) out.push(`  legend[\"${mmLabel(legend)}\"]:::legend`);\n\n  for (const st of STATUSES_IN_ORDER) {\n    if (!usedStatuses.has(st)) continue;\n    const { fill, stroke, dashed } = STATUS_STYLE[st];\n    out.push(\n      `  classDef ${st} fill:${fill},stroke:${stroke}${dashed ? ',stroke-dasharray:4 3' : ''}`,\n    );\n  }\n  out.push(`  classDef qty fill:#ffffff,stroke:#999999`);\n  if (legend !== null) out.push(`  classDef legend fill:#ffffff,stroke:#333333`);\n  return out.join('\\n') + '\\n';\n}\n\nfunction emitDot(\n  clusters: readonly VizCluster[],\n  byId: ReadonlyMap<string, VizJunction>,\n  title: string,\n  legend: string | null,\n): string {\n  const qid = idFactory('q');\n  const jid = idFactory('j');\n  const out: string[] = [\n    `digraph PhysicsMap {`,\n    // DOT's label is a single quoted string and `dotLabel` collapses newlines,\n    // so the legend joins the title on one line rather than being dropped.\n    `  label=\"${dotLabel(legend === null ? title : `${title} — ${legend}`)}\";`,\n    `  rankdir=LR;`,\n    `  node [fontname=\"Helvetica\"];`,\n  ];\n\n  const renderCluster = (label: string, junctionIds: readonly string[], key: string): void => {\n    out.push(`  subgraph cluster_${key} {`);\n    out.push(`    label=\"${dotLabel(label)}\";`);\n    const declared = new Set<string>();\n    const declareQ = (name: string): string => {\n      const id = qid(name);\n      if (!declared.has(id)) {\n        out.push(`    ${id} [shape=ellipse,label=\"${dotLabel(name)}\"];`);\n        declared.add(id);\n      }\n      return id;\n    };\n    for (const id of junctionIds) {\n      const j = byId.get(id)!;\n      const jId = jid(j.id);\n      const { fill, stroke, dashed } = STATUS_STYLE[j.status];\n      const style = dashed ? 'filled,dashed' : 'filled';\n      out.push(\n        `    ${jId} [shape=box,style=\"${style}\",fillcolor=\"${fill}\",color=\"${stroke}\",label=\"${dotLabel(\n          j.label,\n        )}\"];`,\n      );\n      for (const s of j.sources) out.push(`    ${declareQ(s)} -> ${jId};`);\n      out.push(`    ${jId} -> ${declareQ(j.target)};`);\n    }\n    out.push(`  }`);\n  };\n\n  forEachClusterGroup(clusters, renderCluster);\n  out.push(`}`);\n  return out.join('\\n') + '\\n';\n}\n\n/**\n * Build the bipartite, clustered render model from a graph (+ optional overlay).\n * Quantity names are canonicalized via `QUANTITY_IDENTIFICATIONS` so the\n * clustering matches the authoritative {@link linkageMap}.\n *\n * @public\n */\nexport function buildVizModel(\n  edges: readonly BridgeEdge[],\n  opts: VizOptions = {},\n): VizModel {\n  const canon = quantityCanonicalizer();\n  const normalize = (j: VizJunction): VizJunction => ({\n    ...j,\n    sources: j.sources.map(canon),\n    target: canon(j.target),\n  });\n  const all: VizJunction[] = [\n    ...edges.map((e) => normalize(edgeToJunction(e))),\n    ...(opts.extraJunctions ?? []).map(normalize),\n  ];\n  // Filtering is applied to the OVERLAY junctions too. A proposed or\n  // user-supplied junction carries no relation and no beId, so a filtered map\n  // drops it as lacking metadata — the same rule as any other edge, and the\n  // count says so out loud rather than letting the overlay vanish quietly.\n  const junctions: VizJunction[] = [];\n  let droppedNotMatching = 0;\n  let droppedMissingMetadata = 0;\n  for (const j of all) {\n    switch (judge(j, opts)) {\n      case 'keep':\n        junctions.push(j);\n        break;\n      case 'not-matching':\n        droppedNotMatching += 1;\n        break;\n      case 'missing-metadata':\n        droppedMissingMetadata += 1;\n        break;\n    }\n  }\n  const filterStats: VizFilterStats = {\n    total: all.length,\n    kept: junctions.length,\n    droppedNotMatching,\n    droppedMissingMetadata,\n    ...(opts.relation !== undefined ? { relation: opts.relation } : {}),\n    ...(opts.evidence !== undefined ? { evidence: opts.evidence } : {}),\n  };\n  const filterLegend = formatFilterLegend(filterStats);\n  // A duplicate junction id (e.g. a proposed overlay colliding with an edge id)\n  // would silently drop one from the rendered output — make it a loud error.\n  const byId = new Map<string, VizJunction>();\n  for (const j of junctions) {\n    if (byId.has(j.id)) {\n      throw new Error(`buildVizModel: duplicate junction id '${j.id}'`);\n    }\n    byId.set(j.id, j);\n  }\n  const clusters = componentsOf(junctions);\n  const title = opts.title ?? 'UPT physics map';\n\n  return {\n    junctions,\n    clusters,\n    filterStats,\n    filterLegend,\n    toMermaid: () => emitMermaid(clusters, byId, title, filterLegend),\n    toDot: () => emitDot(clusters, byId, title, filterLegend),\n  };\n}\n"]}

package/dist/composition/grounding.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"grounding.d.ts","sourceRoot":"","sources":["../../src/composition/grounding.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AACH,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AACtD,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AAE1D,0EAA0E;AAC1E,MAAM,WAAW,kBAAkB;IACjC,mEAAmE;IACnE,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC,oFAAoF;IACpF,QAAQ,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,CAAC;IACjC;;;;;;;;;;;;OAYG;IACH,QAAQ,CAAC,eAAe,EAAE,KAAK,CAAC;IAChC;;;;;;;;;;;;;;OAcG;IACH,QAAQ,CAAC,UAAU,EAAE,KAAK,CAAC;CAC5B;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,iBAAiB,CAC/B,CAAC,EAAE,eAAe,EAClB,WAAW,CAAC,EAAE,iBAAiB,GAC9B,kBAAkB,CA2CpB;AAED,oGAAoG;AACpG,MAAM,MAAM,oBAAoB,GAAG,WAAW,GAAG,MAAM,GAAG,aAAa,CAAC;AAExE;;;;GAIG;AACH,MAAM,WAAW,kBAAkB;IACjC,6EAA6E;IAC7E,QAAQ,CAAC,SAAS,EAAE;QAAE,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;QAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;KAAE,CAAC;IACrF,wGAAwG;IACxG,QAAQ,CAAC,IAAI,EAAE,WAAW,GAAG,gBAAgB,CAAC;IAC9C;;;;;OAKG;IACH,QAAQ,CAAC,UAAU,EAAE;QACnB,QAAQ,CAAC,QAAQ,EAAE,SAAS,oBAAoB,EAAE,CAAC;QACnD,QAAQ,CAAC,SAAS,EAAE,SAAS,oBAAoB,EAAE,CAAC;KACrD,CAAC;IACF,QAAQ,CAAC,eAAe,EAAE,KAAK,CAAC;IAChC,QAAQ,CAAC,UAAU,EAAE,KAAK,CAAC;IAC3B,gGAAgG;IAChG,QAAQ,CAAC,KAAK,EAAE;QACd,6DAA6D;QAC7D,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;QACzB,yFAAyF;QACzF,QAAQ,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC;QACzC,kFAAkF;QAClF,QAAQ,CAAC,SAAS,EAAE,SAAS;YAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;YAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,MAAM,EAAE,CAAA;SAAE,EAAE,CAAC;QAChG,6DAA6D;QAC7D,QAAQ,CAAC,oBAAoB,EAAE,OAAO,CAAC;KACxC,CAAC;IACF,+DAA+D;IAC/D,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;CAC9B;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,eAAe,EAAE,WAAW,CAAC,EAAE,iBAAiB,GAAG,kBAAkB,CA6BzG"}
+{"version":3,"file":"grounding.d.ts","sourceRoot":"","sources":["../../src/composition/grounding.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AACH,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAEtD,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AAE1D,0EAA0E;AAC1E,MAAM,WAAW,kBAAkB;IACjC,mEAAmE;IACnE,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC,oFAAoF;IACpF,QAAQ,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,CAAC;IACjC;;;;;;;;;;;;OAYG;IACH,QAAQ,CAAC,eAAe,EAAE,KAAK,CAAC;IAChC;;;;;;;;;;;;;;OAcG;IACH,QAAQ,CAAC,UAAU,EAAE,KAAK,CAAC;CAC5B;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,iBAAiB,CAC/B,CAAC,EAAE,eAAe,EAClB,WAAW,CAAC,EAAE,iBAAiB,GAC9B,kBAAkB,CAiDpB;AAED,oGAAoG;AACpG,MAAM,MAAM,oBAAoB,GAAG,WAAW,GAAG,MAAM,GAAG,aAAa,CAAC;AAExE;;;;GAIG;AACH,MAAM,WAAW,kBAAkB;IACjC,6EAA6E;IAC7E,QAAQ,CAAC,SAAS,EAAE;QAAE,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;QAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;KAAE,CAAC;IACrF,wGAAwG;IACxG,QAAQ,CAAC,IAAI,EAAE,WAAW,GAAG,gBAAgB,CAAC;IAC9C;;;;;OAKG;IACH,QAAQ,CAAC,UAAU,EAAE;QACnB,QAAQ,CAAC,QAAQ,EAAE,SAAS,oBAAoB,EAAE,CAAC;QACnD,QAAQ,CAAC,SAAS,EAAE,SAAS,oBAAoB,EAAE,CAAC;KACrD,CAAC;IACF,QAAQ,CAAC,eAAe,EAAE,KAAK,CAAC;IAChC,QAAQ,CAAC,UAAU,EAAE,KAAK,CAAC;IAC3B,gGAAgG;IAChG,QAAQ,CAAC,KAAK,EAAE;QACd,6DAA6D;QAC7D,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;QACzB,yFAAyF;QACzF,QAAQ,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC;QACzC,kFAAkF;QAClF,QAAQ,CAAC,SAAS,EAAE,SAAS;YAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;YAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,MAAM,EAAE,CAAA;SAAE,EAAE,CAAC;QAChG,6DAA6D;QAC7D,QAAQ,CAAC,oBAAoB,EAAE,OAAO,CAAC;KACxC,CAAC;IACF,+DAA+D;IAC/D,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;CAC9B;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,eAAe,EAAE,WAAW,CAAC,EAAE,iBAAiB,GAAG,kBAAkB,CAgCzG"}