excalidraw-gen 0.1.0

package/dist/layout/arrow-router.js

@@ -0,0 +1,171 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.VERTICAL_THRESHOLD = void 0;
+exports.routeArrow = routeArrow;
+// ── Edge anchor calculation ──────────────────────────────────────────────────
+const FIXED_POINTS = {
+    top: [0.5, 0],
+    bottom: [0.5, 1],
+    left: [0, 0.5],
+    right: [1, 0.5],
+};
+function getEdgeAnchor(node, side) {
+    let x, y;
+    switch (side) {
+        case "top":
+            x = node.x + node.width / 2;
+            y = node.y;
+            break;
+        case "bottom":
+            x = node.x + node.width / 2;
+            y = node.y + node.height;
+            break;
+        case "left":
+            x = node.x;
+            y = node.y + node.height / 2;
+            break;
+        case "right":
+            x = node.x + node.width;
+            y = node.y + node.height / 2;
+            break;
+    }
+    return { x, y, side, fixedPoint: FIXED_POINTS[side] };
+}
+/** Stagger start anchor for N arrows leaving the same edge.
+ * Only applied to left/right exits — for top/bottom, the step routing
+ * pattern naturally keeps arrows distinguishable without staggering the start.
+ */
+function staggerAnchor(node, side, index, total) {
+    // Top/bottom exits: always use center — step routing handles fan-out visually
+    if (side === "top" || side === "bottom" || total <= 1) {
+        return getEdgeAnchor(node, side);
+    }
+    // Left/right exits: stagger vertically along the edge
+    const pct = 0.2 + (0.6 * index) / (total - 1);
+    const x = side === "right" ? node.x + node.width : node.x;
+    const y = node.y + node.height * pct;
+    return {
+        x,
+        y,
+        side,
+        fixedPoint: [FIXED_POINTS[side][0], pct],
+    };
+}
+// ── Best edge selection ──────────────────────────────────────────────────────
+/**
+ * Minimum y-difference to consider nodes as being on different rows.
+ * Matches SPACING_Y * 0.4 from the layout engine (150 * 0.4 = 60).
+ * Exported so the renderer can use the same threshold for stagger grouping.
+ */
+exports.VERTICAL_THRESHOLD = 60;
+/**
+ * Choose optimal source → target edge sides based on relative position.
+ * Strongly prefers vertical (bottom→top / top→bottom) routing when the
+ * target is in a different layout row — prevents backward/crossing arrows.
+ * Only falls back to horizontal routing for same-row connections.
+ */
+function chooseSides(source, target) {
+    const sc = { x: source.x + source.width / 2, y: source.y + source.height / 2 };
+    const tc = { x: target.x + target.width / 2, y: target.y + target.height / 2 };
+    const dx = tc.x - sc.x;
+    const dy = tc.y - sc.y;
+    // Different rows: always route vertically regardless of horizontal offset.
+    // This avoids backward/crossing arrows when nodes are side-by-side across rows.
+    if (Math.abs(dy) > exports.VERTICAL_THRESHOLD) {
+        if (dy > 0)
+            return { sourceSide: "bottom", targetSide: "top" };
+        else
+            return { sourceSide: "top", targetSide: "bottom" };
+    }
+    // Same row: route horizontally.
+    if (dx > 0)
+        return { sourceSide: "right", targetSide: "left" };
+    if (dx < 0)
+        return { sourceSide: "left", targetSide: "right" };
+    // Fallback (same position — self-loop guard should have filtered this)
+    return { sourceSide: "bottom", targetSide: "top" };
+}
+// ── Bounding box of points ───────────────────────────────────────────────────
+function boundingBox(points) {
+    let maxAbsX = 0;
+    let maxAbsY = 0;
+    for (const [px, py] of points) {
+        if (Math.abs(px) > maxAbsX)
+            maxAbsX = Math.abs(px);
+        if (Math.abs(py) > maxAbsY)
+            maxAbsY = Math.abs(py);
+    }
+    return { width: Math.max(maxAbsX, 1), height: Math.max(maxAbsY, 1) };
+}
+// ── Elbow point generation ───────────────────────────────────────────────────
+function buildElbowPoints(sourceAnchor, targetAnchor) {
+    const dx = targetAnchor.x - sourceAnchor.x;
+    const dy = targetAnchor.y - sourceAnchor.y;
+    const sourceSide = sourceAnchor.side;
+    const CLEARANCE = 50;
+    // Row gap between levels is 70px — use ~half of it so the horizontal
+    // segment of a step-routed arrow stays in the lane between rows,
+    // not through intermediate nodes on skip-level connections.
+    const ROW_CLEARANCE = 35;
+    // Nearly straight lines
+    if (Math.abs(dx) < 2 && (sourceSide === "top" || sourceSide === "bottom")) {
+        return [[0, 0], [0, dy]];
+    }
+    if (Math.abs(dy) < 2 && (sourceSide === "left" || sourceSide === "right")) {
+        return [[0, 0], [dx, 0]];
+    }
+    switch (sourceSide) {
+        case "bottom":
+        case "top": {
+            if (targetAnchor.side === "top" || targetAnchor.side === "bottom") {
+                // Step routing: exit downward/upward ROW_CLEARANCE px (into the row gap),
+                // turn horizontal, then continue to target.
+                // Using ROW_CLEARANCE (not halfDy) ensures the horizontal segment stays
+                // just below/above the source node — skip-level arrows never cut through
+                // intermediate nodes that sit at the dy/2 position.
+                const exitDir = sourceSide === "bottom" ? 1 : -1;
+                const exitOffset = exitDir * ROW_CLEARANCE;
+                return [[0, 0], [0, exitOffset], [dx, exitOffset], [dx, dy]];
+            }
+            // bottom/top → left/right side: exit vertically first, then go across
+            return [[0, 0], [0, dy], [dx, dy]];
+        }
+        case "right":
+        case "left": {
+            if (targetAnchor.side === "left" || targetAnchor.side === "right") {
+                if (sourceSide === "right" &&
+                    targetAnchor.side === "left" &&
+                    targetAnchor.x > sourceAnchor.x) {
+                    // Straight across with Y correction
+                    return Math.abs(dy) < 2 ? [[0, 0], [dx, 0]] : [[0, 0], [dx, 0], [dx, dy]];
+                }
+                // U-turn: same side or back direction
+                return [
+                    [0, 0],
+                    [CLEARANCE, 0],
+                    [CLEARANCE, dy],
+                    [dx, dy],
+                ];
+            }
+            return [[0, 0], [dx, 0], [dx, dy]];
+        }
+    }
+    // Fallback — straight line
+    return [[0, 0], [dx, dy]];
+}
+// ── Public API ───────────────────────────────────────────────────────────────
+/**
+ * Route an elbow arrow from source → target nodes.
+ *
+ * @param sourceEdgeIndex  0-based index of this arrow among all arrows sharing the same source edge
+ * @param totalFromSource  total count of arrows leaving from the same edge of source
+ */
+function routeArrow(source, target, sourceEdgeIndex = 0, totalFromSource = 1) {
+    const { sourceSide, targetSide } = chooseSides(source, target);
+    const sourceAnchor = staggerAnchor(source, sourceSide, sourceEdgeIndex, totalFromSource);
+    const targetAnchor = getEdgeAnchor(target, targetSide);
+    const points = buildElbowPoints(sourceAnchor, targetAnchor);
+    const { width, height } = boundingBox(points);
+    return { sourceAnchor, targetAnchor, points, width, height };
+}
+//# sourceMappingURL=arrow-router.js.map

