@flyingrobots/bijou 1.1.0 → 1.2.0

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

@@ -0,0 +1,78 @@
+/**
+ * Edge routing primitives for the DAG renderer.
+ *
+ * Self-contained module with zero dag-* imports.
+ * Provides the mutable grid used to route edges between node positions
+ * and the junction-character lookup table.
+ */
+/** Cardinal direction for edge routing through grid cells. */
+export type Dir = 'U' | 'D' | 'L' | 'R';
+/**
+ * Mutable grid state used during edge routing.
+ *
+ * Each cell tracks which cardinal directions edges pass through it,
+ * and `arrows` records the encoded positions of arrowheads.
+ */
+export interface GridState {
+    /** 2D array of direction sets, one per grid cell. */
+    dirs: Set<Dir>[][];
+    /** Encoded arrowhead positions. Use `decodeArrowPos()` to extract row/col. */
+    arrows: Set<number>;
+    /** Number of rows in the grid. */
+    rows: number;
+    /** Number of columns in the grid. */
+    cols: number;
+}
+/**
+ * Encode a grid (row, col) pair into a single number for Set membership.
+ *
+ * Uses bitwise encoding `(row << 16) | col`, supporting up to 65535 rows and cols.
+ *
+ * @param row - Grid row index.
+ * @param col - Grid column index.
+ * @returns The encoded position as a single number.
+ */
+export declare function encodeArrowPos(row: number, col: number): number;
+/**
+ * Decode an encoded arrow position back into row and col.
+ *
+ * @param encoded - Value produced by `encodeArrowPos()`.
+ * @returns Object with `row` and `col` fields.
+ */
+export declare function decodeArrowPos(encoded: number): {
+    row: number;
+    col: number;
+};
+/**
+ * Select the Unicode box-drawing character for a cell based on its edge directions.
+ *
+ * @param dirs - Set of cardinal directions passing through this cell.
+ * @returns The appropriate box-drawing character, or `' '` (space) for an empty
+ *   direction set (no edge traffic through this cell).
+ */
+export declare function junctionChar(dirs: Set<Dir>): string;
+/**
+ * Allocate an empty edge-routing grid.
+ *
+ * @param rows - Number of rows in the grid.
+ * @param cols - Number of columns in the grid.
+ * @returns A fresh `GridState` with empty direction sets for every cell.
+ */
+export declare function createGrid(rows: number, cols: number): GridState;
+/**
+ * Route a single edge through the grid between two node positions.
+ *
+ * Draws a vertical segment from the source, an optional horizontal jog
+ * if the columns differ, then a vertical segment down to the target.
+ * Records an arrowhead position just above the destination node.
+ *
+ * @param g - The grid state to mutate.
+ * @param fromCol - Column index of the source node.
+ * @param fromLayer - Layer index of the source node.
+ * @param toCol - Column index of the destination node.
+ * @param toLayer - Layer index of the destination node.
+ * @param RS - Row stride (number of grid rows per layer).
+ * @param colCenter - Function mapping a column index to its center grid column.
+ */
+export declare function markEdge(g: GridState, fromCol: number, fromLayer: number, toCol: number, toLayer: number, RS: number, colCenter: (c: number) => number): void;
+//# sourceMappingURL=dag-edges.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"dag-edges.d.ts","sourceRoot":"","sources":["../../../src/core/components/dag-edges.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH,8DAA8D;AAC9D,MAAM,MAAM,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAExC;;;;;GAKG;AACH,MAAM,WAAW,SAAS;IACxB,qDAAqD;IACrD,IAAI,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;IACnB,8EAA8E;IAC9E,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACpB,kCAAkC;IAClC,IAAI,EAAE,MAAM,CAAC;IACb,qCAAqC;IACrC,IAAI,EAAE,MAAM,CAAC;CACd;AAID;;;;;;;;GAQG;AACH,wBAAgB,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAE/D;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,OAAO,EAAE,MAAM,GAAG;IAAE,GAAG,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAA;CAAE,CAE5E;AAgBD;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM,CAKnD;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,CAUhE;AAiBD;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,QAAQ,CACtB,CAAC,EAAE,SAAS,EACZ,OAAO,EAAE,MAAM,EACf,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,MAAM,EACf,EAAE,EAAE,MAAM,EACV,SAAS,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,MAAM,GAC/B,IAAI,CAsBN"}

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

