nirs4all-ui 0.1.12 → 0.1.13

package/dist/dag/collapse.js

@@ -0,0 +1,210 @@
+/**
+ * Collapse a graph against a set of collapsed group ids → the *effective* graph
+ * actually drawn.
+ *
+ * Collapsing a cluster hides all of its leaf nodes and replaces them with a
+ * single super-node; every edge that crossed the cluster boundary is re-routed
+ * to that super-node, and edges fully inside a collapsed cluster disappear. This
+ * is what keeps a 6000-node graph readable: the effective graph shrinks to the
+ * clusters the user has chosen to open. Pure + testable — no layout, no React.
+ */
+import { dagCategory } from "./types.js";
+/** Prefix distinguishing a collapsed-group super-node id from a real node id. */
+export const GROUP_NODE_PREFIX = "grp:";
+/** Outermost collapsed group on a node's ancestor chain wins (it hides the rest). */
+function representativeOf(hierarchy, nodeId, collapsed) {
+    let current = hierarchy.nodeGroupId.get(nodeId) ?? null;
+    let outermostCollapsed = null;
+    while (current !== null) {
+        if (collapsed.has(current))
+            outermostCollapsed = current;
+        current = hierarchy.groups.get(current)?.parent ?? null;
+    }
+    if (outermostCollapsed !== null) {
+        return { id: GROUP_NODE_PREFIX + outermostCollapsed, collapsedGroupId: outermostCollapsed };
+    }
+    return { id: nodeId, collapsedGroupId: null };
+}
+/** Innermost expanded (visible) group that should frame a visible node. */
+function visibleContainer(hierarchy, innermostGroupId, collapsed) {
+    let current = innermostGroupId;
+    while (current !== null) {
+        if (!collapsed.has(current))
+            return current;
+        current = hierarchy.groups.get(current)?.parent ?? null;
+    }
+    return null;
+}
+function dominantCategory(counts) {
+    let best = "group";
+    let bestN = -1;
+    for (const [cat, n] of counts) {
+        if (n > bestN) {
+            best = cat;
+            bestN = n;
+        }
+    }
+    return best;
+}
+/**
+ * Compute the effective (collapsed) graph. `collapsed` holds group ids from the
+ * {@link DagHierarchy}; an empty set returns the fully-expanded graph.
+ */
+export function computeEffectiveGraph(graph, hierarchy, collapsed) {
+    const rep = new Map();
+    const nodes = [];
+    const superNodes = new Map();
+    // dominant-category vote per collapsed group
+    const groupCats = new Map();
+    // original node id → shape leaving it (for edge labels + node chips)
+    const outShapeById = new Map();
+    for (const node of graph.nodes)
+        if (node.io?.out)
+            outShapeById.set(node.id, node.io.out);
+    for (const node of graph.nodes) {
+        const r = representativeOf(hierarchy, node.id, collapsed);
+        rep.set(node.id, r);
+        if (r.collapsedGroupId === null) {
+            const innermost = hierarchy.nodeGroupId.get(node.id) ?? null;
+            const category = dagCategory(node.kind);
+            const eff = {
+                id: node.id,
+                isGroup: false,
+                category,
+                label: node.label ?? shortLabel(node.id),
+                containerId: visibleContainer(hierarchy, innermost, collapsed),
+            };
+            if (node.detail !== undefined)
+                eff.detail = node.detail;
+            if (node.kind !== undefined)
+                eff.kind = node.kind;
+            if (node.status !== undefined)
+                eff.status = node.status;
+            if (node.variants !== undefined)
+                eff.variants = node.variants;
+            if (node.metric !== undefined)
+                eff.metric = node.metric;
+            if (node.io?.out !== undefined)
+                eff.outShape = node.io.out;
+            if (node.io?.in !== undefined)
+                eff.inShapes = node.io.in;
+            nodes.push(eff);
+        }
+        else {
+            const votes = groupCats.get(r.collapsedGroupId) ?? new Map();
+            const cat = dagCategory(node.kind);
+            votes.set(cat, (votes.get(cat) ?? 0) + 1);
+            groupCats.set(r.collapsedGroupId, votes);
+            if (!superNodes.has(r.id)) {
+                const group = hierarchy.groups.get(r.collapsedGroupId);
+                const parent = group?.parent ?? null;
+                const eff = {
+                    id: r.id,
+                    isGroup: true,
+                    category: "group",
+                    label: group?.label ?? r.collapsedGroupId,
+                    containerId: visibleContainer(hierarchy, parent, collapsed),
+                    childCount: group?.descendantLeafCount ?? 0,
+                    groupId: r.collapsedGroupId,
+                };
+                superNodes.set(r.id, eff);
+                nodes.push(eff);
+            }
+        }
+    }
+    // Resolve each super-node's dominant category from the collected votes.
+    for (const [groupId, votes] of groupCats) {
+        const eff = superNodes.get(GROUP_NODE_PREFIX + groupId);
+        if (eff)
+            eff.category = dominantCategory(votes);
+    }
+    const edgeMap = new Map();
+    for (const edge of graph.edges) {
+        const s = rep.get(edge.source)?.id;
+        const t = rep.get(edge.target)?.id;
+        if (s === undefined || t === undefined || s === t)
+            continue;
+        const key = `${s}
${t}`;
+        const existing = edgeMap.get(key);
+        if (existing) {
+            existing.weight += 1;
+            existing.oof = existing.oof || edge.oof === true;
+            if (existing.kind === undefined && edge.kind !== undefined)
+                existing.kind = edge.kind;
+            continue;
+        }
+        const eff = { id: key, source: s, target: t, oof: edge.oof === true, weight: 1 };
+        if (edge.kind !== undefined)
+            eff.kind = edge.kind;
+        const shape = outShapeById.get(edge.source);
+        if (shape !== undefined)
+            eff.shape = shape;
+        edgeMap.set(key, eff);
+    }
+    return { nodes, edges: [...edgeMap.values()] };
+}
+/** Last `.`/`:`/`/` segment of an id — a readable fallback node label. */
+export function shortLabel(id) {
+    const parts = id.split(/[./]/);
+    return parts[parts.length - 1] ?? id;
+}
+/**
+ * Collapse every cluster at exactly `depth` (deeper ones are hidden inside them,
+ * so they need not be listed). `depth < 0` or `depth > maxDepth` → fully
+ * expanded. This is the primitive behind the depth stepper and expand/collapse
+ * all.
+ */
+export function collapseAtDepth(hierarchy, depth) {
+    const collapsed = new Set();
+    if (depth < 0)
+        return collapsed;
+    for (const group of hierarchy.groups.values()) {
+        if (group.depth === depth)
+            collapsed.add(group.id);
+    }
+    return collapsed;
+}
+/**
+ * Choose an initial collapse state. With an explicit `depth`, collapse to it.
+ * Otherwise pick the most-expanded depth whose visible node count still fits
+ * under `targetVisible` — so a small graph opens fully and a 6000-node graph
+ * opens as a handful of clusters.
+ */
+export function defaultCollapsed(hierarchy, totalNodes, options = {}) {
+    const maxDepth = hierarchy.maxDepth;
+    if (options.depth !== undefined) {
+        return { collapsed: collapseAtDepth(hierarchy, options.depth), depth: options.depth };
+    }
+    const target = options.targetVisible ?? 160;
+    if (maxDepth < 0 || totalNodes <= target) {
+        return { collapsed: new Set(), depth: maxDepth + 1 };
+    }
+    const groupsAtDepth = new Array(maxDepth + 1).fill(0);
+    for (const group of hierarchy.groups.values()) {
+        groupsAtDepth[group.depth] = groupsAtDepth[group.depth] + 1;
+    }
+    const leafByDepth = new Map();
+    for (const gid of hierarchy.nodeGroupId.values()) {
+        const d = gid === null ? -1 : hierarchy.groups.get(gid)?.depth ?? -1;
+        leafByDepth.set(d, (leafByDepth.get(d) ?? 0) + 1);
+    }
+    const visibleAt = (d) => {
+        let leaves = 0;
+        for (const [depth, count] of leafByDepth)
+            if (depth < d)
+                leaves += count;
+        return leaves + (groupsAtDepth[d] ?? 0);
+    };
+    // visible count grows monotonically with depth → keep the deepest that fits.
+    let best = 0;
+    for (let d = 0; d <= maxDepth + 1; d += 1) {
+        const visible = d > maxDepth ? totalNodes : visibleAt(d);
+        if (visible <= target)
+            best = d;
+    }
+    return {
+        collapsed: best > maxDepth ? new Set() : collapseAtDepth(hierarchy, best),
+        depth: best,
+    };
+}
+//# sourceMappingURL=collapse.js.map