package/dist/layout/arrow-router.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"arrow-router.js","sourceRoot":"","sources":["../../src/layout/arrow-router.ts"],"names":[],"mappings":";;;AAiMA,gCAeC;AAzMD,gFAAgF;AAEhF,MAAM,YAAY,GAAuC;IACvD,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;IACb,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;IAChB,IAAI,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC;IACd,KAAK,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC;CAChB,CAAC;AAEF,SAAS,aAAa,CAAC,IAAgB,EAAE,IAAc;IACrD,IAAI,CAAS,EAAE,CAAS,CAAC;IACzB,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,KAAK;YACR,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;YAC5B,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;YACX,MAAM;QACR,KAAK,QAAQ;YACX,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;YAC5B,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;YACzB,MAAM;QACR,KAAK,MAAM;YACT,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;YACX,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YAC7B,MAAM;QACR,KAAK,OAAO;YACV,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;YACxB,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YAC7B,MAAM;IACV,CAAC;IACD,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC;AACxD,CAAC;AAED;;;GAGG;AACH,SAAS,aAAa,CACpB,IAAgB,EAChB,IAAc,EACd,KAAa,EACb,KAAa;IAEb,8EAA8E;IAC9E,IAAI,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,QAAQ,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;QACtD,OAAO,aAAa,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACnC,CAAC;IAED,sDAAsD;IACtD,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IAC9C,MAAM,CAAC,GAAG,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC1D,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;IAErC,OAAO;QACL,CAAC;QACD,CAAC;QACD,IAAI;QACJ,UAAU,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC;KACzC,CAAC;AACJ,CAAC;AAED,gFAAgF;AAEhF;;;;GAIG;AACU,QAAA,kBAAkB,GAAG,EAAE,CAAC;AAErC;;;;;GAKG;AACH,SAAS,WAAW,CAClB,MAAkB,EAClB,MAAkB;IAElB,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;IAC/E,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;IAE/E,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAEvB,2EAA2E;IAC3E,gFAAgF;IAChF,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,0BAAkB,EAAE,CAAC;QACtC,IAAI,EAAE,GAAG,CAAC;YAAE,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;;YAC1D,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC;IAC1D,CAAC;IAED,gCAAgC;IAChC,IAAI,EAAE,GAAG,CAAC;QAAE,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC;IAC/D,IAAI,EAAE,GAAG,CAAC;QAAE,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC;IAE/D,uEAAuE;IACvE,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;AACrD,CAAC;AAED,gFAAgF;AAEhF,SAAS,WAAW,CAAC,MAA0B;IAC7C,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC;QAC9B,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO;YAAE,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACnD,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO;YAAE,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACrD,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC;AACvE,CAAC;AAED,gFAAgF;AAEhF,SAAS,gBAAgB,CACvB,YAAwB,EACxB,YAAwB;IAExB,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC;IAC3C,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC;IAC3C,MAAM,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC;IAErC,MAAM,SAAS,GAAG,EAAE,CAAC;IACrB,qEAAqE;IACrE,iEAAiE;IACjE,4DAA4D;IAC5D,MAAM,aAAa,GAAG,EAAE,CAAC;IAEzB,wBAAwB;IACxB,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,KAAK,KAAK,IAAI,UAAU,KAAK,QAAQ,CAAC,EAAE,CAAC;QAC1E,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC3B,CAAC;IACD,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,KAAK,MAAM,IAAI,UAAU,KAAK,OAAO,CAAC,EAAE,CAAC;QAC1E,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC;IAED,QAAQ,UAAU,EAAE,CAAC;QACnB,KAAK,QAAQ,CAAC;QACd,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,IAAI,YAAY,CAAC,IAAI,KAAK,KAAK,IAAI,YAAY,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;gBAClE,0EAA0E;gBAC1E,4CAA4C;gBAC5C,wEAAwE;gBACxE,yEAAyE;gBACzE,oDAAoD;gBACpD,MAAM,OAAO,GAAG,UAAU,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACjD,MAAM,UAAU,GAAG,OAAO,GAAG,aAAa,CAAC;gBAC3C,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,CAAC,EAAE,CAAC,EAAE,EAAE,UAAU,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YAC/D,CAAC;YACD,sEAAsE;YACtE,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACrC,CAAC;QACD,KAAK,OAAO,CAAC;QACb,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,IAAI,YAAY,CAAC,IAAI,KAAK,MAAM,IAAI,YAAY,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;gBAClE,IACE,UAAU,KAAK,OAAO;oBACtB,YAAY,CAAC,IAAI,KAAK,MAAM;oBAC5B,YAAY,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,EAC/B,CAAC;oBACD,oCAAoC;oBACpC,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;gBAC5E,CAAC;gBACD,sCAAsC;gBACtC,OAAO;oBACL,CAAC,CAAC,EAAE,CAAC,CAAC;oBACN,CAAC,SAAS,EAAE,CAAC,CAAC;oBACd,CAAC,SAAS,EAAE,EAAE,CAAC;oBACf,CAAC,EAAE,EAAE,EAAE,CAAC;iBACT,CAAC;YACJ,CAAC;YACD,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IACD,2BAA2B;IAC3B,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;AAC5B,CAAC;AAED,gFAAgF;AAEhF;;;;;GAKG;AACH,SAAgB,UAAU,CACxB,MAAkB,EAClB,MAAkB,EAClB,eAAe,GAAG,CAAC,EACnB,eAAe,GAAG,CAAC;IAEnB,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,GAAG,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAE/D,MAAM,YAAY,GAAG,aAAa,CAAC,MAAM,EAAE,UAAU,EAAE,eAAe,EAAE,eAAe,CAAC,CAAC;IACzF,MAAM,YAAY,GAAG,aAAa,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IAEvD,MAAM,MAAM,GAAG,gBAAgB,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;IAC5D,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;IAE9C,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;AAC/D,CAAC"}