@@ -0,0 +1,127 @@
+/**
+ * Edge routing primitives for the DAG renderer.
+ *
+ * Self-contained module with zero dag-* imports.
+ * Provides the mutable grid used to route edges between node positions
+ * and the junction-character lookup table.
+ */
+// ── Arrow Position Encoding ───────────────────────────────────────
+/**
+ * Encode a grid (row, col) pair into a single number for Set membership.
+ *
+ * Uses bitwise encoding `(row << 16) | col`, supporting up to 65535 rows and cols.
+ *
+ * @param row - Grid row index.
+ * @param col - Grid column index.
+ * @returns The encoded position as a single number.
+ */
+export function encodeArrowPos(row, col) {
+    return (row << 16) | col;
+}
+/**
+ * Decode an encoded arrow position back into row and col.
+ *
+ * @param encoded - Value produced by `encodeArrowPos()`.
+ * @returns Object with `row` and `col` fields.
+ */
+export function decodeArrowPos(encoded) {
+    return { row: encoded >>> 16, col: encoded & 0xFFFF };
+}
+/**
+ * Lookup table mapping sorted direction-set keys to Unicode box-drawing characters.
+ * For example, `'DR'` maps to `\u250c` (top-left corner).
+ */
+const JUNCTION = {
+    'D': '\u2502', 'U': '\u2502', 'DU': '\u2502',
+    'L': '\u2500', 'R': '\u2500', 'LR': '\u2500',
+    'DR': '\u250c', 'DL': '\u2510', 'RU': '\u2514', 'LU': '\u2518',
+    'DRU': '\u251c', 'DLU': '\u2524', 'DLR': '\u252c', 'LRU': '\u2534',
+    'DLRU': '\u253c',
+};
+// ── Functions ──────────────────────────────────────────────────────
+/**
+ * Select the Unicode box-drawing character for a cell based on its edge directions.
+ *
+ * @param dirs - Set of cardinal directions passing through this cell.
+ * @returns The appropriate box-drawing character, or `' '` (space) for an empty
+ *   direction set (no edge traffic through this cell).
+ */
+export function junctionChar(dirs) {
+    if (dirs.size === 0)
+        return ' ';
+    // Alphabetical sort of D,L,R,U matches JUNCTION table keys
+    const key = [...dirs].sort().join('');
+    return JUNCTION[key] ?? '\u253c';
+}
+/**
+ * Allocate an empty edge-routing grid.
+ *
+ * @param rows - Number of rows in the grid.
+ * @param cols - Number of columns in the grid.
+ * @returns A fresh `GridState` with empty direction sets for every cell.
+ */
+export function createGrid(rows, cols) {
+    const dirs = [];
+    for (let r = 0; r < rows; r++) {
+        const row = [];
+        for (let c = 0; c < cols; c++) {
+            row.push(new Set());
+        }
+        dirs.push(row);
+    }
+    return { dirs, arrows: new Set(), rows, cols };
+}
+/**
+ * Add direction markers to a single grid cell. Bounds-checked.
+ *
+ * @param g - The grid state to mutate.
+ * @param r - Row index.
+ * @param c - Column index.
+ * @param ds - One or more directions to mark in this cell.
+ */
+function markDir(g, r, c, ...ds) {
+    if (r >= 0 && r < g.rows && c >= 0 && c < g.cols) {
+        const cell = g.dirs[r][c];
+        for (const d of ds)
+            cell.add(d);
+    }
+}
+/**
+ * Route a single edge through the grid between two node positions.
+ *
+ * Draws a vertical segment from the source, an optional horizontal jog
+ * if the columns differ, then a vertical segment down to the target.
+ * Records an arrowhead position just above the destination node.
+ *
+ * @param g - The grid state to mutate.
+ * @param fromCol - Column index of the source node.
+ * @param fromLayer - Layer index of the source node.
+ * @param toCol - Column index of the destination node.
+ * @param toLayer - Layer index of the destination node.
+ * @param RS - Row stride (number of grid rows per layer).
+ * @param colCenter - Function mapping a column index to its center grid column.
+ */
+export function markEdge(g, fromCol, fromLayer, toCol, toLayer, RS, colCenter) {
+    const srcC = colCenter(fromCol);
+    const dstC = colCenter(toCol);
+    const sRow = fromLayer * RS + 3;
+    const dRow = toLayer * RS - 1; // one row above dest box
+    const mid = sRow + 1;
+    if (srcC === dstC) {
+        for (let r = sRow; r < dRow; r++)
+            markDir(g, r, srcC, 'D', 'U');
+    }
+    else {
+        markDir(g, sRow, srcC, 'D', 'U');
+        markDir(g, mid, srcC, srcC < dstC ? 'R' : 'L', 'U');
+        const minC = Math.min(srcC, dstC);
+        const maxC = Math.max(srcC, dstC);
+        for (let c = minC + 1; c < maxC; c++)
+            markDir(g, mid, c, 'L', 'R');
+        markDir(g, mid, dstC, srcC < dstC ? 'L' : 'R', 'D');
+        for (let r = mid + 1; r < dRow; r++)
+            markDir(g, r, dstC, 'D', 'U');
+    }
+    g.arrows.add(encodeArrowPos(dRow, dstC));
+}
+//# sourceMappingURL=dag-edges.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"dag-edges.js","sourceRoot":"","sources":["../../../src/core/components/dag-edges.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAwBH,qEAAqE;AAErE;;;;;;;;GAQG;AACH,MAAM,UAAU,cAAc,CAAC,GAAW,EAAE,GAAW;IACrD,OAAO,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,GAAG,CAAC;AAC3B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,OAAe;IAC5C,OAAO,EAAE,GAAG,EAAE,OAAO,KAAK,EAAE,EAAE,GAAG,EAAE,OAAO,GAAG,MAAM,EAAE,CAAC;AACxD,CAAC;AAED;;;GAGG;AACH,MAAM,QAAQ,GAA2B;IACvC,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ;IAC5C,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ;IAC5C,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ;IAC9D,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ;IAClE,MAAM,EAAE,QAAQ;CACjB,CAAC;AAEF,sEAAsE;AAEtE;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAAC,IAAc;IACzC,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAChC,2DAA2D;IAC3D,MAAM,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACtC,OAAO,QAAQ,CAAC,GAAG,CAAC,IAAI,QAAQ,CAAC;AACnC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CAAC,IAAY,EAAE,IAAY;IACnD,MAAM,IAAI,GAAiB,EAAE,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,MAAM,GAAG,GAAe,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,EAAO,CAAC,CAAC;QAC3B,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjB,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,GAAG,EAAU,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AACzD,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,OAAO,CAAC,CAAY,EAAE,CAAS,EAAE,CAAS,EAAE,GAAG,EAAS;IAC/D,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QACjD,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC,CAAE,CAAC;QAC5B,KAAK,MAAM,CAAC,IAAI,EAAE;YAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,QAAQ,CACtB,CAAY,EACZ,OAAe,EACf,SAAiB,EACjB,KAAa,EACb,OAAe,EACf,EAAU,EACV,SAAgC;IAEhC,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC;IAChC,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;IAC9B,MAAM,IAAI,GAAG,SAAS,GAAG,EAAE,GAAG,CAAC,CAAC;IAChC,MAAM,IAAI,GAAG,OAAO,GAAG,EAAE,GAAG,CAAC,CAAC,CAAG,yBAAyB;IAC1D,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC;IAErB,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;QAClB,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE;YAAE,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IAClE,CAAC;SAAM,CAAC;QACN,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACjC,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEpD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE;YAAE,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAEnE,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACpD,KAAK,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE;YAAE,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IACrE,CAAC;IAED,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;AAC3C,CAAC"}

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