package/dist/dag/collapse.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"collapse.js","sourceRoot":"","sources":["../../src/dag/collapse.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,WAAW,EAAoE,MAAM,YAAY,CAAC;AAG3G,iFAAiF;AACjF,MAAM,CAAC,MAAM,iBAAiB,GAAG,MAAM,CAAC;AAgDxC,qFAAqF;AACrF,SAAS,gBAAgB,CACvB,SAAuB,EACvB,MAAc,EACd,SAA8B;IAE9B,IAAI,OAAO,GAAG,SAAS,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC;IACxD,IAAI,kBAAkB,GAAkB,IAAI,CAAC;IAC7C,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;QACxB,IAAI,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC;YAAE,kBAAkB,GAAG,OAAO,CAAC;QACzD,OAAO,GAAG,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,MAAM,IAAI,IAAI,CAAC;IAC1D,CAAC;IACD,IAAI,kBAAkB,KAAK,IAAI,EAAE,CAAC;QAChC,OAAO,EAAE,EAAE,EAAE,iBAAiB,GAAG,kBAAkB,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,CAAC;IAC9F,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,gBAAgB,EAAE,IAAI,EAAE,CAAC;AAChD,CAAC;AAED,2EAA2E;AAC3E,SAAS,gBAAgB,CACvB,SAAuB,EACvB,gBAA+B,EAC/B,SAA8B;IAE9B,IAAI,OAAO,GAAG,gBAAgB,CAAC;IAC/B,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;QACxB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC;YAAE,OAAO,OAAO,CAAC;QAC5C,OAAO,GAAG,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,MAAM,IAAI,IAAI,CAAC;IAC1D,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,gBAAgB,CAAC,MAAgC;IACxD,IAAI,IAAI,GAAgB,OAAO,CAAC;IAChC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;IACf,KAAK,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,MAAM,EAAE,CAAC;QAC9B,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC;YACd,IAAI,GAAG,GAAG,CAAC;YACX,KAAK,GAAG,CAAC,CAAC;QACZ,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,qBAAqB,CACnC,KAAe,EACf,SAAuB,EACvB,SAA8B;IAE9B,MAAM,GAAG,GAAG,IAAI,GAAG,EAA0B,CAAC;IAC9C,MAAM,KAAK,GAAc,EAAE,CAAC;IAC5B,MAAM,UAAU,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC9C,6CAA6C;IAC7C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoC,CAAC;IAC9D,qEAAqE;IACrE,MAAM,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAC;IACjD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK;QAAE,IAAI,IAAI,CAAC,EAAE,EAAE,GAAG;YAAE,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IAEzF,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,MAAM,CAAC,GAAG,gBAAgB,CAAC,SAAS,EAAE,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QAC1D,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAEpB,IAAI,CAAC,CAAC,gBAAgB,KAAK,IAAI,EAAE,CAAC;YAChC,MAAM,SAAS,GAAG,SAAS,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC;YAC7D,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxC,MAAM,GAAG,GAAY;gBACnB,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,OAAO,EAAE,KAAK;gBACd,QAAQ;gBACR,KAAK,EAAE,IAAI,CAAC,KAAK,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxC,WAAW,EAAE,gBAAgB,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC;aAC/D,CAAC;YACF,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;gBAAE,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YACxD,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS;gBAAE,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAClD,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;gBAAE,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YACxD,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS;gBAAE,GAAG,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;YAC9D,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;gBAAE,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YACxD,IAAI,IAAI,CAAC,EAAE,EAAE,GAAG,KAAK,SAAS;gBAAE,GAAG,CAAC,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC;YAC3D,IAAI,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,SAAS;gBAAE,GAAG,CAAC,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACzD,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAClB,CAAC;aAAM,CAAC;YACN,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,gBAAgB,CAAC,IAAI,IAAI,GAAG,EAAuB,CAAC;YAClF,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1C,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,gBAAgB,EAAE,KAAK,CAAC,CAAC;YACzC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC1B,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC;gBACvD,MAAM,MAAM,GAAG,KAAK,EAAE,MAAM,IAAI,IAAI,CAAC;gBACrC,MAAM,GAAG,GAAY;oBACnB,EAAE,EAAE,CAAC,CAAC,EAAE;oBACR,OAAO,EAAE,IAAI;oBACb,QAAQ,EAAE,OAAO;oBACjB,KAAK,EAAE,KAAK,EAAE,KAAK,IAAI,CAAC,CAAC,gBAAgB;oBACzC,WAAW,EAAE,gBAAgB,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,CAAC;oBAC3D,UAAU,EAAE,KAAK,EAAE,mBAAmB,IAAI,CAAC;oBAC3C,OAAO,EAAE,CAAC,CAAC,gBAAgB;iBAC5B,CAAC;gBACF,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;gBAC1B,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;IACH,CAAC;IAED,wEAAwE;IACxE,KAAK,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,SAAS,EAAE,CAAC;QACzC,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,iBAAiB,GAAG,OAAO,CAAC,CAAC;QACxD,IAAI,GAAG;YAAE,GAAG,CAAC,QAAQ,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IAClD,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC3C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC;QACnC,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC;YAAE,SAAS;QAC5D,MAAM,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QACxB,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAClC,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,MAAM,IAAI,CAAC,CAAC;YACrB,QAAQ,CAAC,GAAG,GAAG,QAAQ,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC;YACjD,IAAI,QAAQ,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS;gBAAE,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACtF,SAAS;QACX,CAAC;QACD,MAAM,GAAG,GAAY,EAAE,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,KAAK,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;QAC1F,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS;YAAE,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAClD,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5C,IAAI,KAAK,KAAK,SAAS;YAAE,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC;QAC3C,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACxB,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;AACjD,CAAC;AAED,0EAA0E;AAC1E,MAAM,UAAU,UAAU,CAAC,EAAU;IACnC,MAAM,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC/B,OAAO,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;AACvC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAAC,SAAuB,EAAE,KAAa;IACpE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,IAAI,KAAK,GAAG,CAAC;QAAE,OAAO,SAAS,CAAC;IAChC,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QAC9C,IAAI,KAAK,CAAC,KAAK,KAAK,KAAK;YAAE,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IACrD,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AASD;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAC9B,SAAuB,EACvB,UAAkB,EAClB,UAAkC,EAAE;IAEpC,MAAM,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC;IACpC,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QAChC,OAAO,EAAE,SAAS,EAAE,eAAe,CAAC,SAAS,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC;IACxF,CAAC;IACD,MAAM,MAAM,GAAG,OAAO,CAAC,aAAa,IAAI,GAAG,CAAC;IAC5C,IAAI,QAAQ,GAAG,CAAC,IAAI,UAAU,IAAI,MAAM,EAAE,CAAC;QACzC,OAAO,EAAE,SAAS,EAAE,IAAI,GAAG,EAAE,EAAE,KAAK,EAAE,QAAQ,GAAG,CAAC,EAAE,CAAC;IACvD,CAAC;IAED,MAAM,aAAa,GAAG,IAAI,KAAK,CAAS,QAAQ,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9D,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QAC9C,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,GAAI,aAAa,CAAC,KAAK,CAAC,KAAK,CAAY,GAAG,CAAC,CAAC;IAC1E,CAAC;IACD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC9C,KAAK,MAAM,GAAG,IAAI,SAAS,CAAC,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC;QACjD,MAAM,CAAC,GAAG,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC;QACrE,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACpD,CAAC;IACD,MAAM,SAAS,GAAG,CAAC,CAAS,EAAU,EAAE;QACtC,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,WAAW;YAAE,IAAI,KAAK,GAAG,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC;QACzE,OAAO,MAAM,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC;IAEF,6EAA6E;IAC7E,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1C,MAAM,OAAO,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACzD,IAAI,OAAO,IAAI,MAAM;YAAE,IAAI,GAAG,CAAC,CAAC;IAClC,CAAC;IACD,OAAO;QACL,SAAS,EAAE,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,GAAG,EAAU,CAAC,CAAC,CAAC,eAAe,CAAC,SAAS,EAAE,IAAI,CAAC;QACjF,KAAK,EAAE,IAAI;KACZ,CAAC;AACJ,CAAC"}