package/dist/layout/dag.d.ts

@@ -0,0 +1,13 @@
+import type { Diagram, LayoutNode } from "../types/index.js";
+/**
+ * BFS-based layered DAG layout using Kahn's algorithm.
+ * Each node is enqueued exactly once (when all its predecessors are processed),
+ * so cycles can never cause an infinite loop — cycle nodes are placed after the
+ * DAG portion at maxLevel + 1.
+ */
+export declare function layoutDAG(diagram: Diagram): LayoutNode[];
+/**
+ * BFS-based layered DAG layout.
+ * 1. Assign each node a level via BFS from roots (nodes with no incoming edges).
+ * 2. Within each level, position nodes in a row and center each row against the widest row.
+ */

package/dist/layout/dag.js

@@ -0,0 +1,158 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.layoutDAG = layoutDAG;
+const DEFAULT_NODE_WIDTH = 180;
+const DEFAULT_NODE_HEIGHT = 80;
+const MIN_NODE_HEIGHT = 60;
+const SPACING_X = 220; // horizontal gap between node left edges
+const SPACING_GAP_Y = 70; // vertical gap between bottom of one row and top of next
+const MARGIN_X = 80;
+const MARGIN_Y = 80;
+// Font constants mirrored from renderer — used to estimate node height from label
+const FONT_SIZE = 16;
+const LINE_HEIGHT = 1.25;
+const CHAR_WIDTH_EST = 9; // approximate px per character at fontSize 16
+const TEXT_PADDING_X = 16; // total horizontal text padding
+const TEXT_PADDING_Y = 24; // total vertical text padding
+/** Estimate how many lines a label needs inside a box of the given width. */
+function estimateLines(label, nodeWidth) {
+    const charsPerLine = Math.max(1, Math.floor((nodeWidth - TEXT_PADDING_X) / CHAR_WIDTH_EST));
+    let lines = 0;
+    for (const para of label.split("\n")) {
+        lines += Math.max(1, Math.ceil(para.length / charsPerLine));
+    }
+    return lines;
+}
+/** Compute the effective node height accounting for label wrapping. */
+function effectiveHeight(label, nodeWidth, styleHeight) {
+    if (styleHeight !== undefined)
+        return styleHeight;
+    const lines = estimateLines(label, nodeWidth);
+    const textH = Math.ceil(lines * FONT_SIZE * LINE_HEIGHT);
+    return Math.max(MIN_NODE_HEIGHT, textH + TEXT_PADDING_Y);
+}
+/**
+ * BFS-based layered DAG layout using Kahn's algorithm.
+ * Each node is enqueued exactly once (when all its predecessors are processed),
+ * so cycles can never cause an infinite loop — cycle nodes are placed after the
+ * DAG portion at maxLevel + 1.
+ */
+function layoutDAG(diagram) {
+    const { nodes, edges } = diagram;
+    if (nodes.length === 0)
+        return [];
+    const nodeIds = nodes.map((n) => n.id);
+    const inDegree = new Map();
+    const adjacency = new Map();
+    for (const id of nodeIds) {
+        inDegree.set(id, 0);
+        adjacency.set(id, []);
+    }
+    for (const edge of edges) {
+        if (edge.from !== edge.to) {
+            adjacency.get(edge.from)?.push(edge.to);
+            inDegree.set(edge.to, (inDegree.get(edge.to) ?? 0) + 1);
+        }
+    }
+    // ── Kahn's level assignment (no infinite loop) ────────────────────────────
+    // A node is enqueued only when its in-degree reaches 0 (all predecessors done).
+    // Cycle nodes never reach in-degree 0, so they never enter the queue.
+    const inDegreeMut = new Map(inDegree);
+    const level = new Map();
+    const queue = [];
+    for (const [id, deg] of inDegreeMut) {
+        if (deg === 0) {
+            level.set(id, 0);
+            queue.push(id);
+        }
+    }
+    while (queue.length) {
+        const curr = queue.shift();
+        const currLevel = level.get(curr) ?? 0;
+        for (const neighbor of adjacency.get(curr) ?? []) {
+            // Longest-path level update
+            const proposed = currLevel + 1;
+            if (!level.has(neighbor) || proposed > (level.get(neighbor) ?? 0)) {
+                level.set(neighbor, proposed);
+            }
+            const newDeg = (inDegreeMut.get(neighbor) ?? 0) - 1;
+            inDegreeMut.set(neighbor, newDeg);
+            if (newDeg === 0) {
+                queue.push(neighbor);
+            }
+        }
+    }
+    // Place cycle nodes (never reached in-degree 0) after the DAG portion
+    if (level.size === 0) {
+        // Fully cyclic graph — all at level 0
+        for (const id of nodeIds)
+            level.set(id, 0);
+    }
+    else {
+        const maxLevel = Math.max(...level.values());
+        for (const id of nodeIds) {
+            if (!level.has(id))
+                level.set(id, maxLevel + 1);
+        }
+    }
+    // ── Group nodes by level ─────────────────────────────────────────────────
+    const levelGroups = new Map();
+    for (const [id, lvl] of level) {
+        if (!levelGroups.has(lvl))
+            levelGroups.set(lvl, []);
+        levelGroups.get(lvl).push(id);
+    }
+    const sortedLevels = [...levelGroups.keys()].sort((a, b) => a - b);
+    // Widest level (node count) drives the total canvas width
+    const maxLevelCount = Math.max(...sortedLevels.map((l) => levelGroups.get(l).length));
+    const totalCanvasWidth = maxLevelCount * SPACING_X;
+    // ── Compute effective dimensions per node ─────────────────────────────────
+    const nodeMap = new Map(nodes.map((n) => [n.id, n]));
+    const nodeDims = new Map();
+    for (const id of nodeIds) {
+        const n = nodeMap.get(id);
+        const w = n.style?.width ?? DEFAULT_NODE_WIDTH;
+        const h = effectiveHeight(n.label, w, n.style?.height);
+        nodeDims.set(id, { width: w, height: h });
+    }
+    // ── Compute cumulative Y per level (dynamic row heights) ──────────────────
+    let cumulativeY = MARGIN_Y;
+    const levelY = new Map();
+    for (const lvl of sortedLevels) {
+        levelY.set(lvl, cumulativeY);
+        const maxH = Math.max(...levelGroups.get(lvl).map((id) => nodeDims.get(id).height));
+        cumulativeY += maxH + SPACING_GAP_Y;
+    }
+    // ── Build LayoutNode array ───────────────────────────────────────────────
+    const layoutNodes = [];
+    for (const lvl of sortedLevels) {
+        const group = levelGroups.get(lvl);
+        group.sort((a, b) => nodeIds.indexOf(a) - nodeIds.indexOf(b));
+        const levelWidth = group.length * SPACING_X;
+        const offsetX = MARGIN_X + Math.floor((totalCanvasWidth - levelWidth) / 2);
+        group.forEach((id, colIndex) => {
+            const inputNode = nodeMap.get(id);
+            const { width, height } = nodeDims.get(id);
+            layoutNodes.push({
+                id,
+                label: inputNode.label,
+                type: inputNode.type ?? "process",
+                metadata: inputNode.metadata,
+                style: inputNode.style,
+                x: offsetX + colIndex * SPACING_X,
+                y: levelY.get(lvl),
+                width,
+                height,
+                level: lvl,
+                colIndex,
+            });
+        });
+    }
+    return layoutNodes;
+}
+/**
+ * BFS-based layered DAG layout.
+ * 1. Assign each node a level via BFS from roots (nodes with no incoming edges).
+ * 2. Within each level, position nodes in a row and center each row against the widest row.
+ */
+//# sourceMappingURL=dag.js.map

