@flyingrobots/bijou 7.2.0 → 8.0.0-rc.1

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

@@ -0,0 +1,99 @@
+/**
+ * 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.
+ */
+/**
+ * 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).
+ */
+export const SINGLE_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',
+};
+export const HEAVY_JUNCTION = {
+    D: '\u2503',
+    U: '\u2503',
+    DU: '\u2503',
+    L: '\u2501',
+    R: '\u2501',
+    LR: '\u2501',
+    DR: '\u250f',
+    DL: '\u2513',
+    RU: '\u2517',
+    LU: '\u251b',
+    DRU: '\u2523',
+    DLU: '\u252b',
+    DLR: '\u2533',
+    LRU: '\u253b',
+    DLRU: '\u254b',
+};
+export const DOUBLE_JUNCTION = {
+    D: '\u2551',
+    U: '\u2551',
+    DU: '\u2551',
+    L: '\u2550',
+    R: '\u2550',
+    LR: '\u2550',
+    DR: '\u2554',
+    DL: '\u2557',
+    RU: '\u255a',
+    LU: '\u255d',
+    DRU: '\u2560',
+    DLU: '\u2563',
+    DLR: '\u2566',
+    LRU: '\u2569',
+    DLRU: '\u256c',
+};
+export const DASHED_JUNCTION = {
+    ...SINGLE_JUNCTION,
+    D: '\u254e',
+    U: '\u254e',
+    DU: '\u254e',
+    L: '\u254c',
+    R: '\u254c',
+    LR: '\u254c',
+};
+export const JUNCTIONS = {
+    single: SINGLE_JUNCTION,
+    heavy: HEAVY_JUNCTION,
+    double: DOUBLE_JUNCTION,
+    dashed: DASHED_JUNCTION,
+};
+//# sourceMappingURL=dag-edges.part01.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"dag-edges.part01.js","sourceRoot":"","sources":["../../../src/core/components/dag-edges.part01.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAgCH;;;;;;;;GAQG;AACH,MAAM,UAAU,cAAc,CAAC,GAAW,EAAE,GAAW;IACrD,OAAO,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,GAAG,CAAC;AAC3B,CAAC;AACD;;;;;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;AACD;;;GAGG;AACH,MAAM,CAAC,MAAM,eAAe,GAA2B;IACrD,CAAC,EAAE,QAAQ;IACX,CAAC,EAAE,QAAQ;IACX,EAAE,EAAE,QAAQ;IACZ,CAAC,EAAE,QAAQ;IACX,CAAC,EAAE,QAAQ;IACX,EAAE,EAAE,QAAQ;IACZ,EAAE,EAAE,QAAQ;IACZ,EAAE,EAAE,QAAQ;IACZ,EAAE,EAAE,QAAQ;IACZ,EAAE,EAAE,QAAQ;IACZ,GAAG,EAAE,QAAQ;IACb,GAAG,EAAE,QAAQ;IACb,GAAG,EAAE,QAAQ;IACb,GAAG,EAAE,QAAQ;IACb,IAAI,EAAE,QAAQ;CACf,CAAC;AACF,MAAM,CAAC,MAAM,cAAc,GAA2B;IACpD,CAAC,EAAE,QAAQ;IACX,CAAC,EAAE,QAAQ;IACX,EAAE,EAAE,QAAQ;IACZ,CAAC,EAAE,QAAQ;IACX,CAAC,EAAE,QAAQ;IACX,EAAE,EAAE,QAAQ;IACZ,EAAE,EAAE,QAAQ;IACZ,EAAE,EAAE,QAAQ;IACZ,EAAE,EAAE,QAAQ;IACZ,EAAE,EAAE,QAAQ;IACZ,GAAG,EAAE,QAAQ;IACb,GAAG,EAAE,QAAQ;IACb,GAAG,EAAE,QAAQ;IACb,GAAG,EAAE,QAAQ;IACb,IAAI,EAAE,QAAQ;CACf,CAAC;AACF,MAAM,CAAC,MAAM,eAAe,GAA2B;IACrD,CAAC,EAAE,QAAQ;IACX,CAAC,EAAE,QAAQ;IACX,EAAE,EAAE,QAAQ;IACZ,CAAC,EAAE,QAAQ;IACX,CAAC,EAAE,QAAQ;IACX,EAAE,EAAE,QAAQ;IACZ,EAAE,EAAE,QAAQ;IACZ,EAAE,EAAE,QAAQ;IACZ,EAAE,EAAE,QAAQ;IACZ,EAAE,EAAE,QAAQ;IACZ,GAAG,EAAE,QAAQ;IACb,GAAG,EAAE,QAAQ;IACb,GAAG,EAAE,QAAQ;IACb,GAAG,EAAE,QAAQ;IACb,IAAI,EAAE,QAAQ;CACf,CAAC;AACF,MAAM,CAAC,MAAM,eAAe,GAA2B;IACrD,GAAG,eAAe;IAClB,CAAC,EAAE,QAAQ;IACX,CAAC,EAAE,QAAQ;IACX,EAAE,EAAE,QAAQ;IACZ,CAAC,EAAE,QAAQ;IACX,CAAC,EAAE,QAAQ;IACX,EAAE,EAAE,QAAQ;CACb,CAAC;AACF,MAAM,CAAC,MAAM,SAAS,GAAmD;IACvE,MAAM,EAAE,eAAe;IACvB,KAAK,EAAE,cAAc;IACrB,MAAM,EAAE,eAAe;IACvB,MAAM,EAAE,eAAe;CACxB,CAAC"}

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