@@ -0,0 +1,37 @@
+/**
+ * Sugiyama-style layer assignment and column ordering for the DAG renderer.
+ *
+ * Imports only `DagNode` as a type from `dag.ts` (type-only, erased at runtime).
+ */
+import type { DagNode } from './dag.js';
+/**
+ * Assign each node to a layer using longest-path layer assignment.
+ *
+ * Performs Kahn's topological sort to detect cycles, then assigns each
+ * node to the layer one past its deepest parent. Root nodes (in-degree 0)
+ * are placed on layer 0.
+ *
+ * @param nodes - The graph nodes to lay out.
+ * @returns Map from node ID to its zero-based layer index.
+ * @throws If the graph contains a cycle.
+ */
+export declare function assignLayers(nodes: DagNode[]): Map<string, number>;
+/**
+ * Group node IDs into layer arrays indexed by layer number.
+ *
+ * @param nodes - All graph nodes.
+ * @param layerMap - Map from node ID to layer index (from `assignLayers`).
+ * @returns Array of layers, where each layer is an array of node IDs.
+ */
+export declare function buildLayerArrays(nodes: DagNode[], layerMap: Map<string, number>): string[][];
+/**
+ * Reorder nodes within each layer to minimize edge crossings.
+ *
+ * Uses the barycenter heuristic with one top-down pass followed by
+ * one bottom-up pass. Mutates the `layers` arrays in place.
+ *
+ * @param layers - Layer arrays from `buildLayerArrays`, mutated in place.
+ * @param nodes - All graph nodes (used to build adjacency maps).
+ */
+export declare function orderColumns(layers: string[][], nodes: DagNode[]): void;
+//# sourceMappingURL=dag-layout.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"dag-layout.d.ts","sourceRoot":"","sources":["../../../src/core/components/dag-layout.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,UAAU,CAAC;AAIxC;;;;;;;;;;GAUG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAmElE;AAID;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,OAAO,EAAE,EAChB,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAC5B,MAAM,EAAE,EAAE,CAWZ;AAED;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,IAAI,CAyDvE"}

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