package/dist/layout/dag.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dag.js","sourceRoot":"","sources":["../../src/layout/dag.ts"],"names":[],"mappings":";;AAyCA,8BA2HC;AAlKD,MAAM,kBAAkB,GAAG,GAAG,CAAC;AAC/B,MAAM,mBAAmB,GAAG,EAAE,CAAC;AAC/B,MAAM,eAAe,GAAG,EAAE,CAAC;AAC3B,MAAM,SAAS,GAAG,GAAG,CAAC,CAAC,yCAAyC;AAChE,MAAM,aAAa,GAAG,EAAE,CAAC,CAAC,yDAAyD;AACnF,MAAM,QAAQ,GAAG,EAAE,CAAC;AACpB,MAAM,QAAQ,GAAG,EAAE,CAAC;AAEpB,kFAAkF;AAClF,MAAM,SAAS,GAAG,EAAE,CAAC;AACrB,MAAM,WAAW,GAAG,IAAI,CAAC;AACzB,MAAM,cAAc,GAAG,CAAC,CAAC,CAAG,8CAA8C;AAC1E,MAAM,cAAc,GAAG,EAAE,CAAC,CAAE,gCAAgC;AAC5D,MAAM,cAAc,GAAG,EAAE,CAAC,CAAE,8BAA8B;AAE1D,6EAA6E;AAC7E,SAAS,aAAa,CAAC,KAAa,EAAE,SAAiB;IACrD,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,SAAS,GAAG,cAAc,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC;IAC5F,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QACrC,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC;IAC9D,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,uEAAuE;AACvE,SAAS,eAAe,CAAC,KAAa,EAAE,SAAiB,EAAE,WAAoB;IAC7E,IAAI,WAAW,KAAK,SAAS;QAAE,OAAO,WAAW,CAAC;IAClD,MAAM,KAAK,GAAG,aAAa,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IAC9C,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,SAAS,GAAG,WAAW,CAAC,CAAC;IACzD,OAAO,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,KAAK,GAAG,cAAc,CAAC,CAAC;AAC3D,CAAC;AAED;;;;;GAKG;AACH,SAAgB,SAAS,CAAC,OAAgB;IACxC,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC;IAEjC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAElC,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACvC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE9C,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;QACzB,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACpB,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACxB,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC;YAC1B,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACxC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IAED,6EAA6E;IAC7E,gFAAgF;IAChF,sEAAsE;IACtE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;IACtC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,WAAW,EAAE,CAAC;QACpC,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;YACd,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACjB,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC5B,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,KAAK,MAAM,QAAQ,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACjD,4BAA4B;YAC5B,MAAM,QAAQ,GAAG,SAAS,GAAG,CAAC,CAAC;YAC/B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,QAAQ,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;gBAClE,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YAChC,CAAC;YACD,MAAM,MAAM,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACpD,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAClC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;gBACjB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;IACH,CAAC;IAED,sEAAsE;IACtE,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACrB,sCAAsC;QACtC,KAAK,MAAM,EAAE,IAAI,OAAO;YAAE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC7C,CAAC;SAAM,CAAC;QACN,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;QAC7C,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACzB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IAED,4EAA4E;IAC5E,MAAM,WAAW,GAAG,IAAI,GAAG,EAAoB,CAAC;IAChD,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC;QAC9B,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACpD,WAAW,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjC,CAAC;IACD,MAAM,YAAY,GAAG,CAAC,GAAG,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAEnE,0DAA0D;IAC1D,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,MAAM,CAAC,CAAC,CAAC;IACvF,MAAM,gBAAgB,GAAG,aAAa,GAAG,SAAS,CAAC;IAEnD,6EAA6E;IAC7E,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA6C,CAAC;IACtE,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,IAAI,kBAAkB,CAAC;QAC/C,MAAM,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACvD,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;IAC5C,CAAC;IAED,6EAA6E;IAC7E,IAAI,WAAW,GAAG,QAAQ,CAAC;IAC3B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;QAC/B,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC;QAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,MAAM,CAAC,CAAC,CAAC;QACtF,WAAW,IAAI,IAAI,GAAG,aAAa,CAAC;IACtC,CAAC;IAED,4EAA4E;IAC5E,MAAM,WAAW,GAAiB,EAAE,CAAC;IAErC,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;QACpC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QAE9D,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC;QAC5C,MAAM,OAAO,GAAG,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,gBAAgB,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;QAE3E,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE;YAC7B,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YACnC,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YAC5C,WAAW,CAAC,IAAI,CAAC;gBACf,EAAE;gBACF,KAAK,EAAE,SAAS,CAAC,KAAK;gBACtB,IAAI,EAAE,SAAS,CAAC,IAAI,IAAI,SAAS;gBACjC,QAAQ,EAAE,SAAS,CAAC,QAAQ;gBAC5B,KAAK,EAAE,SAAS,CAAC,KAAK;gBACtB,CAAC,EAAE,OAAO,GAAG,QAAQ,GAAG,SAAS;gBACjC,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE;gBACnB,KAAK;gBACL,MAAM;gBACN,KAAK,EAAE,GAAG;gBACV,QAAQ;aACT,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC;IAED,OAAO,WAAW,CAAC;AACrB,CAAC;AAGD;;;;GAIG"}