@@ -0,0 +1,31 @@
+import { type Dir, type EdgeGlyphStyle, type GridState } from './dag-edges.part01.js';
+/**
+ * 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>, style?: EdgeGlyphStyle): string;
+/**
+ * Select the arrowhead character for an edge style.
+ */
+export declare function arrowChar(style?: EdgeGlyphStyle): 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;
+/**
+ * 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.
+ */
+export declare function markDir(g: GridState, r: number, c: number, ...ds: Dir[]): void;
+//# sourceMappingURL=dag-edges.part02.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"dag-edges.part02.d.ts","sourceRoot":"","sources":["../../../src/core/components/dag-edges.part02.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,KAAK,GAAG,EACR,KAAK,cAAc,EACnB,KAAK,SAAS,EAEf,MAAM,uBAAuB,CAAC;AAE/B;;;;;;GAMG;AACH,wBAAgB,YAAY,CAC1B,IAAI,EAAE,GAAG,CAAC,GAAG,CAAC,EACd,KAAK,GAAE,cAAyB,GAC/B,MAAM,CAKR;AACD;;GAEG;AACH,wBAAgB,SAAS,CAAC,KAAK,GAAE,cAAyB,GAAG,MAAM,CAElE;AACD;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,CAUhE;AACD;;;;;;;GAOG;AACH,wBAAgB,OAAO,CACrB,CAAC,EAAE,SAAS,EACZ,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,EACT,GAAG,EAAE,EAAE,GAAG,EAAE,GACX,IAAI,CAMN"}

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

