@flyingrobots/bijou 0.3.0 → 0.5.0

package/README.md

@@ -4,10 +4,11 @@ Themed terminal components for CLIs, loggers, and scripts — graceful degradati
 
 **Zero dependencies. Hexagonal architecture. Works everywhere.**
 
-## What's New in 0.3.0?
+## What's New in 0.5.0?
 
-- **`dag()`** — ASCII DAG renderer with auto-layout (Sugiyama-Lite), edge routing, badges, per-node tokens, path highlighting, and graceful degradation
-- **`dagSlice()`** — extract subgraphs (ancestors/descendants/neighborhood) with ghost boundary nodes
+- **`DagSource` adapter** — bring your own graph representation (database, API, adjacency matrix). DAG rendering no longer requires `DagNode[]`
+- **Traversal-based slicing** — `dagSlice()` BFS-walks via `has()`/`children()`/`parents()`, never enumerates the full graph
+- **Composable slices** — `dagSlice()` returns a `SlicedDagSource` when given `DagSource`, enabling slice-of-slice chains
 
 See the [CHANGELOG](https://github.com/flyingrobots/bijou/blob/main/docs/CHANGELOG.md) for the full release history.
 
@@ -40,7 +41,7 @@ console.log(box('Hello, world!'));
 `badge()`, `alert()`, `kbd()`, `skeleton()` — status indicators and UI primitives.
 
 ### Data
-`table()`, `tree()`, `accordion()`, `timeline()` — structured data display.
+`table()`, `tree()`, `accordion()`, `timeline()`, `dag()`, `dagSlice()`, `dagLayout()` — structured data display and DAG rendering with `DagSource` adapter for external graphs.
 
 ### Navigation
 `tabs()`, `breadcrumb()`, `stepper()`, `paginator()` — wayfinding components.

package/dist/core/components/dag-source.d.ts

@@ -0,0 +1,64 @@
+import type { TokenValue } from '../theme/tokens.js';
+import type { DagNode } from './dag.js';
+/**
+ * Adapter interface for accessing graph data. Decouples DAG rendering
+ * from any specific in-memory representation. Implementations can wrap
+ * arrays, databases, APIs, or any other graph store.
+ *
+ * A DagSource may represent an unbounded graph — it has no enumeration
+ * method. Use `dagSlice()` to BFS-walk from a focus node and produce
+ * a bounded `SlicedDagSource` that the renderer can consume.
+ */
+export interface DagSource {
+    /** Returns true if a node with this ID exists in the graph. */
+    has(id: string): boolean;
+    /** Human-readable label for a node. */
+    label(id: string): string;
+    /** Child node IDs (outgoing edges). */
+    children(id: string): readonly string[];
+    /**
+     * Parent node IDs (incoming edges). Required for ancestor traversal
+     * in `dagSlice()`. Without this, only `direction: 'descendants'` is
+     * supported.
+     */
+    parents?(id: string): readonly string[];
+    /** Optional badge text for a node. */
+    badge?(id: string): string | undefined;
+    /** Optional per-node color/style token. */
+    token?(id: string): TokenValue | undefined;
+}
+/**
+ * A bounded DagSource produced by `sliceSource()`. Extends DagSource
+ * with `ids()` so the renderer can enumerate the finite node set.
+ */
+export interface SlicedDagSource extends DagSource {
+    /** All node IDs in this bounded slice. */
+    ids(): readonly string[];
+    /** Whether this node is a ghost (boundary placeholder). */
+    ghost(id: string): boolean;
+    /** Ghost label override (e.g., "... 3 ancestors"). */
+    ghostLabel(id: string): string | undefined;
+}
+/** Options for `dagSlice()`. */
+export interface DagSliceOptions {
+    direction?: 'ancestors' | 'descendants' | 'both';
+    depth?: number;
+}
+/** Returns true if the value implements the `DagSource` interface. */
+export declare function isDagSource(value: unknown): value is DagSource;
+/** Returns true if the value is a `SlicedDagSource` (bounded, with `ids()`). */
+export declare function isSlicedDagSource(value: unknown): value is SlicedDagSource;
+/** Wraps a `DagNode[]` as a `SlicedDagSource`. Already bounded. */
+export declare function arraySource(nodes: DagNode[]): SlicedDagSource;
+/** @internal Converts a `SlicedDagSource` to `DagNode[]` for internal renderers. */
+export declare function materialize(source: SlicedDagSource): DagNode[];
+/**
+ * BFS-walks a `DagSource` from a focus node and returns a bounded
+ * `SlicedDagSource` containing only the neighborhood. Ghost nodes are
+ * injected at depth boundaries.
+ *
+ * Never calls `ids()` on the source — works purely via traversal.
+ * For ancestor/both directions, `source.parents()` must be provided.
+ */
+export declare function sliceSource(source: DagSource, focus: string, opts?: DagSliceOptions): SlicedDagSource;
+//# sourceMappingURL=dag-source.d.ts.map

package/dist/core/components/dag-source.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dag-source.d.ts","sourceRoot":"","sources":["../../../src/core/components/dag-source.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AACrD,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,UAAU,CAAC;AAIxC;;;;;;;;GAQG;AACH,MAAM,WAAW,SAAS;IACxB,+DAA+D;IAC/D,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC;IAEzB,uCAAuC;IACvC,KAAK,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,CAAC;IAE1B,uCAAuC;IACvC,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,SAAS,MAAM,EAAE,CAAC;IAExC;;;;OAIG;IACH,OAAO,CAAC,CAAC,EAAE,EAAE,MAAM,GAAG,SAAS,MAAM,EAAE,CAAC;IAExC,sCAAsC;IACtC,KAAK,CAAC,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAAC;IAEvC,2CAA2C;IAC3C,KAAK,CAAC,CAAC,EAAE,EAAE,MAAM,GAAG,UAAU,GAAG,SAAS,CAAC;CAC5C;AAED;;;GAGG;AACH,MAAM,WAAW,eAAgB,SAAQ,SAAS;IAChD,0CAA0C;IAC1C,GAAG,IAAI,SAAS,MAAM,EAAE,CAAC;IAEzB,2DAA2D;IAC3D,KAAK,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC;IAE3B,sDAAsD;IACtD,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAAC;CAC5C;AAED,gCAAgC;AAChC,MAAM,WAAW,eAAe;IAC9B,SAAS,CAAC,EAAE,WAAW,GAAG,aAAa,GAAG,MAAM,CAAC;IACjD,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAID,sEAAsE;AACtE,wBAAgB,WAAW,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,SAAS,CAS9D;AAED,gFAAgF;AAChF,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,eAAe,CAO1E;AAID,mEAAmE;AACnE,wBAAgB,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,eAAe,CA2B7D;AAID,oFAAoF;AACpF,wBAAgB,WAAW,CAAC,MAAM,EAAE,eAAe,GAAG,OAAO,EAAE,CAqB9D;AAuBD;;;;;;;GAOG;AACH,wBAAgB,WAAW,CACzB,MAAM,EAAE,SAAS,EACjB,KAAK,EAAE,MAAM,EACb,IAAI,CAAC,EAAE,eAAe,GACrB,eAAe,CAsIjB"}

package/dist/core/components/dag-source.js

@@ -0,0 +1,227 @@
+// ── Type Guard ──────────────────────────────────────────────────────
+/** Returns true if the value implements the `DagSource` interface. */
+export function isDagSource(value) {
+    return (typeof value === 'object' &&
+        value !== null &&
+        !Array.isArray(value) &&
+        typeof value.has === 'function' &&
+        typeof value.label === 'function' &&
+        typeof value.children === 'function');
+}
+/** Returns true if the value is a `SlicedDagSource` (bounded, with `ids()`). */
+export function isSlicedDagSource(value) {
+    return (isDagSource(value) &&
+        typeof value.ids === 'function' &&
+        typeof value.ghost === 'function' &&
+        typeof value.ghostLabel === 'function');
+}
+// ── arraySource ─────────────────────────────────────────────────────
+/** Wraps a `DagNode[]` as a `SlicedDagSource`. Already bounded. */
+export function arraySource(nodes) {
+    const map = new Map();
+    for (const n of nodes)
+        map.set(n.id, n);
+    // Pre-compute parent map
+    const parentMap = new Map();
+    for (const n of nodes) {
+        if (!parentMap.has(n.id))
+            parentMap.set(n.id, []);
+        for (const c of n.edges ?? []) {
+            if (!parentMap.has(c))
+                parentMap.set(c, []);
+            parentMap.get(c).push(n.id);
+        }
+    }
+    const idList = Object.freeze(nodes.map(n => n.id));
+    return {
+        ids: () => idList,
+        has: (id) => map.has(id),
+        label: (id) => map.get(id)?.label ?? id,
+        children: (id) => [...(map.get(id)?.edges ?? [])],
+        parents: (id) => [...(parentMap.get(id) ?? [])],
+        badge: (id) => map.get(id)?.badge,
+        token: (id) => map.get(id)?.token,
+        ghost: (id) => map.get(id)?._ghost ?? false,
+        ghostLabel: (id) => map.get(id)?._ghostLabel,
+    };
+}
+// ── materialize ─────────────────────────────────────────────────────
+/** @internal Converts a `SlicedDagSource` to `DagNode[]` for internal renderers. */
+export function materialize(source) {
+    const ids = source.ids();
+    const nodes = [];
+    for (const id of ids) {
+        const children = source.children(id);
+        const node = {
+            id,
+            label: source.label(id),
+            edges: children.length > 0 ? [...children] : undefined,
+        };
+        const badge = source.badge?.(id);
+        if (badge !== undefined)
+            node.badge = badge;
+        const token = source.token?.(id);
+        if (token !== undefined)
+            node.token = token;
+        if (source.ghost(id)) {
+            node._ghost = true;
+            node._ghostLabel = source.ghostLabel(id);
+        }
+        nodes.push(node);
+    }
+    return nodes;
+}
+// ── emptySource ─────────────────────────────────────────────────────
+const EMPTY_IDS = Object.freeze([]);
+/** @internal Singleton empty source for missing focus nodes. */
+const EMPTY_SOURCE = Object.freeze({
+    ids: () => EMPTY_IDS,
+    has: () => false,
+    label: () => '',
+    children: () => EMPTY_IDS,
+    ghost: () => false,
+    ghostLabel: () => undefined,
+});
+// ── Ghost ID Prefixes ───────────────────────────────────────────────
+const GHOST_ANCESTORS_PREFIX = '__ghost_ancestors_';
+const GHOST_DESCENDANTS_PREFIX = '__ghost_descendants_';
+// ── sliceSource ─────────────────────────────────────────────────────
+/**
+ * BFS-walks a `DagSource` from a focus node and returns a bounded
+ * `SlicedDagSource` containing only the neighborhood. Ghost nodes are
+ * injected at depth boundaries.
+ *
+ * Never calls `ids()` on the source — works purely via traversal.
+ * For ancestor/both directions, `source.parents()` must be provided.
+ */
+export function sliceSource(source, focus, opts) {
+    const explicitDirection = opts?.direction;
+    const direction = explicitDirection ?? 'both';
+    const maxDepth = opts?.depth ?? Infinity;
+    if (!source.has(focus))
+        return EMPTY_SOURCE;
+    const included = new Set();
+    const ghostNodes = new Map();
+    // Precomputed reverse map for when source.parents is absent
+    const derivedParents = new Map();
+    // BFS ancestors
+    if (direction === 'ancestors' || direction === 'both') {
+        if (!source.parents) {
+            if (explicitDirection === 'ancestors') {
+                throw new Error('[bijou] dagSlice(): source.parents() is required for ancestor traversal');
+            }
+            // direction defaulted to 'both' — silently downgrade to descendants-only
+        }
+        else {
+            const getParents = source.parents.bind(source);
+            const queue = [[focus, 0]];
+            const visited = new Set();
+            while (queue.length > 0) {
+                const [id, depth] = queue.shift();
+                if (visited.has(id))
+                    continue;
+                visited.add(id);
+                included.add(id);
+                if (depth < maxDepth) {
+                    for (const p of getParents(id)) {
+                        if (!visited.has(p) && source.has(p))
+                            queue.push([p, depth + 1]);
+                    }
+                }
+                else {
+                    const boundaryParents = [...getParents(id)].filter(p => !visited.has(p) && source.has(p));
+                    if (boundaryParents.length > 0) {
+                        const ghostId = `${GHOST_ANCESTORS_PREFIX}${id}`;
+                        included.add(ghostId);
+                        const count = boundaryParents.length;
+                        ghostNodes.set(ghostId, {
+                            label: `... ${count} ancestor${count !== 1 ? 's' : ''}`,
+                            edges: [id],
+                        });
+                    }
+                }
+            }
+        }
+    }
+    // BFS descendants
+    if (direction === 'descendants' || direction === 'both') {
+        const queue = [[focus, 0]];
+        const visited = new Set();
+        while (queue.length > 0) {
+            const [id, depth] = queue.shift();
+            if (visited.has(id))
+                continue;
+            visited.add(id);
+            included.add(id);
+            const ch = [...source.children(id)].filter(c => source.has(c));
+            // Track reverse edges for derived parent map
+            if (!source.parents) {
+                for (const c of ch) {
+                    if (!derivedParents.has(c))
+                        derivedParents.set(c, []);
+                    derivedParents.get(c).push(id);
+                }
+            }
+            if (depth < maxDepth) {
+                for (const c of ch) {
+                    if (!visited.has(c))
+                        queue.push([c, depth + 1]);
+                }
+            }
+            else {
+                const boundaryChildren = ch.filter(c => !visited.has(c));
+                if (boundaryChildren.length > 0) {
+                    const ghostId = `${GHOST_DESCENDANTS_PREFIX}${id}`;
+                    included.add(ghostId);
+                    const count = boundaryChildren.length;
+                    ghostNodes.set(ghostId, {
+                        label: `... ${count} descendant${count !== 1 ? 's' : ''}`,
+                        edges: [],
+                    });
+                }
+            }
+        }
+    }
+    // Build the sliced DagSource
+    const slicedIds = Object.freeze([...included]);
+    // Inherit ghost status from input when slicing a SlicedDagSource
+    const inheritGhost = isSlicedDagSource(source) ? source : null;
+    return {
+        ids: () => slicedIds,
+        has: (id) => included.has(id),
+        label: (id) => {
+            const ghost = ghostNodes.get(id);
+            if (ghost)
+                return ghost.label;
+            return source.label(id);
+        },
+        children: (id) => {
+            const ghost = ghostNodes.get(id);
+            if (ghost)
+                return [...ghost.edges];
+            // Filter to included IDs, plus any descendant ghost for this node
+            const ch = [...source.children(id)].filter(c => included.has(c));
+            const descGhostId = `${GHOST_DESCENDANTS_PREFIX}${id}`;
+            if (ghostNodes.has(descGhostId))
+                ch.push(descGhostId);
+            return ch;
+        },
+        parents: (id) => {
+            if (ghostNodes.has(id)) {
+                if (id.startsWith(GHOST_ANCESTORS_PREFIX))
+                    return [];
+                const boundaryId = id.replace(GHOST_DESCENDANTS_PREFIX, '');
+                return included.has(boundaryId) ? [boundaryId] : [];
+            }
+            if (source.parents) {
+                return [...source.parents(id)].filter(p => included.has(p));
+            }
+            return (derivedParents.get(id) ?? []).filter(p => included.has(p));
+        },
+        badge: (id) => ghostNodes.has(id) ? undefined : source.badge?.(id),
+        token: (id) => ghostNodes.has(id) ? undefined : source.token?.(id),
+        ghost: (id) => ghostNodes.has(id) || (inheritGhost !== null && inheritGhost.ghost(id)),
+        ghostLabel: (id) => ghostNodes.get(id)?.label ?? inheritGhost?.ghostLabel(id),
+    };
+}
+//# sourceMappingURL=dag-source.js.map

package/dist/core/components/dag-source.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dag-source.js","sourceRoot":"","sources":["../../../src/core/components/dag-source.ts"],"names":[],"mappings":"AA2DA,uEAAuE;AAEvE,sEAAsE;AACtE,MAAM,UAAU,WAAW,CAAC,KAAc;IACxC,OAAO,CACL,OAAO,KAAK,KAAK,QAAQ;QACzB,KAAK,KAAK,IAAI;QACd,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QACrB,OAAQ,KAAmB,CAAC,GAAG,KAAK,UAAU;QAC9C,OAAQ,KAAmB,CAAC,KAAK,KAAK,UAAU;QAChD,OAAQ,KAAmB,CAAC,QAAQ,KAAK,UAAU,CACpD,CAAC;AACJ,CAAC;AAED,gFAAgF;AAChF,MAAM,UAAU,iBAAiB,CAAC,KAAc;IAC9C,OAAO,CACL,WAAW,CAAC,KAAK,CAAC;QAClB,OAAQ,KAAyB,CAAC,GAAG,KAAK,UAAU;QACpD,OAAQ,KAAyB,CAAC,KAAK,KAAK,UAAU;QACtD,OAAQ,KAAyB,CAAC,UAAU,KAAK,UAAU,CAC5D,CAAC;AACJ,CAAC;AAED,uEAAuE;AAEvE,mEAAmE;AACnE,MAAM,UAAU,WAAW,CAAC,KAAgB;IAC1C,MAAM,GAAG,GAAG,IAAI,GAAG,EAAmB,CAAC;IACvC,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAExC,yBAAyB;IACzB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC9C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAClD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;YAC9B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC5C,SAAS,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEnD,OAAO;QACL,GAAG,EAAE,GAAG,EAAE,CAAC,MAAM;QACjB,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;QACxB,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,IAAI,EAAE;QACvC,QAAQ,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC;QACjD,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;QAC/C,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK;QACjC,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK;QACjC,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,IAAI,KAAK;QAC3C,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,WAAW;KAC7C,CAAC;AACJ,CAAC;AAED,uEAAuE;AAEvE,oFAAoF;AACpF,MAAM,UAAU,WAAW,CAAC,MAAuB;IACjD,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC;IACzB,MAAM,KAAK,GAAc,EAAE,CAAC;IAC5B,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACrB,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACrC,MAAM,IAAI,GAAY;YACpB,EAAE;YACF,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;YACvB,KAAK,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS;SACvD,CAAC;QACF,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QACjC,IAAI,KAAK,KAAK,SAAS;YAAE,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QAC5C,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QACjC,IAAI,KAAK,KAAK,SAAS;YAAE,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QAC5C,IAAI,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;YACrB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;YACnB,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QAC3C,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,uEAAuE;AAEvE,MAAM,SAAS,GAAsB,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;AAEvD,gEAAgE;AAChE,MAAM,YAAY,GAAoB,MAAM,CAAC,MAAM,CAAC;IAClD,GAAG,EAAE,GAAG,EAAE,CAAC,SAAS;IACpB,GAAG,EAAE,GAAG,EAAE,CAAC,KAAK;IAChB,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE;IACf,QAAQ,EAAE,GAAG,EAAE,CAAC,SAAS;IACzB,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK;IAClB,UAAU,EAAE,GAAG,EAAE,CAAC,SAAS;CAC5B,CAAC,CAAC;AAEH,uEAAuE;AAEvE,MAAM,sBAAsB,GAAG,oBAAoB,CAAC;AACpD,MAAM,wBAAwB,GAAG,sBAAsB,CAAC;AAExD,uEAAuE;AAEvE;;;;;;;GAOG;AACH,MAAM,UAAU,WAAW,CACzB,MAAiB,EACjB,KAAa,EACb,IAAsB;IAEtB,MAAM,iBAAiB,GAAG,IAAI,EAAE,SAAS,CAAC;IAC1C,MAAM,SAAS,GAAG,iBAAiB,IAAI,MAAM,CAAC;IAC9C,MAAM,QAAQ,GAAG,IAAI,EAAE,KAAK,IAAI,QAAQ,CAAC;IAEzC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC;QAAE,OAAO,YAAY,CAAC;IAE5C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,UAAU,GAAG,IAAI,GAAG,EAA8C,CAAC;IACzE,4DAA4D;IAC5D,MAAM,cAAc,GAAG,IAAI,GAAG,EAAoB,CAAC;IAEnD,gBAAgB;IAChB,IAAI,SAAS,KAAK,WAAW,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;QACtD,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YACpB,IAAI,iBAAiB,KAAK,WAAW,EAAE,CAAC;gBACtC,MAAM,IAAI,KAAK,CACb,yEAAyE,CAC1E,CAAC;YACJ,CAAC;YACD,yEAAyE;QAC3E,CAAC;aAAM,CAAC;YACN,MAAM,UAAU,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC/C,MAAM,KAAK,GAAuB,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;YAC/C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;YAClC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;gBACnC,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE,SAAS;gBAC9B,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAChB,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACjB,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;oBACrB,KAAK,MAAM,CAAC,IAAI,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC;wBAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;4BAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;oBACnE,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,MAAM,eAAe,GAAG,CAAC,GAAG,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAChD,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CACtC,CAAC;oBACF,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBAC/B,MAAM,OAAO,GAAG,GAAG,sBAAsB,GAAG,EAAE,EAAE,CAAC;wBACjD,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;wBACtB,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC;wBACrC,UAAU,CAAC,GAAG,CAAC,OAAO,EAAE;4BACtB,KAAK,EAAE,OAAO,KAAK,YAAY,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;4BACvD,KAAK,EAAE,CAAC,EAAE,CAAC;yBACZ,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,kBAAkB;IAClB,IAAI,SAAS,KAAK,aAAa,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;QACxD,MAAM,KAAK,GAAuB,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YACnC,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YAC9B,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChB,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACjB,MAAM,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/D,6CAA6C;YAC7C,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;gBACpB,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;oBACnB,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC;wBAAE,cAAc,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;oBACtD,cAAc,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAClC,CAAC;YACH,CAAC;YACD,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;gBACrB,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;oBACnB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;wBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;gBAClD,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,gBAAgB,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzD,IAAI,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAChC,MAAM,OAAO,GAAG,GAAG,wBAAwB,GAAG,EAAE,EAAE,CAAC;oBACnD,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;oBACtB,MAAM,KAAK,GAAG,gBAAgB,CAAC,MAAM,CAAC;oBACtC,UAAU,CAAC,GAAG,CAAC,OAAO,EAAE;wBACtB,KAAK,EAAE,OAAO,KAAK,cAAc,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;wBACzD,KAAK,EAAE,EAAE;qBACV,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,6BAA6B;IAC7B,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;IAC/C,iEAAiE;IACjE,MAAM,YAAY,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;IAE/D,OAAO;QACL,GAAG,EAAE,GAAG,EAAE,CAAC,SAAS;QAEpB,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QAE7B,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE;YACZ,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACjC,IAAI,KAAK;gBAAE,OAAO,KAAK,CAAC,KAAK,CAAC;YAC9B,OAAO,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC1B,CAAC;QAED,QAAQ,EAAE,CAAC,EAAE,EAAE,EAAE;YACf,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACjC,IAAI,KAAK;gBAAE,OAAO,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;YACnC,kEAAkE;YAClE,MAAM,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACjE,MAAM,WAAW,GAAG,GAAG,wBAAwB,GAAG,EAAE,EAAE,CAAC;YACvD,IAAI,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC;gBAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACtD,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE;YACd,IAAI,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACvB,IAAI,EAAE,CAAC,UAAU,CAAC,sBAAsB,CAAC;oBAAE,OAAO,EAAE,CAAC;gBACrD,MAAM,UAAU,GAAG,EAAE,CAAC,OAAO,CAAC,wBAAwB,EAAE,EAAE,CAAC,CAAC;gBAC5D,OAAO,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACtD,CAAC;YACD,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;gBACnB,OAAO,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9D,CAAC;YACD,OAAO,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrE,CAAC;QAED,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC;QAElE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC;QAElE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,YAAY,KAAK,IAAI,IAAI,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAEtF,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,IAAI,YAAY,EAAE,UAAU,CAAC,EAAE,CAAC;KAC9E,CAAC;AACJ,CAAC"}

package/dist/core/components/dag.d.ts

@@ -1,5 +1,6 @@
 import type { BijouContext } from '../../ports/context.js';
 import type { TokenValue } from '../theme/tokens.js';
+import type { DagSource, SlicedDagSource, DagSliceOptions } from './dag-source.js';
 export interface DagNode {
     id: string;
     label: string;
@@ -15,14 +16,29 @@ export interface DagOptions {
     edgeToken?: TokenValue;
     highlightPath?: string[];
     highlightToken?: TokenValue;
+    selectedId?: string;
+    selectedToken?: TokenValue;
     nodeWidth?: number;
     maxWidth?: number;
     direction?: 'down' | 'right';
     ctx?: BijouContext;
 }
-export declare function dagSlice(nodes: DagNode[], focus: string, opts?: {
-    direction?: 'ancestors' | 'descendants' | 'both';
-    depth?: number;
-}): DagNode[];
+export interface DagNodePosition {
+    readonly row: number;
+    readonly col: number;
+    readonly width: number;
+    readonly height: number;
+}
+export interface DagLayout {
+    readonly output: string;
+    readonly nodes: ReadonlyMap<string, DagNodePosition>;
+    readonly width: number;
+    readonly height: number;
+}
+export declare function dagSlice(source: DagSource, focus: string, opts?: DagSliceOptions): SlicedDagSource;
+export declare function dagSlice(nodes: DagNode[], focus: string, opts?: DagSliceOptions): DagNode[];
+export declare function dagLayout(source: SlicedDagSource, options?: DagOptions): DagLayout;
+export declare function dagLayout(nodes: DagNode[], options?: DagOptions): DagLayout;
+export declare function dag(source: SlicedDagSource, options?: DagOptions): string;
 export declare function dag(nodes: DagNode[], options?: DagOptions): string;
 //# sourceMappingURL=dag.d.ts.map

package/dist/core/components/dag.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"dag.d.ts","sourceRoot":"","sources":["../../../src/core/components/dag.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAC3D,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAKrD,MAAM,WAAW,OAAO;IACtB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;IACjB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,KAAK,CAAC,EAAE,UAAU,CAAC;IACnB,8DAA8D;IAC9D,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,UAAU;IACzB,SAAS,CAAC,EAAE,UAAU,CAAC;IACvB,SAAS,CAAC,EAAE,UAAU,CAAC;IACvB,aAAa,CAAC,EAAE,MAAM,EAAE,CAAC;IACzB,cAAc,CAAC,EAAE,UAAU,CAAC;IAC5B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;IAC7B,GAAG,CAAC,EAAE,YAAY,CAAC;CACpB;AA4hBD,wBAAgB,QAAQ,CACtB,KAAK,EAAE,OAAO,EAAE,EAChB,KAAK,EAAE,MAAM,EACb,IAAI,CAAC,EAAE;IACL,SAAS,CAAC,EAAE,WAAW,GAAG,aAAa,GAAG,MAAM,CAAC;IACjD,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB,GACA,OAAO,EAAE,CAuHX;AAID,wBAAgB,GAAG,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,OAAO,GAAE,UAAe,GAAG,MAAM,CAgBtE"}
+{"version":3,"file":"dag.d.ts","sourceRoot":"","sources":["../../../src/core/components/dag.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAC3D,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAGrD,OAAO,KAAK,EAAE,SAAS,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAInF,MAAM,WAAW,OAAO;IACtB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;IACjB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,KAAK,CAAC,EAAE,UAAU,CAAC;IACnB,8DAA8D;IAC9D,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,UAAU;IACzB,SAAS,CAAC,EAAE,UAAU,CAAC;IACvB,SAAS,CAAC,EAAE,UAAU,CAAC;IACvB,aAAa,CAAC,EAAE,MAAM,EAAE,CAAC;IACzB,cAAc,CAAC,EAAE,UAAU,CAAC;IAC5B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,aAAa,CAAC,EAAE,UAAU,CAAC;IAC3B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;IAC7B,GAAG,CAAC,EAAE,YAAY,CAAC;CACpB;AAED,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;IACrD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAiiBD,wBAAgB,QAAQ,CACtB,MAAM,EAAE,SAAS,EACjB,KAAK,EAAE,MAAM,EACb,IAAI,CAAC,EAAE,eAAe,GACrB,eAAe,CAAC;AACnB,wBAAgB,QAAQ,CACtB,KAAK,EAAE,OAAO,EAAE,EAChB,KAAK,EAAE,MAAM,EACb,IAAI,CAAC,EAAE,eAAe,GACrB,OAAO,EAAE,CAAC;AAgBb,wBAAgB,SAAS,CAAC,MAAM,EAAE,eAAe,EAAE,OAAO,CAAC,EAAE,UAAU,GAAG,SAAS,CAAC;AACpF,wBAAgB,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,OAAO,CAAC,EAAE,UAAU,GAAG,SAAS,CAAC;AAmB7E,wBAAgB,GAAG,CAAC,MAAM,EAAE,eAAe,EAAE,OAAO,CAAC,EAAE,UAAU,GAAG,MAAM,CAAC;AAC3E,wBAAgB,GAAG,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,OAAO,CAAC,EAAE,UAAU,GAAG,MAAM,CAAC"}

package/dist/core/components/dag.js

@@ -1,4 +1,5 @@
 import { getDefaultContext } from '../../context.js';
+import { isDagSource, isSlicedDagSource, arraySource, materialize, sliceSource } from './dag-source.js';
 // ── Helpers ────────────────────────────────────────────────────────
 function resolveCtx(ctx) {
     if (ctx)
@@ -226,9 +227,9 @@ function renderNodeBox(label, badgeText, width, ghost) {
     return [top, mid, bot];
 }
 // ── Interactive Renderer ───────────────────────────────────────────
-function renderInteractive(nodes, options, ctx) {
+function renderInteractiveLayout(nodes, options, ctx) {
     if (nodes.length === 0)
-        return '';
+        return { output: '', nodes: new Map(), width: 0, height: 0 };
     const nodeMap = new Map();
     for (const n of nodes)
         nodeMap.set(n.id, n);
@@ -356,6 +357,7 @@ function renderInteractive(nodes, options, ctx) {
         }
     }
     // Write node boxes
+    const positions = new Map();
     for (const n of nodes) {
         const layer = layerMap.get(n.id);
         const col = colIndex.get(n.id);
@@ -363,9 +365,13 @@ function renderInteractive(nodes, options, ctx) {
             continue;
         const startCol = col * colStride;
         const startRow = layer * RS;
+        positions.set(n.id, { row: startRow, col: startCol, width: nodeWidth, height: 3 });
         const boxLines = renderNodeBox(n.label, n.badge, nodeWidth, n._ghost === true);
         let nToken;
-        if (highlightSet.has(n.id) && options.highlightToken) {
+        if (options.selectedId === n.id) {
+            nToken = options.selectedToken ?? ctx.theme.theme.ui.cursor;
+        }
+        else if (highlightSet.has(n.id) && options.highlightToken) {
             nToken = options.highlightToken;
         }
         else if (n.token) {
@@ -417,7 +423,7 @@ function renderInteractive(nodes, options, ctx) {
     while (lines.length > 0 && lines[lines.length - 1].trim() === '') {
         lines.pop();
     }
-    return lines.join('\n');
+    return { output: lines.join('\n'), nodes: positions, width: gridCols, height: gridRows };
 }
 // ── Pipe Renderer ──────────────────────────────────────────────────
 function renderPipe(nodes) {
@@ -474,131 +480,32 @@ function renderAccessible(nodes, layerMap) {
         lines.pop();
     return lines.join('\n');
 }
-// ── dagSlice ───────────────────────────────────────────────────────
-export function dagSlice(nodes, focus, opts) {
-    const direction = opts?.direction ?? 'both';
-    const maxDepth = opts?.depth ?? Infinity;
-    const nodeMap = new Map();
-    for (const n of nodes)
-        nodeMap.set(n.id, n);
-    if (!nodeMap.has(focus))
-        return [];
-    const included = new Set();
-    const ghostIds = new Set();
-    // Build parent map
-    const parentsMap = new Map();
-    for (const n of nodes) {
-        if (!parentsMap.has(n.id))
-            parentsMap.set(n.id, []);
-        for (const c of n.edges ?? []) {
-            if (!parentsMap.has(c))
-                parentsMap.set(c, []);
-            parentsMap.get(c).push(n.id);
-        }
+export function dagSlice(input, focus, opts) {
+    if (isDagSource(input)) {
+        return sliceSource(input, focus, opts);
     }
-    // BFS ancestors
-    if (direction === 'ancestors' || direction === 'both') {
-        const queue = [[focus, 0]];
-        const visited = new Set();
-        while (queue.length > 0) {
-            const entry = queue.shift();
-            const id = entry[0];
-            const depth = entry[1];
-            if (visited.has(id))
-                continue;
-            visited.add(id);
-            included.add(id);
-            if (depth < maxDepth) {
-                for (const p of parentsMap.get(id) ?? []) {
-                    if (!visited.has(p))
-                        queue.push([p, depth + 1]);
-                }
-            }
-            else {
-                const boundaryParents = (parentsMap.get(id) ?? []).filter(p => !visited.has(p));
-                if (boundaryParents.length > 0) {
-                    const ghostId = `__ghost_ancestors_${id}`;
-                    ghostIds.add(ghostId);
-                    included.add(ghostId);
-                }
-            }
-        }
-    }
-    // BFS descendants
-    if (direction === 'descendants' || direction === 'both') {
-        const queue = [[focus, 0]];
-        const visited = new Set();
-        while (queue.length > 0) {
-            const entry = queue.shift();
-            const id = entry[0];
-            const depth = entry[1];
-            if (visited.has(id))
-                continue;
-            visited.add(id);
-            included.add(id);
-            const ch = nodeMap.get(id)?.edges ?? [];
-            if (depth < maxDepth) {
-                for (const c of ch) {
-                    if (!visited.has(c) && nodeMap.has(c))
-                        queue.push([c, depth + 1]);
-                }
-            }
-            else {
-                const boundaryChildren = ch.filter(c => !visited.has(c) && nodeMap.has(c));
-                if (boundaryChildren.length > 0) {
-                    const ghostId = `__ghost_descendants_${id}`;
-                    ghostIds.add(ghostId);
-                    included.add(ghostId);
-                }
-            }
-        }
-    }
-    // Build result
-    const result = [];
-    for (const gid of ghostIds) {
-        if (gid.startsWith('__ghost_ancestors_')) {
-            const boundaryId = gid.replace('__ghost_ancestors_', '');
-            const allParents = (parentsMap.get(boundaryId) ?? []).filter(p => !included.has(p));
-            const count = allParents.length;
-            result.push({
-                id: gid,
-                label: `... ${count} ancestor${count !== 1 ? 's' : ''}`,
-                edges: [boundaryId],
-                _ghost: true,
-                _ghostLabel: `... ${count} ancestor${count !== 1 ? 's' : ''}`,
-            });
-        }
-    }
-    for (const n of nodes) {
-        if (!included.has(n.id))
-            continue;
-        const filteredEdges = (n.edges ?? []).filter(e => included.has(e));
-        const descGhostId = `__ghost_descendants_${n.id}`;
-        if (ghostIds.has(descGhostId)) {
-            filteredEdges.push(descGhostId);
-        }
-        result.push({ ...n, edges: filteredEdges.length > 0 ? filteredEdges : undefined });
-    }
-    for (const gid of ghostIds) {
-        if (gid.startsWith('__ghost_descendants_')) {
-            const boundaryId = gid.replace('__ghost_descendants_', '');
-            const boundaryNode = nodeMap.get(boundaryId);
-            const allChildren = (boundaryNode?.edges ?? []).filter(c => !included.has(c) && nodeMap.has(c));
-            const count = allChildren.length;
-            result.push({
-                id: gid,
-                label: `... ${count} descendant${count !== 1 ? 's' : ''}`,
-                _ghost: true,
-                _ghostLabel: `... ${count} descendant${count !== 1 ? 's' : ''}`,
-            });
-        }
+    // Array path: wrap, slice, materialize back for backward compat
+    const source = arraySource(input);
+    return materialize(sliceSource(source, focus, opts));
+}
+export function dagLayout(input, options = {}) {
+    if (isDagSource(input) && !isSlicedDagSource(input)) {
+        throw new Error('[bijou] dagLayout(): received an unbounded DagSource. Use dagSlice() to produce a SlicedDagSource first.');
     }
-    return result;
+    const ctx = resolveCtx(options.ctx);
+    const nodes = isSlicedDagSource(input) ? materialize(input) : input;
+    if (nodes.length === 0)
+        return { output: '', nodes: new Map(), width: 0, height: 0 };
+    const result = renderInteractiveLayout(nodes, options, ctx);
+    return { output: result.output, nodes: result.nodes, width: result.width, height: result.height };
 }
-// ── Main Entry Point ───────────────────────────────────────────────
-export function dag(nodes, options = {}) {
+export function dag(input, options = {}) {
+    if (isDagSource(input) && !isSlicedDagSource(input)) {
+        throw new Error('[bijou] dag(): received an unbounded DagSource. Use dagSlice() to produce a SlicedDagSource first.');
+    }
     const ctx = resolveCtx(options.ctx);
     const mode = ctx.mode;
+    const nodes = isSlicedDagSource(input) ? materialize(input) : input;
     if (nodes.length === 0)
         return '';
     if (mode === 'pipe') {
@@ -608,6 +515,6 @@ export function dag(nodes, options = {}) {
         const layerMap = assignLayers(nodes);
         return renderAccessible(nodes, layerMap);
     }
-    return renderInteractive(nodes, options, ctx);
+    return renderInteractiveLayout(nodes, options, ctx).output;
 }
 //# sourceMappingURL=dag.js.map