package/dist/layout/grid.d.ts

@@ -0,0 +1,3 @@
+import type { Diagram, LayoutNode } from "../types/index.js";
+/** Simple grid layout: arranges nodes in rows of sqrt(n) columns */
+export declare function layoutGrid(diagram: Diagram): LayoutNode[];

package/dist/layout/grid.js

@@ -0,0 +1,52 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.layoutGrid = layoutGrid;
+const DEFAULT_NODE_WIDTH = 180;
+const DEFAULT_NODE_HEIGHT = 80;
+const MIN_NODE_HEIGHT = 60;
+const SPACING_X = 220;
+const SPACING_Y = 150;
+const MARGIN_X = 80;
+const MARGIN_Y = 80;
+const FONT_SIZE = 16;
+const LINE_HEIGHT = 1.25;
+const CHAR_WIDTH_EST = 9;
+const TEXT_PADDING_X = 16;
+const TEXT_PADDING_Y = 24;
+function effectiveHeight(label, nodeWidth, styleHeight) {
+    if (styleHeight !== undefined)
+        return styleHeight;
+    const charsPerLine = Math.max(1, Math.floor((nodeWidth - TEXT_PADDING_X) / CHAR_WIDTH_EST));
+    let lines = 0;
+    for (const para of label.split("\n")) {
+        lines += Math.max(1, Math.ceil(para.length / charsPerLine));
+    }
+    return Math.max(MIN_NODE_HEIGHT, Math.ceil(lines * FONT_SIZE * LINE_HEIGHT) + TEXT_PADDING_Y);
+}
+/** Simple grid layout: arranges nodes in rows of sqrt(n) columns */
+function layoutGrid(diagram) {
+    const { nodes } = diagram;
+    if (nodes.length === 0)
+        return [];
+    const cols = Math.max(1, Math.ceil(Math.sqrt(nodes.length)));
+    return nodes.map((node, i) => {
+        const col = i % cols;
+        const row = Math.floor(i / cols);
+        const w = node.style?.width ?? DEFAULT_NODE_WIDTH;
+        const h = effectiveHeight(node.label, w, node.style?.height);
+        return {
+            id: node.id,
+            label: node.label,
+            type: node.type ?? "process",
+            metadata: node.metadata,
+            style: node.style,
+            x: MARGIN_X + col * SPACING_X,
+            y: MARGIN_Y + row * SPACING_Y,
+            width: w,
+            height: h,
+            level: row,
+            colIndex: col,
+        };
+    });
+}
+//# sourceMappingURL=grid.js.map