@@ -0,0 +1,57 @@
+import { JUNCTIONS, } from './dag-edges.part01.js';
+/**
+ * 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, style = 'single') {
+    if (dirs.size === 0)
+        return ' ';
+    // Alphabetical sort of D,L,R,U matches JUNCTION table keys
+    const key = [...dirs].sort().join('');
+    return JUNCTIONS[style][key] ?? JUNCTIONS[style]['DLRU'] ?? '\u253c';
+}
+/**
+ * Select the arrowhead character for an edge style.
+ */
+export function arrowChar(style = 'single') {
+    return style === 'dashed' ? '\u25be' : '\u25bc';
+}
+/**
+ * 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 Map(), 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.
+ */
+export function markDir(g, r, c, ...ds) {
+    if (r >= 0 && r < g.rows && c >= 0 && c < g.cols) {
+        const cell = g.dirs[r]?.[c];
+        if (cell === undefined)
+            return;
+        for (const d of ds)
+            cell.add(d);
+    }
+}
+//# sourceMappingURL=dag-edges.part02.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"dag-edges.part02.js","sourceRoot":"","sources":["../../../src/core/components/dag-edges.part02.ts"],"names":[],"mappings":"AAAA,OAAO,EAIL,SAAS,GACV,MAAM,uBAAuB,CAAC;AAE/B;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAC1B,IAAc,EACd,QAAwB,QAAQ;IAEhC,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,SAAS,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,QAAQ,CAAC;AACvE,CAAC;AACD;;GAEG;AACH,MAAM,UAAU,SAAS,CAAC,QAAwB,QAAQ;IACxD,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;AAClD,CAAC;AACD;;;;;;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,EAAkB,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AACjE,CAAC;AACD;;;;;;;GAOG;AACH,MAAM,UAAU,OAAO,CACrB,CAAY,EACZ,CAAS,EACT,CAAS,EACT,GAAG,EAAS;IAEZ,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,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO;QAC/B,KAAK,MAAM,CAAC,IAAI,EAAE;YAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC;AACH,CAAC"}

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

@@ -0,0 +1,18 @@
+import { type GridState } from './dag-edges.part01.js';
+/**
+ * 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, rowStride: number, colCenter: (layer: number, col: number) => number, nodeWidth: number, nodeHeight: number): void;
+//# sourceMappingURL=dag-edges.part03.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"dag-edges.part03.d.ts","sourceRoot":"","sources":["../../../src/core/components/dag-edges.part03.ts"],"names":[],"mappings":"AAAA,OAAO,EAEL,KAAK,SAAS,EAEf,MAAM,uBAAuB,CAAC;AAI/B;;;;;;;;;;;;;;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,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,KAAK,MAAM,EACjD,SAAS,EAAE,MAAM,EACjB,UAAU,EAAE,MAAM,GACjB,IAAI,CAiCN"}

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

@@ -0,0 +1,41 @@
+import { encodeArrowPos, } from './dag-edges.part01.js';
+import { markDir } from './dag-edges.part02.js';
+import { buildEdgeRoute } from './dag-edges.part04.js';
+/**
+ * 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, rowStride, colCenter, nodeWidth, nodeHeight) {
+    const route = buildEdgeRoute(fromCol, fromLayer, toCol, toLayer, rowStride, colCenter, nodeWidth, nodeHeight, g.cols);
+    for (let i = 0; i < route.path.length - 1; i++) {
+        const current = route.path[i];
+        const next = route.path[i + 1];
+        if (current === undefined || next === undefined)
+            continue;
+        if (current.row === next.row) {
+            const forward = current.col < next.col ? 'R' : 'L';
+            const reverse = forward === 'R' ? 'L' : 'R';
+            markDir(g, current.row, current.col, forward);
+            markDir(g, next.row, next.col, reverse);
+            continue;
+        }
+        const forward = current.row < next.row ? 'D' : 'U';
+        const reverse = forward === 'D' ? 'U' : 'D';
+        markDir(g, current.row, current.col, forward);
+        markDir(g, next.row, next.col, reverse);
+    }
+    const arrowPos = encodeArrowPos(route.arrow.row, route.arrow.col);
+    g.arrows.set(arrowPos, (g.arrows.get(arrowPos) ?? 0) + 1);
+}
+//# sourceMappingURL=dag-edges.part03.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"dag-edges.part03.js","sourceRoot":"","sources":["../../../src/core/components/dag-edges.part03.ts"],"names":[],"mappings":"AAAA,OAAO,EAGL,cAAc,GACf,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAChD,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAEvD;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,QAAQ,CACtB,CAAY,EACZ,OAAe,EACf,SAAiB,EACjB,KAAa,EACb,OAAe,EACf,SAAiB,EACjB,SAAiD,EACjD,SAAiB,EACjB,UAAkB;IAElB,MAAM,KAAK,GAAG,cAAc,CAC1B,OAAO,EACP,SAAS,EACT,KAAK,EACL,OAAO,EACP,SAAS,EACT,SAAS,EACT,SAAS,EACT,UAAU,EACV,CAAC,CAAC,IAAI,CACP,CAAC;IAEF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/C,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/B,IAAI,OAAO,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS;YAAE,SAAS;QAC1D,IAAI,OAAO,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC;YAC7B,MAAM,OAAO,GAAQ,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;YACxD,MAAM,OAAO,GAAQ,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;YACjD,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,GAAG,EAAE,OAAO,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;YAC9C,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;YACxC,SAAS;QACX,CAAC;QAED,MAAM,OAAO,GAAQ,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;QACxD,MAAM,OAAO,GAAQ,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;QACjD,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,GAAG,EAAE,OAAO,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QAC9C,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;IAC1C,CAAC;IAED,MAAM,QAAQ,GAAG,cAAc,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAClE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AAC5D,CAAC"}

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

@@ -0,0 +1,9 @@
+import { type EdgeRoute } from './dag-edges.part01.js';
+/**
+ * Build the routed cell path for an edge, including the destination arrow cell.
+ *
+ * Same-column skip edges are detoured into the gap beside the node column so
+ * they do not disappear under intermediate node boxes.
+ */
+export declare function buildEdgeRoute(fromCol: number, fromLayer: number, toCol: number, toLayer: number, rowStride: number, colCenter: (layer: number, col: number) => number, nodeWidth: number, nodeHeight: number, gridCols: number): EdgeRoute;
+//# sourceMappingURL=dag-edges.part04.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"dag-edges.part04.d.ts","sourceRoot":"","sources":["../../../src/core/components/dag-edges.part04.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,SAAS,EAAkB,MAAM,uBAAuB,CAAC;AA6CvE;;;;;GAKG;AACH,wBAAgB,cAAc,CAC5B,OAAO,EAAE,MAAM,EACf,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,MAAM,EACf,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,KAAK,MAAM,EACjD,SAAS,EAAE,MAAM,EACjB,UAAU,EAAE,MAAM,EAClB,QAAQ,EAAE,MAAM,GACf,SAAS,CA8BX"}

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