@@ -0,0 +1,172 @@
+/**
+ * Sugiyama-style layer assignment and column ordering for the DAG renderer.
+ *
+ * Imports only `DagNode` as a type from `dag.ts` (type-only, erased at runtime).
+ */
+// ── Layer Assignment ───────────────────────────────────────────────
+/**
+ * Assign each node to a layer using longest-path layer assignment.
+ *
+ * Performs Kahn's topological sort to detect cycles, then assigns each
+ * node to the layer one past its deepest parent. Root nodes (in-degree 0)
+ * are placed on layer 0.
+ *
+ * @param nodes - The graph nodes to lay out.
+ * @returns Map from node ID to its zero-based layer index.
+ * @throws If the graph contains a cycle.
+ */
+export function assignLayers(nodes) {
+    const nodeIds = new Set();
+    for (const n of nodes) {
+        if (nodeIds.has(n.id)) {
+            throw new Error(`[bijou] dag(): duplicate node id "${n.id}"`);
+        }
+        nodeIds.add(n.id);
+    }
+    const children = new Map();
+    const parents = new Map();
+    const inDegree = new Map();
+    for (const n of nodes) {
+        // Filter edges to only include targets that exist in the graph
+        children.set(n.id, (n.edges ?? []).filter(e => nodeIds.has(e)));
+        inDegree.set(n.id, 0);
+        if (!parents.has(n.id))
+            parents.set(n.id, []);
+    }
+    for (const n of nodes) {
+        for (const childId of children.get(n.id) ?? []) {
+            if (!parents.has(childId))
+                parents.set(childId, []);
+            parents.get(childId).push(n.id);
+            inDegree.set(childId, (inDegree.get(childId) ?? 0) + 1);
+        }
+    }
+    // Kahn's topological sort
+    const queue = [];
+    for (const [id, deg] of inDegree) {
+        if (deg === 0)
+            queue.push(id);
+    }
+    // Kahn's algorithm: in-degree tracking guarantees each node is queued exactly
+    // once (when its in-degree reaches 0), so no visited set is needed.
+    const topoOrder = [];
+    while (queue.length > 0) {
+        const id = queue.shift();
+        topoOrder.push(id);
+        for (const childId of children.get(id) ?? []) {
+            const newDeg = (inDegree.get(childId) ?? 1) - 1;
+            inDegree.set(childId, newDeg);
+            if (newDeg === 0)
+                queue.push(childId);
+        }
+    }
+    if (topoOrder.length !== nodes.length) {
+        throw new Error('[bijou] dag(): cycle detected in graph');
+    }
+    // Longest-path layer assignment
+    const layerMap = new Map();
+    for (const id of topoOrder) {
+        const pars = parents.get(id) ?? [];
+        if (pars.length === 0) {
+            layerMap.set(id, 0);
+        }
+        else {
+            let maxParent = 0;
+            for (const p of pars) {
+                maxParent = Math.max(maxParent, layerMap.get(p) ?? 0);
+            }
+            layerMap.set(id, maxParent + 1);
+        }
+    }
+    return layerMap;
+}
+// ── Column Ordering ────────────────────────────────────────────────
+/**
+ * Group node IDs into layer arrays indexed by layer number.
+ *
+ * @param nodes - All graph nodes.
+ * @param layerMap - Map from node ID to layer index (from `assignLayers`).
+ * @returns Array of layers, where each layer is an array of node IDs.
+ */
+export function buildLayerArrays(nodes, layerMap) {
+    let maxLayer = 0;
+    for (const v of layerMap.values()) {
+        if (v > maxLayer)
+            maxLayer = v;
+    }
+    const layers = Array.from({ length: maxLayer + 1 }, () => []);
+    for (const n of nodes) {
+        const l = layerMap.get(n.id);
+        if (l !== undefined)
+            layers[l].push(n.id);
+    }
+    return layers;
+}
+/**
+ * Reorder nodes within each layer to minimize edge crossings.
+ *
+ * Uses the barycenter heuristic with one top-down pass followed by
+ * one bottom-up pass. Mutates the `layers` arrays in place.
+ *
+ * @param layers - Layer arrays from `buildLayerArrays`, mutated in place.
+ * @param nodes - All graph nodes (used to build adjacency maps).
+ */
+export function orderColumns(layers, nodes) {
+    const childrenMap = new Map();
+    const parentsMap = new Map();
+    for (const n of nodes) {
+        childrenMap.set(n.id, n.edges ?? []);
+        if (!parentsMap.has(n.id))
+            parentsMap.set(n.id, []);
+    }
+    for (const n of nodes) {
+        for (const c of n.edges ?? []) {
+            if (!parentsMap.has(c))
+                parentsMap.set(c, []);
+            parentsMap.get(c).push(n.id);
+        }
+    }
+    // Top-down pass
+    for (let l = 1; l < layers.length; l++) {
+        const prevLayer = layers[l - 1];
+        const curLayer = layers[l];
+        const prevIndex = new Map();
+        for (let i = 0; i < prevLayer.length; i++) {
+            prevIndex.set(prevLayer[i], i);
+        }
+        const bary = new Map();
+        for (const id of curLayer) {
+            const pars = (parentsMap.get(id) ?? []).filter(p => prevIndex.has(p));
+            if (pars.length === 0) {
+                bary.set(id, Infinity);
+            }
+            else {
+                const avg = pars.reduce((s, p) => s + (prevIndex.get(p) ?? 0), 0) / pars.length;
+                bary.set(id, avg);
+            }
+        }
+        curLayer.sort((a, b) => (bary.get(a) ?? Infinity) - (bary.get(b) ?? Infinity));
+    }
+    // Bottom-up pass
+    for (let l = layers.length - 2; l >= 0; l--) {
+        const nextLayer = layers[l + 1];
+        const curLayer = layers[l];
+        const nextIndex = new Map();
+        for (let i = 0; i < nextLayer.length; i++) {
+            nextIndex.set(nextLayer[i], i);
+        }
+        const bary = new Map();
+        for (const id of curLayer) {
+            const chlds = (childrenMap.get(id) ?? []).filter(c => nextIndex.has(c));
+            if (chlds.length === 0) {
+                bary.set(id, Infinity);
+            }
+            else {
+                const avg = chlds.reduce((s, c) => s + (nextIndex.get(c) ?? 0), 0) / chlds.length;
+                bary.set(id, avg);
+            }
+        }
+        curLayer.sort((a, b) => (bary.get(a) ?? Infinity) - (bary.get(b) ?? Infinity));
+    }
+}
+//# sourceMappingURL=dag-layout.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"dag-layout.js","sourceRoot":"","sources":["../../../src/core/components/dag-layout.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH,sEAAsE;AAEtE;;;;;;;;;;GAUG;AACH,MAAM,UAAU,YAAY,CAAC,KAAgB;IAC3C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAChE,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACpB,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC5C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE3C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,+DAA+D;QAC/D,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACtB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAChD,CAAC;IAED,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,KAAK,MAAM,OAAO,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YAC/C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;YACpD,OAAO,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACjC,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IAED,0BAA0B;IAC1B,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,QAAQ,EAAE,CAAC;QACjC,IAAI,GAAG,KAAK,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAChC,CAAC;IAED,8EAA8E;IAC9E,oEAAoE;IACpE,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC1B,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACnB,KAAK,MAAM,OAAO,IAAI,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YAC7C,MAAM,MAAM,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YAChD,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;YAC9B,IAAI,MAAM,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACxC,CAAC;IACH,CAAC;IAED,IAAI,SAAS,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;QACtC,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;IAC5D,CAAC;IAED,gCAAgC;IAChC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QACnC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACtB,CAAC;aAAM,CAAC;YACN,IAAI,SAAS,GAAG,CAAC,CAAC;YAClB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBACrB,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACxD,CAAC;YACD,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,SAAS,GAAG,CAAC,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,sEAAsE;AAEtE;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAC9B,KAAgB,EAChB,QAA6B;IAE7B,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;QAClC,IAAI,CAAC,GAAG,QAAQ;YAAE,QAAQ,GAAG,CAAC,CAAC;IACjC,CAAC;IACD,MAAM,MAAM,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,QAAQ,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IAC1E,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,CAAC,KAAK,SAAS;YAAE,MAAM,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC7C,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,YAAY,CAAC,MAAkB,EAAE,KAAgB;IAC/D,MAAM,WAAW,GAAG,IAAI,GAAG,EAAoB,CAAC;IAChD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;QACrC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACtD,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;YAC9B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC9C,UAAU,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAED,gBAAgB;IAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;QACjC,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;QAC5B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAE,EAAE,CAAC,CAAC,CAAC;QAClC,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;QACvC,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YAC1B,MAAM,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACtE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtB,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;YACzB,CAAC;iBAAM,CAAC;gBACN,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;gBAChF,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;IACjF,CAAC;IAED,iBAAiB;IACjB,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;QACjC,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;QAC5B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAE,EAAE,CAAC,CAAC,CAAC;QAClC,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;QACvC,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YAC1B,MAAM,KAAK,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACxE,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvB,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;YACzB,CAAC;iBAAM,CAAC;gBACN,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;gBAClF,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;IACjF,CAAC;AACH,CAAC"}

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