package/dist/layout/grid.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"grid.js","sourceRoot":"","sources":["../../src/layout/grid.ts"],"names":[],"mappings":";;AA0BA,gCAyBC;AAjDD,MAAM,kBAAkB,GAAG,GAAG,CAAC;AAC/B,MAAM,mBAAmB,GAAG,EAAE,CAAC;AAC/B,MAAM,eAAe,GAAG,EAAE,CAAC;AAC3B,MAAM,SAAS,GAAG,GAAG,CAAC;AACtB,MAAM,SAAS,GAAG,GAAG,CAAC;AACtB,MAAM,QAAQ,GAAG,EAAE,CAAC;AACpB,MAAM,QAAQ,GAAG,EAAE,CAAC;AACpB,MAAM,SAAS,GAAG,EAAE,CAAC;AACrB,MAAM,WAAW,GAAG,IAAI,CAAC;AACzB,MAAM,cAAc,GAAG,CAAC,CAAC;AACzB,MAAM,cAAc,GAAG,EAAE,CAAC;AAC1B,MAAM,cAAc,GAAG,EAAE,CAAC;AAE1B,SAAS,eAAe,CAAC,KAAa,EAAE,SAAiB,EAAE,WAAoB;IAC7E,IAAI,WAAW,KAAK,SAAS;QAAE,OAAO,WAAW,CAAC;IAClD,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,SAAS,GAAG,cAAc,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC;IAC5F,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QACrC,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC;IAC9D,CAAC;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,SAAS,GAAG,WAAW,CAAC,GAAG,cAAc,CAAC,CAAC;AAChG,CAAC;AAED,oEAAoE;AACpE,SAAgB,UAAU,CAAC,OAAgB;IACzC,MAAM,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC;IAC1B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAElC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAE7D,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;QAC3B,MAAM,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC;QACrB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;QACjC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,KAAK,IAAI,kBAAkB,CAAC;QAClD,MAAM,CAAC,GAAG,eAAe,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC7D,OAAO;YACL,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,SAAS;YAC5B,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,CAAC,EAAE,QAAQ,GAAG,GAAG,GAAG,SAAS;YAC7B,CAAC,EAAE,QAAQ,GAAG,GAAG,GAAG,SAAS;YAC7B,KAAK,EAAE,CAAC;YACR,MAAM,EAAE,CAAC;YACT,KAAK,EAAE,GAAG;YACV,QAAQ,EAAE,GAAG;SACd,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/layout/index.d.ts