@@ -0,0 +1,67 @@
+function chooseDetourColumn(srcC, nodeWidth, gridCols) {
+    const detourOffset = Math.floor(nodeWidth / 2) + 1;
+    const right = srcC + detourOffset;
+    if (right >= 0 && right < gridCols && right !== srcC)
+        return right;
+    const left = srcC - detourOffset;
+    if (left >= 0 && left < gridCols && left !== srcC)
+        return left;
+    return srcC;
+}
+function pushPoint(path, row, col) {
+    const previous = path[path.length - 1];
+    if (previous?.row === row && previous.col === col)
+        return;
+    path.push({ row, col });
+}
+function appendVertical(path, col, fromRow, toRow) {
+    const step = fromRow <= toRow ? 1 : -1;
+    for (let row = fromRow; row !== toRow + step; row += step) {
+        pushPoint(path, row, col);
+    }
+}
+function appendHorizontal(path, row, fromCol, toCol) {
+    const step = fromCol <= toCol ? 1 : -1;
+    for (let col = fromCol; col !== toCol + step; col += step) {
+        pushPoint(path, row, col);
+    }
+}
+/**
+ * Build the routed cell path for an edge, including the destination arrow cell.
+ *
+ * Same-column skip edges are detoured into the gap beside the node column so
+ * they do not disappear under intermediate node boxes.
+ */
+export function buildEdgeRoute(fromCol, fromLayer, toCol, toLayer, rowStride, colCenter, nodeWidth, nodeHeight, gridCols) {
+    const srcC = colCenter(fromLayer, fromCol);
+    const dstC = colCenter(toLayer, toCol);
+    const sRow = fromLayer * rowStride + nodeHeight;
+    const dRow = toLayer * rowStride - 1;
+    const mid = sRow + 1;
+    const path = [];
+    if (srcC === dstC && toLayer - fromLayer > 1) {
+        const detourC = chooseDetourColumn(srcC, nodeWidth, gridCols);
+        if (detourC === srcC) {
+            appendVertical(path, srcC, sRow, dRow);
+        }
+        else {
+            appendVertical(path, srcC, sRow, mid);
+            appendHorizontal(path, mid, srcC, detourC);
+            appendVertical(path, detourC, mid, dRow);
+            appendHorizontal(path, dRow, detourC, dstC);
+        }
+    }
+    else if (srcC === dstC) {
+        appendVertical(path, srcC, sRow, dRow);
+    }
+    else {
+        appendVertical(path, srcC, sRow, mid);
+        appendHorizontal(path, mid, srcC, dstC);
+        appendVertical(path, dstC, mid, dRow);
+    }
+    return {
+        path,
+        arrow: { row: dRow, col: dstC },
+    };
+}
+//# sourceMappingURL=dag-edges.part04.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"dag-edges.part04.js","sourceRoot":"","sources":["../../../src/core/components/dag-edges.part04.ts"],"names":[],"mappings":"AAEA,SAAS,kBAAkB,CACzB,IAAY,EACZ,SAAiB,EACjB,QAAgB;IAEhB,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACnD,MAAM,KAAK,GAAG,IAAI,GAAG,YAAY,CAAC;IAClC,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,GAAG,QAAQ,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,KAAK,CAAC;IACnE,MAAM,IAAI,GAAG,IAAI,GAAG,YAAY,CAAC;IACjC,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,GAAG,QAAQ,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAC/D,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,SAAS,CAAC,IAAiB,EAAE,GAAW,EAAE,GAAW;IAC5D,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACvC,IAAI,QAAQ,EAAE,GAAG,KAAK,GAAG,IAAI,QAAQ,CAAC,GAAG,KAAK,GAAG;QAAE,OAAO;IAC1D,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;AAC1B,CAAC;AAED,SAAS,cAAc,CACrB,IAAiB,EACjB,GAAW,EACX,OAAe,EACf,KAAa;IAEb,MAAM,IAAI,GAAG,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvC,KAAK,IAAI,GAAG,GAAG,OAAO,EAAE,GAAG,KAAK,KAAK,GAAG,IAAI,EAAE,GAAG,IAAI,IAAI,EAAE,CAAC;QAC1D,SAAS,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IAC5B,CAAC;AACH,CAAC;AAED,SAAS,gBAAgB,CACvB,IAAiB,EACjB,GAAW,EACX,OAAe,EACf,KAAa;IAEb,MAAM,IAAI,GAAG,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvC,KAAK,IAAI,GAAG,GAAG,OAAO,EAAE,GAAG,KAAK,KAAK,GAAG,IAAI,EAAE,GAAG,IAAI,IAAI,EAAE,CAAC;QAC1D,SAAS,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IAC5B,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAC5B,OAAe,EACf,SAAiB,EACjB,KAAa,EACb,OAAe,EACf,SAAiB,EACjB,SAAiD,EACjD,SAAiB,EACjB,UAAkB,EAClB,QAAgB;IAEhB,MAAM,IAAI,GAAG,SAAS,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IAC3C,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IACvC,MAAM,IAAI,GAAG,SAAS,GAAG,SAAS,GAAG,UAAU,CAAC;IAChD,MAAM,IAAI,GAAG,OAAO,GAAG,SAAS,GAAG,CAAC,CAAC;IACrC,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC;IACrB,MAAM,IAAI,GAAgB,EAAE,CAAC;IAE7B,IAAI,IAAI,KAAK,IAAI,IAAI,OAAO,GAAG,SAAS,GAAG,CAAC,EAAE,CAAC;QAC7C,MAAM,OAAO,GAAG,kBAAkB,CAAC,IAAI,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;QAC9D,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;YACrB,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QACzC,CAAC;aAAM,CAAC;YACN,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;YACtC,gBAAgB,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;YAC3C,cAAc,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;YACzC,gBAAgB,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;QAC9C,CAAC;IACH,CAAC;SAAM,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;QACzB,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IACzC,CAAC;SAAM,CAAC;QACN,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;QACtC,gBAAgB,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QACxC,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;IACxC,CAAC;IAED,OAAO;QACL,IAAI;QACJ,KAAK,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE;KAChC,CAAC;AACJ,CAAC"}

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