package/dist/dag/colors.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Category → color mapping for the DAG viewer.
+ *
+ * Reuses the canonical nirs4all `viz` teal system as the single source of truth
+ * (same hues as {@link file://../viz/PipelineFlow.tsx PipelineFlow}), so the DAG
+ * view sits inside the existing design language rather than introducing a new
+ * one. The adjacent-pair palette is CVD-validated; identity is never carried by
+ * color alone — every node also shows its kind label and every category appears
+ * in the legend. Hosts may retheme any slot via the `colors` prop.
+ */
+import type { DagCategory, DagEdgeKind } from "./types.js";
+export declare const DAG_CATEGORY_COLORS: Readonly<Record<DagCategory, string>>;
+/** Human-facing category labels for the legend. */
+export declare const DAG_CATEGORY_LABELS: Readonly<Record<DagCategory, string>>;
+/** Edge accent by semantic kind (mixed into the recessive base stroke). */
+export declare const DAG_EDGE_COLORS: Readonly<Record<DagEdgeKind, string>>;
+/** Resolve a category color, honoring per-host overrides. */
+export declare function categoryColor(category: DagCategory, overrides?: Partial<Record<DagCategory, string>>): string;
+//# sourceMappingURL=colors.d.ts.map

package/dist/dag/colors.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"colors.d.ts","sourceRoot":"","sources":["../../src/dag/colors.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAGH,OAAO,KAAK,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAE3D,eAAO,MAAM,mBAAmB,EAAE,QAAQ,CAAC,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,CAarE,CAAC;AAEF,mDAAmD;AACnD,eAAO,MAAM,mBAAmB,EAAE,QAAQ,CAAC,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,CAarE,CAAC;AAEF,2EAA2E;AAC3E,eAAO,MAAM,eAAe,EAAE,QAAQ,CAAC,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,CAOjE,CAAC;AAEF,6DAA6D;AAC7D,wBAAgB,aAAa,CAC3B,QAAQ,EAAE,WAAW,EACrB,SAAS,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC,GAC/C,MAAM,CAER"}

package/dist/dag/colors.js

@@ -0,0 +1,54 @@
+/**
+ * Category → color mapping for the DAG viewer.
+ *
+ * Reuses the canonical nirs4all `viz` teal system as the single source of truth
+ * (same hues as {@link file://../viz/PipelineFlow.tsx PipelineFlow}), so the DAG
+ * view sits inside the existing design language rather than introducing a new
+ * one. The adjacent-pair palette is CVD-validated; identity is never carried by
+ * color alone — every node also shows its kind label and every category appears
+ * in the legend. Hosts may retheme any slot via the `colors` prop.
+ */
+import { N4_VIZ_COLORS } from "../viz/theme.js";
+export const DAG_CATEGORY_COLORS = {
+    data: N4_VIZ_COLORS.slate,
+    split: N4_VIZ_COLORS.indigo,
+    preprocess: N4_VIZ_COLORS.cyan,
+    model: N4_VIZ_COLORS.teal,
+    merge: N4_VIZ_COLORS.green,
+    branch: N4_VIZ_COLORS.amber,
+    search: N4_VIZ_COLORS.violet,
+    aggregate: N4_VIZ_COLORS.rose,
+    subgraph: "#0284c7",
+    chart: "#db2777",
+    group: N4_VIZ_COLORS.slate,
+    unknown: N4_VIZ_COLORS.slate,
+};
+/** Human-facing category labels for the legend. */
+export const DAG_CATEGORY_LABELS = {
+    data: "Data / source",
+    split: "Split / CV",
+    preprocess: "Preprocess",
+    model: "Model",
+    merge: "Merge / join",
+    branch: "Branch",
+    search: "Variant / tune",
+    aggregate: "Aggregate",
+    subgraph: "Subgraph",
+    chart: "Chart",
+    group: "Collapsed group",
+    unknown: "Other",
+};
+/** Edge accent by semantic kind (mixed into the recessive base stroke). */
+export const DAG_EDGE_COLORS = {
+    data: N4_VIZ_COLORS.slate,
+    prediction: N4_VIZ_COLORS.teal,
+    target: N4_VIZ_COLORS.indigo,
+    artifact: N4_VIZ_COLORS.violet,
+    metric: N4_VIZ_COLORS.amber,
+    control: N4_VIZ_COLORS.rose,
+};
+/** Resolve a category color, honoring per-host overrides. */
+export function categoryColor(category, overrides) {
+    return overrides?.[category] ?? DAG_CATEGORY_COLORS[category];
+}
+//# sourceMappingURL=colors.js.map

package/dist/dag/colors.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"colors.js","sourceRoot":"","sources":["../../src/dag/colors.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAGhD,MAAM,CAAC,MAAM,mBAAmB,GAA0C;IACxE,IAAI,EAAE,aAAa,CAAC,KAAK;IACzB,KAAK,EAAE,aAAa,CAAC,MAAM;IAC3B,UAAU,EAAE,aAAa,CAAC,IAAI;IAC9B,KAAK,EAAE,aAAa,CAAC,IAAI;IACzB,KAAK,EAAE,aAAa,CAAC,KAAK;IAC1B,MAAM,EAAE,aAAa,CAAC,KAAK;IAC3B,MAAM,EAAE,aAAa,CAAC,MAAM;IAC5B,SAAS,EAAE,aAAa,CAAC,IAAI;IAC7B,QAAQ,EAAE,SAAS;IACnB,KAAK,EAAE,SAAS;IAChB,KAAK,EAAE,aAAa,CAAC,KAAK;IAC1B,OAAO,EAAE,aAAa,CAAC,KAAK;CAC7B,CAAC;AAEF,mDAAmD;AACnD,MAAM,CAAC,MAAM,mBAAmB,GAA0C;IACxE,IAAI,EAAE,eAAe;IACrB,KAAK,EAAE,YAAY;IACnB,UAAU,EAAE,YAAY;IACxB,KAAK,EAAE,OAAO;IACd,KAAK,EAAE,cAAc;IACrB,MAAM,EAAE,QAAQ;IAChB,MAAM,EAAE,gBAAgB;IACxB,SAAS,EAAE,WAAW;IACtB,QAAQ,EAAE,UAAU;IACpB,KAAK,EAAE,OAAO;IACd,KAAK,EAAE,iBAAiB;IACxB,OAAO,EAAE,OAAO;CACjB,CAAC;AAEF,2EAA2E;AAC3E,MAAM,CAAC,MAAM,eAAe,GAA0C;IACpE,IAAI,EAAE,aAAa,CAAC,KAAK;IACzB,UAAU,EAAE,aAAa,CAAC,IAAI;IAC9B,MAAM,EAAE,aAAa,CAAC,MAAM;IAC5B,QAAQ,EAAE,aAAa,CAAC,MAAM;IAC9B,MAAM,EAAE,aAAa,CAAC,KAAK;IAC3B,OAAO,EAAE,aAAa,CAAC,IAAI;CAC5B,CAAC;AAEF,6DAA6D;AAC7D,MAAM,UAAU,aAAa,CAC3B,QAAqB,EACrB,SAAgD;IAEhD,OAAO,SAAS,EAAE,CAAC,QAAQ,CAAC,IAAI,mBAAmB,CAAC,QAAQ,CAAC,CAAC;AAChE,CAAC"}

package/dist/dag/fromCompiledGraph.d.ts

@@ -0,0 +1,27 @@
+/**
+ * Adapter: a dag-ml compiled `GraphSpec` / `ExecutionPlan` → {@link DagGraph}.
+ *
+ * The package does NOT depend on dag-ml; this reads the *serialized* compiled
+ * graph (the JSON a host already has) and projects the fields the viewer needs.
+ * It is defensive because this is a real system boundary — arbitrary JSON in,
+ * a well-typed view-model out. Unknown / malformed entries are skipped, never
+ * thrown on. Recognized inputs:
+ *   • `ExecutionPlan`  → uses `graph_plan.graph`, plus `variants[]` for badges
+ *   • `{ graph: GraphSpec }`
+ *   • `GraphSpec`      → `{ nodes, edges }`
+ *
+ * Group nesting is derived from the dag-ml node-id convention
+ * (`branch:b0.model:ridge` → cluster `branch:b0`), or from `seed_label`.
+ */
+import type { DagGraph } from "./types.js";
+/** How collapsible clusters are derived from the compiled graph. */
+export type GroupBy = "id" | "seed_label" | "none";
+export interface FromCompiledGraphOptions {
+    /** Cluster derivation strategy (default `"id"`). */
+    groupBy?: GroupBy;
+    /** Show a `×N` variant badge on generator/tuner nodes (default `true`). */
+    variantBadges?: boolean;
+}
+/** Project a serialized dag-ml compiled graph into the viewer's contract. */
+export declare function fromCompiledGraph(input: unknown, options?: FromCompiledGraphOptions): DagGraph;
+//# sourceMappingURL=fromCompiledGraph.d.ts.map

package/dist/dag/fromCompiledGraph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fromCompiledGraph.d.ts","sourceRoot":"","sources":["../../src/dag/fromCompiledGraph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,KAAK,EAAwB,QAAQ,EAAW,MAAM,YAAY,CAAC;AAE1E,oEAAoE;AACpE,MAAM,MAAM,OAAO,GAAG,IAAI,GAAG,YAAY,GAAG,MAAM,CAAC;AAEnD,MAAM,WAAW,wBAAwB;IACvC,oDAAoD;IACpD,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,2EAA2E;IAC3E,aAAa,CAAC,EAAE,OAAO,CAAC;CACzB;AAsFD,6EAA6E;AAC7E,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,GAAE,wBAA6B,GAAG,QAAQ,CA4BlG"}

package/dist/dag/fromCompiledGraph.js

@@ -0,0 +1,133 @@
+/**
+ * Adapter: a dag-ml compiled `GraphSpec` / `ExecutionPlan` → {@link DagGraph}.
+ *
+ * The package does NOT depend on dag-ml; this reads the *serialized* compiled
+ * graph (the JSON a host already has) and projects the fields the viewer needs.
+ * It is defensive because this is a real system boundary — arbitrary JSON in,
+ * a well-typed view-model out. Unknown / malformed entries are skipped, never
+ * thrown on. Recognized inputs:
+ *   • `ExecutionPlan`  → uses `graph_plan.graph`, plus `variants[]` for badges
+ *   • `{ graph: GraphSpec }`
+ *   • `GraphSpec`      → `{ nodes, edges }`
+ *
+ * Group nesting is derived from the dag-ml node-id convention
+ * (`branch:b0.model:ridge` → cluster `branch:b0`), or from `seed_label`.
+ */
+const EDGE_KINDS = new Set(["data", "prediction", "target", "artifact", "metric", "control"]);
+const VARIANT_KINDS = new Set(["generator", "tuner"]);
+function isRecord(value) {
+    return typeof value === "object" && value !== null && !Array.isArray(value);
+}
+function asString(value) {
+    return typeof value === "string" && value.length > 0 ? value : undefined;
+}
+/** Unwrap the innermost `GraphSpec`-shaped object from any recognized input. */
+function resolveGraphSpec(input) {
+    let variantCount = 0;
+    let root = input;
+    if (isRecord(root) && Array.isArray(root["variants"]))
+        variantCount = root["variants"].length;
+    if (isRecord(root) && isRecord(root["graph_plan"]) && isRecord(root["graph_plan"]["graph"])) {
+        root = root["graph_plan"]["graph"];
+    }
+    else if (isRecord(root) && isRecord(root["graph"])) {
+        root = root["graph"];
+    }
+    return { spec: isRecord(root) ? root : {}, variantCount };
+}
+function groupPathFromId(id) {
+    const segments = id.split(".");
+    return segments.length > 1 ? segments.slice(0, -1) : [];
+}
+function deriveGroup(id, seedLabel, groupBy) {
+    if (groupBy === "none")
+        return [];
+    if (groupBy === "seed_label")
+        return seedLabel && seedLabel !== id ? [seedLabel] : [];
+    const byId = groupPathFromId(id);
+    if (byId.length > 0)
+        return byId;
+    return seedLabel && seedLabel !== id ? [seedLabel] : [];
+}
+function lastSegment(id) {
+    const parts = id.split(".");
+    return parts[parts.length - 1] ?? id;
+}
+function portRefNodeId(ref) {
+    if (typeof ref === "string")
+        return asString(ref);
+    if (isRecord(ref))
+        return asString(ref["node_id"]) ?? asString(ref["id"]);
+    return undefined;
+}
+function mapNode(raw, groupBy, variantCount, variantBadges) {
+    if (!isRecord(raw))
+        return null;
+    const id = asString(raw["id"]);
+    if (id === undefined)
+        return null;
+    const kind = asString(raw["kind"]);
+    const operator = raw["operator"];
+    const operatorType = isRecord(operator) ? asString(operator["type"]) : undefined;
+    const seedLabel = asString(raw["seed_label"]);
+    const group = deriveGroup(id, seedLabel, groupBy);
+    const node = { id, label: operatorType ?? lastSegment(id) };
+    if (kind !== undefined)
+        node.kind = kind;
+    if (kind !== undefined && operatorType !== undefined)
+        node.detail = kind;
+    if (group.length > 0)
+        node.group = group;
+    if (variantBadges && variantCount > 1 && kind !== undefined && VARIANT_KINDS.has(kind)) {
+        node.variants = variantCount;
+    }
+    if (isRecord(raw["metadata"]) && Object.keys(raw["metadata"]).length > 0) {
+        node.meta = raw["metadata"];
+    }
+    return node;
+}
+function mapEdge(raw) {
+    if (!isRecord(raw))
+        return null;
+    const source = portRefNodeId(raw["source"]) ?? asString(raw["from"]);
+    const target = portRefNodeId(raw["target"]) ?? asString(raw["to"]);
+    if (source === undefined || target === undefined)
+        return null;
+    const contract = isRecord(raw["contract"]) ? raw["contract"] : undefined;
+    const kindRaw = asString(contract?.["kind"]) ?? asString(raw["kind"]);
+    const edge = { source, target };
+    if (kindRaw !== undefined && EDGE_KINDS.has(kindRaw))
+        edge.kind = kindRaw;
+    if (contract?.["requires_oof"] === true)
+        edge.oof = true;
+    return edge;
+}
+/** Project a serialized dag-ml compiled graph into the viewer's contract. */
+export function fromCompiledGraph(input, options = {}) {
+    const groupBy = options.groupBy ?? "id";
+    const variantBadges = options.variantBadges ?? true;
+    const { spec, variantCount } = resolveGraphSpec(input);
+    const rawNodes = Array.isArray(spec["nodes"]) ? spec["nodes"] : [];
+    const rawEdges = Array.isArray(spec["edges"]) ? spec["edges"] : [];
+    const nodes = [];
+    const ids = new Set();
+    for (const raw of rawNodes) {
+        const node = mapNode(raw, groupBy, variantCount, variantBadges);
+        if (node && !ids.has(node.id)) {
+            ids.add(node.id);
+            nodes.push(node);
+        }
+    }
+    const edges = [];
+    for (const raw of rawEdges) {
+        const edge = mapEdge(raw);
+        if (edge && ids.has(edge.source) && ids.has(edge.target))
+            edges.push(edge);
+    }
+    const name = asString(spec["id"]) ?? (isRecord(input) ? asString(input["id"]) : undefined);
+    const graph = { nodes, edges };
+    if (name !== undefined)
+        graph.name = name;
+    return graph;
+}
+//# sourceMappingURL=fromCompiledGraph.js.map

package/dist/dag/fromCompiledGraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fromCompiledGraph.js","sourceRoot":"","sources":["../../src/dag/fromCompiledGraph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAcH,MAAM,UAAU,GAAG,IAAI,GAAG,CAAc,CAAC,MAAM,EAAE,YAAY,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC;AAC3G,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC,CAAC;AAEtD,SAAS,QAAQ,CAAC,KAAc;IAC9B,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAC9E,CAAC;AAED,SAAS,QAAQ,CAAC,KAAc;IAC9B,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;AAC3E,CAAC;AAED,gFAAgF;AAChF,SAAS,gBAAgB,CAAC,KAAc;IACtC,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,IAAI,GAAG,KAAK,CAAC;IACjB,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAAE,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC;IAC9F,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC;QAC5F,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC;IACrC,CAAC;SAAM,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC;QACrD,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;IACvB,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,YAAY,EAAE,CAAC;AAC5D,CAAC;AAED,SAAS,eAAe,CAAC,EAAU;IACjC,MAAM,QAAQ,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC/B,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AAC1D,CAAC;AAED,SAAS,WAAW,CAAC,EAAU,EAAE,SAA6B,EAAE,OAAgB;IAC9E,IAAI,OAAO,KAAK,MAAM;QAAE,OAAO,EAAE,CAAC;IAClC,IAAI,OAAO,KAAK,YAAY;QAAE,OAAO,SAAS,IAAI,SAAS,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACtF,MAAM,IAAI,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;IACjC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACjC,OAAO,SAAS,IAAI,SAAS,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AAC1D,CAAC;AAED,SAAS,WAAW,CAAC,EAAU;IAC7B,MAAM,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC5B,OAAO,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;AACvC,CAAC;AAED,SAAS,aAAa,CAAC,GAAY;IACjC,IAAI,OAAO,GAAG,KAAK,QAAQ;QAAE,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC;IAClD,IAAI,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IAC1E,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,OAAO,CAAC,GAAY,EAAE,OAAgB,EAAE,YAAoB,EAAE,aAAsB;IAC3F,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAChC,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IAC/B,IAAI,EAAE,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IAClC,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IACnC,MAAM,QAAQ,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC;IACjC,MAAM,YAAY,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACjF,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC;IAC9C,MAAM,KAAK,GAAG,WAAW,CAAC,EAAE,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;IAElD,MAAM,IAAI,GAAY,EAAE,EAAE,EAAE,KAAK,EAAE,YAAY,IAAI,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC;IACrE,IAAI,IAAI,KAAK,SAAS;QAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACzC,IAAI,IAAI,KAAK,SAAS,IAAI,YAAY,KAAK,SAAS;QAAE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;IACzE,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;QAAE,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACzC,IAAI,aAAa,IAAI,YAAY,GAAG,CAAC,IAAI,IAAI,KAAK,SAAS,IAAI,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QACvF,IAAI,CAAC,QAAQ,GAAG,YAAY,CAAC;IAC/B,CAAC;IACD,IAAI,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzE,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC,UAAU,CAA4B,CAAC;IACzD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,OAAO,CAAC,GAAY;IAC3B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAChC,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IACrE,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IACnE,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IAC9D,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACzE,MAAM,OAAO,GAAG,QAAQ,CAAC,QAAQ,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IACtE,MAAM,IAAI,GAAY,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;IACzC,IAAI,OAAO,KAAK,SAAS,IAAI,UAAU,CAAC,GAAG,CAAC,OAAsB,CAAC;QAAE,IAAI,CAAC,IAAI,GAAG,OAAsB,CAAC;IACxG,IAAI,QAAQ,EAAE,CAAC,cAAc,CAAC,KAAK,IAAI;QAAE,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC;IACzD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,6EAA6E;AAC7E,MAAM,UAAU,iBAAiB,CAAC,KAAc,EAAE,UAAoC,EAAE;IACtF,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,IAAI,CAAC;IACxC,MAAM,aAAa,GAAG,OAAO,CAAC,aAAa,IAAI,IAAI,CAAC;IACpD,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IAEvD,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACnE,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAEnE,MAAM,KAAK,GAAc,EAAE,CAAC;IAC5B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,EAAE,OAAO,EAAE,YAAY,EAAE,aAAa,CAAC,CAAC;QAChE,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAC9B,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACjB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAc,EAAE,CAAC;IAC5B,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;QAC1B,IAAI,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7E,CAAC;IAED,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAC3F,MAAM,KAAK,GAAa,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IACzC,IAAI,IAAI,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;IAC1C,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/dag/hierarchy.d.ts

@@ -0,0 +1,38 @@
+/**
+ * Group hierarchy derived from node `group` paths.
+ *
+ * A DAG is not a tree, but nodes carry a hierarchical *group* path (e.g.
+ * `["branch:b0"]`). Those paths form a nesting tree of clusters that the viewer
+ * can collapse/expand independently of the edge topology. This module turns the
+ * flat node list into that cluster tree; everything here is pure and testable.
+ */
+import type { DagGraph } from "./types.js";
+export interface DagGroup {
+    /** Stable id = the group path joined by `/`. */
+    id: string;
+    /** Innermost segment — what the frame header shows. */
+    label: string;
+    path: readonly string[];
+    /** 0 = top-level cluster. */
+    depth: number;
+    parent: string | null;
+    children: string[];
+    /** Leaf node ids whose innermost group is exactly this one. */
+    memberIds: string[];
+    /** Total leaf nodes anywhere under this cluster. */
+    descendantLeafCount: number;
+}
+export interface DagHierarchy {
+    groups: Map<string, DagGroup>;
+    /** Top-level group ids, in first-seen order. */
+    roots: string[];
+    /** node id → innermost group id (or `null` for a top-level node). */
+    nodeGroupId: Map<string, string | null>;
+    /** Deepest group depth present (−1 when the graph is flat). */
+    maxDepth: number;
+}
+/** Build the cluster tree for a graph. O(nodes × path depth). */
+export declare function buildHierarchy(graph: DagGraph): DagHierarchy;
+/** Ancestor group ids for a node, innermost → outermost. */
+export declare function ancestorGroupIds(hierarchy: DagHierarchy, nodeId: string): string[];
+//# sourceMappingURL=hierarchy.d.ts.map

package/dist/dag/hierarchy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hierarchy.d.ts","sourceRoot":"","sources":["../../src/dag/hierarchy.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAE3C,MAAM,WAAW,QAAQ;IACvB,gDAAgD;IAChD,EAAE,EAAE,MAAM,CAAC;IACX,uDAAuD;IACvD,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,SAAS,MAAM,EAAE,CAAC;IACxB,6BAA6B;IAC7B,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,+DAA+D;IAC/D,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,oDAAoD;IACpD,mBAAmB,EAAE,MAAM,CAAC;CAC7B;AAED,MAAM,WAAW,YAAY;IAC3B,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IAC9B,gDAAgD;IAChD,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,qEAAqE;IACrE,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC;IACxC,+DAA+D;IAC/D,QAAQ,EAAE,MAAM,CAAC;CAClB;AAQD,iEAAiE;AACjE,wBAAgB,cAAc,CAAC,KAAK,EAAE,QAAQ,GAAG,YAAY,CAiD5D;AAED,4DAA4D;AAC5D,wBAAgB,gBAAgB,CAAC,SAAS,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAQlF"}

package/dist/dag/hierarchy.js

@@ -0,0 +1,75 @@
+/**
+ * Group hierarchy derived from node `group` paths.
+ *
+ * A DAG is not a tree, but nodes carry a hierarchical *group* path (e.g.
+ * `["branch:b0"]`). Those paths form a nesting tree of clusters that the viewer
+ * can collapse/expand independently of the edge topology. This module turns the
+ * flat node list into that cluster tree; everything here is pure and testable.
+ */
+const SEP = "/";
+function groupIdOf(path, end) {
+    return path.slice(0, end).join(SEP);
+}
+/** Build the cluster tree for a graph. O(nodes × path depth). */
+export function buildHierarchy(graph) {
+    const groups = new Map();
+    const roots = [];
+    const nodeGroupId = new Map();
+    let maxDepth = -1;
+    const ensure = (path, depth) => {
+        const id = groupIdOf(path, depth + 1);
+        const existing = groups.get(id);
+        if (existing)
+            return existing;
+        const parentId = depth > 0 ? groupIdOf(path, depth) : null;
+        const group = {
+            id,
+            label: path[depth] ?? id,
+            path: path.slice(0, depth + 1),
+            depth,
+            parent: parentId,
+            children: [],
+            memberIds: [],
+            descendantLeafCount: 0,
+        };
+        groups.set(id, group);
+        if (parentId === null) {
+            roots.push(id);
+        }
+        else {
+            const parent = groups.get(parentId);
+            if (parent)
+                parent.children.push(id);
+        }
+        if (depth > maxDepth)
+            maxDepth = depth;
+        return group;
+    };
+    for (const node of graph.nodes) {
+        const path = node.group?.filter((seg) => seg.length > 0) ?? [];
+        if (path.length === 0) {
+            nodeGroupId.set(node.id, null);
+            continue;
+        }
+        // Materialize every prefix so intermediate clusters exist even if empty.
+        for (let depth = 0; depth < path.length; depth += 1) {
+            const group = ensure(path, depth);
+            group.descendantLeafCount += 1;
+        }
+        const innermost = ensure(path, path.length - 1);
+        innermost.memberIds.push(node.id);
+        nodeGroupId.set(node.id, innermost.id);
+    }
+    return { groups, roots, nodeGroupId, maxDepth };
+}
+/** Ancestor group ids for a node, innermost → outermost. */
+export function ancestorGroupIds(hierarchy, nodeId) {
+    const chain = [];
+    let current = hierarchy.nodeGroupId.get(nodeId) ?? null;
+    while (current !== null) {
+        chain.push(current);
+        current = hierarchy.groups.get(current)?.parent ?? null;
+    }
+    return chain;
+}
+//# sourceMappingURL=hierarchy.js.map

package/dist/dag/hierarchy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hierarchy.js","sourceRoot":"","sources":["../../src/dag/hierarchy.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AA8BH,MAAM,GAAG,GAAG,GAAG,CAAC;AAEhB,SAAS,SAAS,CAAC,IAAuB,EAAE,GAAW;IACrD,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACtC,CAAC;AAED,iEAAiE;AACjE,MAAM,UAAU,cAAc,CAAC,KAAe;IAC5C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,WAAW,GAAG,IAAI,GAAG,EAAyB,CAAC;IACrD,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC;IAElB,MAAM,MAAM,GAAG,CAAC,IAAuB,EAAE,KAAa,EAAY,EAAE;QAClE,MAAM,EAAE,GAAG,SAAS,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QACtC,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,QAAQ;YAAE,OAAO,QAAQ,CAAC;QAC9B,MAAM,QAAQ,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC3D,MAAM,KAAK,GAAa;YACtB,EAAE;YACF,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE;YACxB,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;YAC9B,KAAK;YACL,MAAM,EAAE,QAAQ;YAChB,QAAQ,EAAE,EAAE;YACZ,SAAS,EAAE,EAAE;YACb,mBAAmB,EAAE,CAAC;SACvB,CAAC;QACF,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACtB,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;YACtB,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjB,CAAC;aAAM,CAAC;YACN,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACpC,IAAI,MAAM;gBAAE,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACvC,CAAC;QACD,IAAI,KAAK,GAAG,QAAQ;YAAE,QAAQ,GAAG,KAAK,CAAC;QACvC,OAAO,KAAK,CAAC;IACf,CAAC,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QAC/D,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAC/B,SAAS;QACX,CAAC;QACD,yEAAyE;QACzE,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;YACpD,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YAClC,KAAK,CAAC,mBAAmB,IAAI,CAAC,CAAC;QACjC,CAAC;QACD,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAChD,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC;IACzC,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,CAAC;AAClD,CAAC;AAED,4DAA4D;AAC5D,MAAM,UAAU,gBAAgB,CAAC,SAAuB,EAAE,MAAc;IACtE,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,OAAO,GAAG,SAAS,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC;IACxD,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;QACxB,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACpB,OAAO,GAAG,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,MAAM,IAAI,IAAI,CAAC;IAC1D,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/dag/index.d.ts

@@ -0,0 +1,28 @@
+/**
+ * nirs4all-ui `dag` domain — the interactive compiled-DAG viewer.
+ *
+ * A dedicated, self-contained component for exploring a *compiled* DAG-ML graph
+ * (or any bound variant) at any scale: layered layout, pan / zoom, viewport
+ * culling and level-of-detail keep thousands of nodes responsive, while a
+ * collapsible group hierarchy keeps a 5–6000-node graph readable. Unlike the
+ * `viz` `PipelineFlow` (a small editable spine), this is a read-only *explorer*
+ * of the whole graph.
+ *
+ * Same package boundary as the rest of nirs4all-ui: presentational + local UI
+ * state only — NO app state, routing, network/IO, or runtime execution. Hosts
+ * pass a {@link DagGraph} (adapt a real compiled graph with
+ * {@link fromCompiledGraph}). A default stylesheet ships at
+ * `nirs4all-ui/assets/dag.css`.
+ *
+ * Consumed as `nirs4all-ui/dag`.
+ */
+export * from "./types.js";
+export * from "./colors.js";
+export * from "./fromCompiledGraph.js";
+export { deriveShapes, formatShape, formatCount, shapeChange, describeShapeDelta, SHAPE_CHANGE_STYLE, type ShapeChangeKind, type ShapeRule, type ShapeRuleContext, type DeriveShapesOptions, } from "./shape.js";
+export { DEFAULT_DAG_LABELS, resolveLabels, type DagViewLabels } from "./locale.js";
+export { buildHierarchy, ancestorGroupIds, type DagGroup, type DagHierarchy, } from "./hierarchy.js";
+export { computeEffectiveGraph, collapseAtDepth, defaultCollapsed, shortLabel, GROUP_NODE_PREFIX, type EffNode, type EffEdge, type EffectiveGraph, type DefaultCollapseOptions, } from "./collapse.js";
+export { layoutDag, type DagLayout, type DagLayoutNode, type DagLayoutEdge, type DagLayoutFrame, type LayoutOptions, } from "./layout.js";
+export { DagGraphView, type DagGraphViewProps } from "./DagGraphView.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/dag/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/dag/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAGH,cAAc,YAAY,CAAC;AAG3B,cAAc,aAAa,CAAC;AAC5B,cAAc,wBAAwB,CAAC;AAGvC,OAAO,EACL,YAAY,EACZ,WAAW,EACX,WAAW,EACX,WAAW,EACX,kBAAkB,EAClB,kBAAkB,EAClB,KAAK,eAAe,EACpB,KAAK,SAAS,EACd,KAAK,gBAAgB,EACrB,KAAK,mBAAmB,GACzB,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,kBAAkB,EAAE,aAAa,EAAE,KAAK,aAAa,EAAE,MAAM,aAAa,CAAC;AAGpF,OAAO,EACL,cAAc,EACd,gBAAgB,EAChB,KAAK,QAAQ,EACb,KAAK,YAAY,GAClB,MAAM,gBAAgB,CAAC;AACxB,OAAO,EACL,qBAAqB,EACrB,eAAe,EACf,gBAAgB,EAChB,UAAU,EACV,iBAAiB,EACjB,KAAK,OAAO,EACZ,KAAK,OAAO,EACZ,KAAK,cAAc,EACnB,KAAK,sBAAsB,GAC5B,MAAM,eAAe,CAAC;AACvB,OAAO,EACL,SAAS,EACT,KAAK,SAAS,EACd,KAAK,aAAa,EAClB,KAAK,aAAa,EAClB,KAAK,cAAc,EACnB,KAAK,aAAa,GACnB,MAAM,aAAa,CAAC;AAGrB,OAAO,EAAE,YAAY,EAAE,KAAK,iBAAiB,EAAE,MAAM,mBAAmB,CAAC"}