@@ -0,0 +1,5 @@
+import type { Diagram, LayoutNode, LayoutType } from "../types/index.js";
+type LayoutFn = (diagram: Diagram) => LayoutNode[];
+export declare function registerLayoutEngine(name: string, fn: LayoutFn): void;
+export declare function runLayout(diagram: Diagram, type: LayoutType): LayoutNode[];
+export {};

package/dist/layout/index.js

@@ -0,0 +1,21 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.registerLayoutEngine = registerLayoutEngine;
+exports.runLayout = runLayout;
+const dag_js_1 = require("./dag.js");
+const grid_js_1 = require("./grid.js");
+const registry = new Map([
+    ["dag", dag_js_1.layoutDAG],
+    ["grid", grid_js_1.layoutGrid],
+]);
+function registerLayoutEngine(name, fn) {
+    registry.set(name, fn);
+}
+function runLayout(diagram, type) {
+    const fn = registry.get(type);
+    if (!fn) {
+        throw new Error(`Unknown layout type: "${type}". Available: ${[...registry.keys()].join(", ")}`);
+    }
+    return fn(diagram);
+}
+//# sourceMappingURL=index.js.map

package/dist/layout/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/layout/index.ts"],"names":[],"mappings":";;AAWA,oDAEC;AAED,8BAQC;AAtBD,qCAAqC;AACrC,uCAAuC;AAIvC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAmB;IACzC,CAAC,KAAK,EAAE,kBAAS,CAAC;IAClB,CAAC,MAAM,EAAE,oBAAU,CAAC;CACrB,CAAC,CAAC;AAEH,SAAgB,oBAAoB,CAAC,IAAY,EAAE,EAAY;IAC7D,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;AACzB,CAAC;AAED,SAAgB,SAAS,CAAC,OAAgB,EAAE,IAAgB;IAC1D,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC9B,IAAI,CAAC,EAAE,EAAE,CAAC;QACR,MAAM,IAAI,KAAK,CACb,yBAAyB,IAAI,iBAAiB,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAChF,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,CAAC,OAAO,CAAC,CAAC;AACrB,CAAC"}