@@ -0,0 +1,3 @@
+import type { DagNode } from './dag.js';
+export declare function assignLayers(nodes: DagNode[]): Map<string, number>;
+//# sourceMappingURL=dag-layers.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"dag-layers.d.ts","sourceRoot":"","sources":["../../../src/core/components/dag-layers.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,UAAU,CAAC;AAKxC,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CA6FlE"}

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

@@ -0,0 +1,92 @@
+const edgeKey = (fromId, toId) => `${fromId}\u0000${toId}`;
+export function assignLayers(nodes) {
+    const nodeIds = new Set();
+    for (const node of nodes) {
+        if (nodeIds.has(node.id)) {
+            throw new Error(`[bijou] dag(): duplicate node id "${node.id}"`);
+        }
+        nodeIds.add(node.id);
+    }
+    const children = new Map();
+    const parents = new Map();
+    const inDegree = new Map();
+    const ignoredEdges = new Set();
+    for (const node of nodes) {
+        children.set(node.id, (node.edges ?? []).filter((edge) => nodeIds.has(edge)));
+    }
+    const visitState = new Map();
+    const visit = (id) => {
+        const state = visitState.get(id);
+        if (state === 'visiting' || state === 'done')
+            return;
+        visitState.set(id, 'visiting');
+        for (const childId of children.get(id) ?? []) {
+            const childState = visitState.get(childId);
+            if (childState === 'visiting') {
+                ignoredEdges.add(edgeKey(id, childId));
+            }
+            else if (childState !== 'done') {
+                visit(childId);
+            }
+        }
+        visitState.set(id, 'done');
+    };
+    for (const node of nodes)
+        visit(node.id);
+    const layerChildren = new Map();
+    for (const node of nodes) {
+        layerChildren.set(node.id, (children.get(node.id) ?? []).filter((childId) => !ignoredEdges.has(edgeKey(node.id, childId))));
+        inDegree.set(node.id, 0);
+        if (!parents.has(node.id))
+            parents.set(node.id, []);
+    }
+    for (const node of nodes) {
+        for (const childId of layerChildren.get(node.id) ?? []) {
+            const parentList = parents.get(childId);
+            if (parentList === undefined) {
+                parents.set(childId, [node.id]);
+            }
+            else {
+                parentList.push(node.id);
+            }
+            inDegree.set(childId, (inDegree.get(childId) ?? 0) + 1);
+        }
+    }
+    const queue = [];
+    for (const [id, degree] of inDegree) {
+        if (degree === 0)
+            queue.push(id);
+    }
+    const topologicalOrder = [];
+    let head = 0;
+    while (head < queue.length) {
+        const id = queue[head++];
+        if (id === undefined)
+            break;
+        topologicalOrder.push(id);
+        for (const childId of layerChildren.get(id) ?? []) {
+            const degree = (inDegree.get(childId) ?? 1) - 1;
+            inDegree.set(childId, degree);
+            if (degree === 0)
+                queue.push(childId);
+        }
+    }
+    if (topologicalOrder.length !== nodes.length) {
+        const scheduled = new Set(topologicalOrder);
+        for (const node of nodes) {
+            if (!scheduled.has(node.id))
+                topologicalOrder.push(node.id);
+        }
+    }
+    const layerMap = new Map();
+    for (const id of topologicalOrder) {
+        const nodeParents = parents.get(id) ?? [];
+        let layer = 0;
+        for (const parent of nodeParents) {
+            layer = Math.max(layer, (layerMap.get(parent) ?? 0) + 1);
+        }
+        layerMap.set(id, layer);
+    }
+    return layerMap;
+}
+//# sourceMappingURL=dag-layers.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"dag-layers.js","sourceRoot":"","sources":["../../../src/core/components/dag-layers.ts"],"names":[],"mappings":"AAEA,MAAM,OAAO,GAAG,CAAC,MAAc,EAAE,IAAY,EAAU,EAAE,CACvD,GAAG,MAAM,SAAS,IAAI,EAAE,CAAC;AAE3B,MAAM,UAAU,YAAY,CAAC,KAAgB;IAC3C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACzB,MAAM,IAAI,KAAK,CAAC,qCAAqC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACnE,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACvB,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;IAC3C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;IACvC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,QAAQ,CAAC,GAAG,CACV,IAAI,CAAC,EAAE,EACP,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CACvD,CAAC;IACJ,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,GAAG,EAA+B,CAAC;IAC1D,MAAM,KAAK,GAAG,CAAC,EAAU,EAAQ,EAAE;QACjC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjC,IAAI,KAAK,KAAK,UAAU,IAAI,KAAK,KAAK,MAAM;YAAE,OAAO;QACrD,UAAU,CAAC,GAAG,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;QAC/B,KAAK,MAAM,OAAO,IAAI,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YAC7C,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAC3C,IAAI,UAAU,KAAK,UAAU,EAAE,CAAC;gBAC9B,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC;YACzC,CAAC;iBAAM,IAAI,UAAU,KAAK,MAAM,EAAE,CAAC;gBACjC,KAAK,CAAC,OAAO,CAAC,CAAC;YACjB,CAAC;QACH,CAAC;QACD,UAAU,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IAC7B,CAAC,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEzC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAoB,CAAC;IAClD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,aAAa,CAAC,GAAG,CACf,IAAI,CAAC,EAAE,EACP,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAClC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,CAC1D,CACF,CAAC;QACF,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACtD,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,OAAO,IAAI,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YACvD,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACxC,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;gBAC7B,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YAClC,CAAC;iBAAM,CAAC;gBACN,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC3B,CAAC;YACD,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,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACpC,IAAI,MAAM,KAAK,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnC,CAAC;IACD,MAAM,gBAAgB,GAAa,EAAE,CAAC;IACtC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,OAAO,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC3B,MAAM,EAAE,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;QACzB,IAAI,EAAE,KAAK,SAAS;YAAE,MAAM;QAC5B,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC1B,KAAK,MAAM,OAAO,IAAI,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YAClD,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;IACD,IAAI,gBAAgB,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;QAC7C,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,gBAAgB,CAAC,CAAC;QAC5C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC9D,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,EAAE,IAAI,gBAAgB,EAAE,CAAC;QAClC,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QAC1C,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,MAAM,IAAI,WAAW,EAAE,CAAC;YACjC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3D,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAC1B,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC"}

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