@@ -0,0 +1,51 @@
+/**
+ * Rendering functions for the DAG component.
+ *
+ * Handles node box construction, interactive layout rendering with ANSI styling,
+ * pipe-mode plain text output, and accessible structured text output.
+ *
+ * Imports types from `dag.ts` (type-only, erased at runtime).
+ * Imports layout functions from `dag-layout.ts` and edge primitives from `dag-edges.ts`.
+ */
+import type { BijouContext } from '../../ports/context.js';
+import type { DagNode, DagOptions, DagNodePosition } from './dag.js';
+/**
+ * Render the full interactive (styled) DAG layout.
+ *
+ * Performs the complete layout pipeline: layer assignment, column ordering,
+ * edge routing, node box rendering, highlight/selection styling, and ANSI
+ * serialization into a final string.
+ *
+ * @param nodes - The graph nodes to render.
+ * @param options - Rendering options (tokens, selection, sizing).
+ * @param ctx - The resolved bijou context.
+ * @returns The rendered output string, node position map, and grid dimensions.
+ */
+export declare function renderInteractiveLayout(nodes: DagNode[], options: DagOptions, ctx: BijouContext): {
+    output: string;
+    nodes: Map<string, DagNodePosition>;
+    width: number;
+    height: number;
+};
+/**
+ * Render the graph as plain text for piped (non-TTY) output.
+ *
+ * Produces one line per node in the format `Label -> Target1, Target2`
+ * with no ANSI styling or box-drawing characters.
+ *
+ * @param nodes - The graph nodes to render.
+ * @returns Plain text representation of the graph.
+ */
+export declare function renderPipe(nodes: DagNode[]): string;
+/**
+ * Render the graph as structured accessible text.
+ *
+ * Produces a summary header ("Graph: N nodes, M edges") followed by
+ * layer-grouped node listings with edge descriptions.
+ *
+ * @param nodes - The graph nodes to render.
+ * @param layerMap - Map from node ID to layer index.
+ * @returns Accessible text representation of the graph.
+ */
+export declare function renderAccessible(nodes: DagNode[], layerMap: Map<string, number>): string;
+//# sourceMappingURL=dag-render.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"dag-render.d.ts","sourceRoot":"","sources":["../../../src/core/components/dag-render.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAE3D,OAAO,KAAK,EAAE,OAAO,EAAE,UAAU,EAAE,eAAe,EAAE,MAAM,UAAU,CAAC;AA6JrE;;;;;;;;;;;GAWG;AACH,wBAAgB,uBAAuB,CACrC,KAAK,EAAE,OAAO,EAAE,EAChB,OAAO,EAAE,UAAU,EACnB,GAAG,EAAE,YAAY,GAChB;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CA0PxF;AAID;;;;;;;;GAQG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,MAAM,CAiBnD;AAID;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM,CA8BxF"}