package/dist/normalizer/index.d.ts

@@ -0,0 +1,5 @@
+import type { Diagram } from "../types/index.js";
+export declare function normalize(diagram: Diagram): {
+    diagram: Diagram;
+    warnings: string[];
+};

package/dist/normalizer/index.js

@@ -0,0 +1,37 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.normalize = normalize;
+const DEFAULT_NODE_TYPE = "process";
+function normalize(diagram) {
+    const warnings = [];
+    const nodes = diagram.nodes.map((node) => ({
+        ...node,
+        id: node.id.trim(),
+        label: node.label.trim(),
+        type: (node.type ?? DEFAULT_NODE_TYPE).trim().toLowerCase(),
+        metadata: node.metadata ?? {},
+    }));
+    // Deduplicate edges: same directed from/to pair — keep first, warn on extras
+    const seenEdges = new Map(); // key → label of first seen
+    const edges = diagram.edges
+        .filter((edge) => {
+        const key = `${edge.from.trim()}→${edge.to.trim()}`;
+        if (seenEdges.has(key)) {
+            warnings.push(`Duplicate edge "${edge.from}" → "${edge.to}" dropped (only the first is kept)`);
+            return false;
+        }
+        seenEdges.set(key, edge.label);
+        return true;
+    })
+        .map((edge) => ({
+        ...edge,
+        from: edge.from.trim(),
+        to: edge.to.trim(),
+        label: edge.label?.trim(),
+    }));
+    return {
+        diagram: { ...diagram, nodes, edges, title: diagram.title?.trim() },
+        warnings,
+    };
+}
+//# sourceMappingURL=index.js.map

package/dist/normalizer/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/normalizer/index.ts"],"names":[],"mappings":";;AAIA,8BAoCC;AAtCD,MAAM,iBAAiB,GAAG,SAAS,CAAC;AAEpC,SAAgB,SAAS,CAAC,OAAgB;IACxC,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,MAAM,KAAK,GAAgB,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACtD,GAAG,IAAI;QACP,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE;QAClB,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE;QACxB,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,IAAI,iBAAiB,CAAC,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE;QAC3D,QAAQ,EAAE,IAAI,CAAC,QAAQ,IAAI,EAAE;KAC9B,CAAC,CAAC,CAAC;IAEJ,6EAA6E;IAC7E,MAAM,SAAS,GAAG,IAAI,GAAG,EAA8B,CAAC,CAAC,4BAA4B;IACrF,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK;SACxB,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE;QACf,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;QACpD,IAAI,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,QAAQ,CAAC,IAAI,CACX,mBAAmB,IAAI,CAAC,IAAI,QAAQ,IAAI,CAAC,EAAE,oCAAoC,CAChF,CAAC;YACF,OAAO,KAAK,CAAC;QACf,CAAC;QACD,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/B,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;SACD,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACd,GAAG,IAAI;QACP,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;QACtB,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE;QAClB,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE;KAC1B,CAAC,CAAC,CAAC;IAEN,OAAO;QACL,OAAO,EAAE,EAAE,GAAG,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE;QACnE,QAAQ;KACT,CAAC;AACJ,CAAC"}

package/dist/parser/index.d.ts

@@ -0,0 +1,5 @@
+import type { Diagram } from "../types/index.js";
+export declare class ParseError extends Error {
+    constructor(message: string);
+}
+export declare function parse(input: string): Diagram;