@@ -4,17 +4,6 @@
  * 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.
- *
- * Detects cycle-forming back-edges with a DFS, ignores those edges for the
- * layering pass, then assigns each node to the layer one past its deepest
- * remaining 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.
- */
-export declare function assignLayers(nodes: DagNode[]): Map<string, number>;
 /**
  * Group node IDs into layer arrays indexed by layer number.
  *
@@ -33,4 +22,5 @@ export declare function buildLayerArrays(nodes: DagNode[], layerMap: Map<string,
  * @param nodes - All graph nodes (used to build adjacency maps).
  */
 export declare function orderColumns(layers: string[][], nodes: DagNode[]): void;
+export { assignLayers } from './dag-layers.js';
 //# sourceMappingURL=dag-layout.d.ts.map

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

@@ -1 +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;;;;;;;;;GASG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAqGlE;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,CAqDvE"}
+{"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;;;;;;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,CA4DvE;AAED,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC"}

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

@@ -3,118 +3,6 @@
  *
  * 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.
- *
- * Detects cycle-forming back-edges with a DFS, ignores those edges for the
- * layering pass, then assigns each node to the layer one past its deepest
- * remaining 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.
- */
-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();
-    const ignoredEdges = new Set();
-    for (const n of nodes) {
-        children.set(n.id, (n.edges ?? []).filter(e => nodeIds.has(e)));
-    }
-    const edgeKey = (fromId, toId) => `${fromId}\u0000${toId}`;
-    const visitState = new Map();
-    const visit = (id) => {
-        const state = visitState.get(id);
-        if (state === 'visiting' || state === 'done')
-            return;
-        visitState.set(id, 'visiting');
-        for (const childId of children.get(id) ?? []) {
-            const childState = visitState.get(childId);
-            if (childState === 'visiting') {
-                ignoredEdges.add(edgeKey(id, childId));
-                continue;
-            }
-            if (childState !== 'done')
-                visit(childId);
-        }
-        visitState.set(id, 'done');
-    };
-    for (const n of nodes)
-        visit(n.id);
-    const layerChildren = new Map();
-    for (const n of nodes) {
-        const filteredChildren = (children.get(n.id) ?? []).filter(childId => !ignoredEdges.has(edgeKey(n.id, childId)));
-        layerChildren.set(n.id, filteredChildren);
-        inDegree.set(n.id, 0);
-        if (!parents.has(n.id))
-            parents.set(n.id, []);
-    }
-    for (const n of nodes) {
-        for (const childId of layerChildren.get(n.id) ?? []) {
-            const parentList = parents.get(childId);
-            if (parentList === undefined)
-                parents.set(childId, [n.id]);
-            else
-                parentList.push(n.id);
-            inDegree.set(childId, (inDegree.get(childId) ?? 0) + 1);
-        }
-    }
-    const queue = [];
-    let head = 0;
-    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 (head < queue.length) {
-        const id = queue[head++];
-        if (id === undefined)
-            break;
-        topoOrder.push(id);
-        for (const childId of layerChildren.get(id) ?? []) {
-            const newDeg = (inDegree.get(childId) ?? 1) - 1;
-            inDegree.set(childId, newDeg);
-            if (newDeg === 0)
-                queue.push(childId);
-        }
-    }
-    if (topoOrder.length !== nodes.length) {
-        // DFS back-edge stripping should leave an acyclic layering graph. If a
-        // residual cycle survives, keep the renderer graceful by appending the
-        // unscheduled nodes in source order instead of failing the whole render.
-        const scheduled = new Set(topoOrder);
-        for (const n of nodes) {
-            if (!scheduled.has(n.id))
-                topoOrder.push(n.id);
-        }
-    }
-    // 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.
@@ -171,7 +59,7 @@ export function orderColumns(layers, nodes) {
         prevLayer.forEach((id, i) => prevIndex.set(id, i));
         const bary = new Map();
         for (const id of curLayer) {
-            const pars = (parentsMap.get(id) ?? []).filter(p => prevIndex.has(p));
+            const pars = (parentsMap.get(id) ?? []).filter((p) => prevIndex.has(p));
             if (pars.length === 0) {
                 bary.set(id, Infinity);
             }
@@ -190,7 +78,7 @@ export function orderColumns(layers, nodes) {
         nextLayer.forEach((id, i) => nextIndex.set(id, i));
         const bary = new Map();
         for (const id of curLayer) {
-            const chlds = (childrenMap.get(id) ?? []).filter(c => nextIndex.has(c));
+            const chlds = (childrenMap.get(id) ?? []).filter((c) => nextIndex.has(c));
             if (chlds.length === 0) {
                 bary.set(id, Infinity);
             }
@@ -202,4 +90,5 @@ export function orderColumns(layers, nodes) {
         curLayer.sort((a, b) => (bary.get(a) ?? Infinity) - (bary.get(b) ?? Infinity));
     }
 }
+export { assignLayers } from './dag-layers.js';
 //# sourceMappingURL=dag-layout.js.map