@graph-render/core 1.0.1

package/dist/layouts/treeAlignment.js

@@ -0,0 +1,69 @@
+import { DEFAULT_NODE_SIZE } from '../utils';
+import { calculateXPosition, calculateYPosition } from './treePositioning';
+/**
+ * Position all nodes initially based on their level
+ */
+export const positionNodesInLevels = (nodes, levels, levelMap, metrics, gap, padding, direction) => {
+    return nodes.map((node) => {
+        if (node.position)
+            return node;
+        const level = levelMap.get(node.id) ?? 0;
+        const levelNodes = levels[level] ?? [];
+        const idx = levelNodes.indexOf(node.id);
+        const nodeWidth = node.size?.width ?? DEFAULT_NODE_SIZE.width;
+        const x = calculateXPosition(level, metrics.maxLevel, nodeWidth, gap, padding, direction);
+        const y = calculateYPosition(idx, levelNodes, metrics.maxNodeHeight, gap, metrics.totalHeight, metrics.baseY);
+        return { ...node, position: { x, y } };
+    });
+};
+// FIX: deleted the file-private `getParentNodes` helper.  It was replaced by
+// the `incomingByTarget` Map built inside `alignNodesToParents` (O(n+e) vs the
+// previous O(n×e)) and was never exported, so no external callers exist.
+/**
+ * Calculate average Y center of parent nodes
+ */
+const calculateParentCentersAverage = (parentIds, posMap) => {
+    const centers = parentIds
+        .map((src) => posMap.get(src))
+        .filter((n) => !!n)
+        .map((n) => n.position.y + (n.size?.height ?? DEFAULT_NODE_SIZE.height) / 2);
+    if (!centers.length)
+        return null;
+    return centers.reduce((a, b) => a + b, 0) / centers.length;
+};
+/**
+ * Align nodes with multiple parents to their parent's average position
+ */
+export const alignNodesToParents = (positioned, edges, levels, maxLevel) => {
+    const posMap = new Map();
+    positioned.forEach((n) => posMap.set(n.id, n));
+    // FIX: build a target→sources index once instead of calling
+    // edges.filter(e => e.target === id) for every node (was O(nodes × edges)).
+    const incomingByTarget = new Map();
+    edges.forEach((e) => {
+        incomingByTarget.set(e.target, [...(incomingByTarget.get(e.target) ?? []), e.source]);
+    });
+    for (let level = 1; level <= maxLevel; level += 1) {
+        const ids = levels[level] ?? [];
+        ids.forEach((id) => {
+            const node = posMap.get(id);
+            if (!node)
+                return;
+            const parentIds = incomingByTarget.get(id) ?? [];
+            if (parentIds.length < 2)
+                return;
+            const avgCenterY = calculateParentCentersAverage(parentIds, posMap);
+            if (avgCenterY === null)
+                return;
+            const h = node.size?.height ?? DEFAULT_NODE_SIZE.height;
+            const newY = avgCenterY - h / 2;
+            const updated = {
+                ...node,
+                position: { ...node.position, y: newY },
+            };
+            posMap.set(id, updated);
+        });
+    }
+    return Array.from(posMap.values());
+};
+//# sourceMappingURL=treeAlignment.js.map

package/dist/layouts/treeAlignment.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"treeAlignment.js","sourceRoot":"","sources":["../../src/layouts/treeAlignment.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,iBAAiB,EAAE,MAAM,UAAU,CAAC;AAC7C,OAAO,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AAE3E;;GAEG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,CACnC,KAAiB,EACjB,MAAkB,EAClB,QAA6B,EAC7B,OAAoB,EACpB,GAAW,EACX,OAAe,EACf,SAA0B,EACR,EAAE;IACpB,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACxB,IAAI,IAAI,CAAC,QAAQ;YAAE,OAAO,IAAsB,CAAC;QAEjD,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QACzC,MAAM,UAAU,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;QACvC,MAAM,GAAG,GAAG,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxC,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,EAAE,KAAK,IAAI,iBAAiB,CAAC,KAAK,CAAC;QAE9D,MAAM,CAAC,GAAG,kBAAkB,CAAC,KAAK,EAAE,OAAO,CAAC,QAAQ,EAAE,SAAS,EAAE,GAAG,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;QAC1F,MAAM,CAAC,GAAG,kBAAkB,CAC1B,GAAG,EACH,UAAU,EACV,OAAO,CAAC,aAAa,EACrB,GAAG,EACH,OAAO,CAAC,WAAW,EACnB,OAAO,CAAC,KAAK,CACd,CAAC;QAEF,OAAO,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAoB,CAAC;IAC3D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,6EAA6E;AAC7E,+EAA+E;AAC/E,yEAAyE;AAEzE;;GAEG;AACH,MAAM,6BAA6B,GAAG,CACpC,SAAmB,EACnB,MAAmC,EACpB,EAAE;IACjB,MAAM,OAAO,GAAG,SAAS;SACtB,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;SAC7B,MAAM,CAAC,CAAC,CAAC,EAAuB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;SACvC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,MAAM,IAAI,iBAAiB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;IAE/E,IAAI,CAAC,OAAO,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IACjC,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;AAC7D,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,CACjC,UAA4B,EAC5B,KAAiB,EACjB,MAAkB,EAClB,QAAgB,EACE,EAAE;IACpB,MAAM,MAAM,GAAG,IAAI,GAAG,EAA0B,CAAC;IACjD,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAE/C,4DAA4D;IAC5D,4EAA4E;IAC5E,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAoB,CAAC;IACrD,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAClB,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IACxF,CAAC,CAAC,CAAC;IAEH,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,QAAQ,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QAClD,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;QAChC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE;YACjB,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC5B,IAAI,CAAC,IAAI;gBAAE,OAAO;YAElB,MAAM,SAAS,GAAG,gBAAgB,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;YACjD,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;gBAAE,OAAO;YAEjC,MAAM,UAAU,GAAG,6BAA6B,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;YACpE,IAAI,UAAU,KAAK,IAAI;gBAAE,OAAO;YAEhC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,MAAM,IAAI,iBAAiB,CAAC,MAAM,CAAC;YACxD,MAAM,IAAI,GAAG,UAAU,GAAG,CAAC,GAAG,CAAC,CAAC;YAChC,MAAM,OAAO,GAAG;gBACd,GAAG,IAAI;gBACP,QAAQ,EAAE,EAAE,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE;aACtB,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;IACL,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;AACrC,CAAC,CAAC"}

package/dist/layouts/treePositioning.d.ts

@@ -0,0 +1,14 @@
+import { NodeData, TreeMetrics, LayoutDirection } from '@graph-render/types';
+/**
+ * Calculate tree layout metrics
+ */
+export declare const calculateTreeMetrics: (nodes: NodeData[], levels: string[][], gap: number, padding: number, containerHeight?: number) => TreeMetrics;
+/**
+ * Calculate X position based on level and direction
+ */
+export declare const calculateXPosition: (level: number, maxLevel: number, nodeWidth: number, gap: number, padding: number, direction: LayoutDirection) => number;
+/**
+ * Calculate Y position for a node in a level
+ */
+export declare const calculateYPosition: (nodeIndex: number, levelNodes: string[], maxNodeHeight: number, gap: number, totalHeight: number, baseY: number) => number;
+//# sourceMappingURL=treePositioning.d.ts.map

package/dist/layouts/treePositioning.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"treePositioning.d.ts","sourceRoot":"","sources":["../../src/layouts/treePositioning.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAG7E;;GAEG;AACH,eAAO,MAAM,oBAAoB,GAC/B,OAAO,QAAQ,EAAE,EACjB,QAAQ,MAAM,EAAE,EAAE,EAClB,KAAK,MAAM,EACX,SAAS,MAAM,EACf,kBAAkB,MAAM,KACvB,WASF,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,kBAAkB,GAC7B,OAAO,MAAM,EACb,UAAU,MAAM,EAChB,WAAW,MAAM,EACjB,KAAK,MAAM,EACX,SAAS,MAAM,EACf,WAAW,eAAe,KACzB,MAIF,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,kBAAkB,GAC7B,WAAW,MAAM,EACjB,YAAY,MAAM,EAAE,EACpB,eAAe,MAAM,EACrB,KAAK,MAAM,EACX,aAAa,MAAM,EACnB,OAAO,MAAM,KACZ,MAKF,CAAC"}

package/dist/layouts/treePositioning.js

@@ -0,0 +1,30 @@
+import { LayoutDirection } from '@graph-render/types';
+import { getMaxNodeHeight } from '../utils';
+/**
+ * Calculate tree layout metrics
+ */
+export const calculateTreeMetrics = (nodes, levels, gap, padding, containerHeight) => {
+    const maxLevel = levels.length ? levels.length - 1 : 0;
+    const maxNodeHeight = getMaxNodeHeight(nodes);
+    const maxLevelCount = Math.max(1, ...levels.map((l) => l?.length ?? 0));
+    const totalHeight = maxLevelCount * maxNodeHeight + (maxLevelCount - 1) * gap;
+    const baseY = containerHeight != null ? Math.max(padding, (containerHeight - totalHeight) / 2) : padding;
+    return { maxLevel, maxNodeHeight, maxLevelCount, totalHeight, baseY };
+};
+/**
+ * Calculate X position based on level and direction
+ */
+export const calculateXPosition = (level, maxLevel, nodeWidth, gap, padding, direction) => {
+    const ltrX = padding + level * (nodeWidth + gap);
+    const rtlX = padding + (maxLevel - level) * (nodeWidth + gap);
+    return direction === LayoutDirection.RTL ? rtlX : ltrX;
+};
+/**
+ * Calculate Y position for a node in a level
+ */
+export const calculateYPosition = (nodeIndex, levelNodes, maxNodeHeight, gap, totalHeight, baseY) => {
+    const levelHeight = (levelNodes.length || 1) * maxNodeHeight + Math.max(0, (levelNodes.length || 1) - 1) * gap;
+    const levelStartY = baseY + (totalHeight - levelHeight) / 2;
+    return levelStartY + nodeIndex * (maxNodeHeight + gap);
+};
+//# sourceMappingURL=treePositioning.js.map

package/dist/layouts/treePositioning.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"treePositioning.js","sourceRoot":"","sources":["../../src/layouts/treePositioning.ts"],"names":[],"mappings":"AAAA,OAAO,EAAyB,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAC7E,OAAO,EAAE,gBAAgB,EAAE,MAAM,UAAU,CAAC;AAE5C;;GAEG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAClC,KAAiB,EACjB,MAAkB,EAClB,GAAW,EACX,OAAe,EACf,eAAwB,EACX,EAAE;IACf,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,MAAM,aAAa,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IAC9C,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC;IACxE,MAAM,WAAW,GAAG,aAAa,GAAG,aAAa,GAAG,CAAC,aAAa,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;IAC9E,MAAM,KAAK,GACT,eAAe,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,eAAe,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;IAE7F,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,aAAa,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC;AACxE,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAChC,KAAa,EACb,QAAgB,EAChB,SAAiB,EACjB,GAAW,EACX,OAAe,EACf,SAA0B,EAClB,EAAE;IACV,MAAM,IAAI,GAAG,OAAO,GAAG,KAAK,GAAG,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC;IACjD,MAAM,IAAI,GAAG,OAAO,GAAG,CAAC,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC;IAC9D,OAAO,SAAS,KAAK,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;AACzD,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAChC,SAAiB,EACjB,UAAoB,EACpB,aAAqB,EACrB,GAAW,EACX,WAAmB,EACnB,KAAa,EACL,EAAE;IACV,MAAM,WAAW,GACf,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;IAC7F,MAAM,WAAW,GAAG,KAAK,GAAG,CAAC,WAAW,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;IAC5D,OAAO,WAAW,GAAG,SAAS,GAAG,CAAC,aAAa,GAAG,GAAG,CAAC,CAAC;AACzD,CAAC,CAAC"}

package/dist/layouts/treeTopology.d.ts

@@ -0,0 +1,29 @@
+import { NodeData, EdgeData, GraphTopology } from '@graph-render/types';
+export declare const assertHierarchicalGraph: (nodes: NodeData[], edges: EdgeData[]) => void;
+/**
+ * Build graph topology from edges
+ */
+export declare const buildGraphTopology: (edges: EdgeData[]) => GraphTopology;
+/**
+ * Find root nodes (nodes with no incoming edges)
+ */
+export declare const findRootNodes: (nodes: NodeData[], incoming: Map<string, number>) => string[];
+/**
+ * Assign nodes to levels using BFS
+ */
+export declare const assignNodesToLevels: (nodes: NodeData[], rootIds: string[], outgoing: Map<string, string[]>) => Map<string, number>;
+/**
+ * Assign DAG-style max-depth levels using a single Kahn's BFS pass.
+ * Validates edge references and detects cycles in the same traversal,
+ * replacing the three-pass pattern of assertHierarchicalGraph +
+ * buildGraphTopology + an inline BFS.
+ */
+export declare const assignDagLevels: (nodes: NodeData[], edges: EdgeData[]) => {
+    levels: Map<string, number>;
+    outgoing: Map<string, string[]>;
+};
+/**
+ * Group nodes by their level
+ */
+export declare const groupNodesByLevel: (nodes: NodeData[], levelMap: Map<string, number>) => string[][];
+//# sourceMappingURL=treeTopology.d.ts.map

package/dist/layouts/treeTopology.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"treeTopology.d.ts","sourceRoot":"","sources":["../../src/layouts/treeTopology.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAExE,eAAO,MAAM,uBAAuB,GAAI,OAAO,QAAQ,EAAE,EAAE,OAAO,QAAQ,EAAE,KAAG,IAgD9E,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,kBAAkB,GAAI,OAAO,QAAQ,EAAE,KAAG,aAUtD,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,aAAa,GAAI,OAAO,QAAQ,EAAE,EAAE,UAAU,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,KAAG,MAAM,EAGtF,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,mBAAmB,GAC9B,OAAO,QAAQ,EAAE,EACjB,SAAS,MAAM,EAAE,EACjB,UAAU,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,KAC9B,GAAG,CAAC,MAAM,EAAE,MAAM,CAiBpB,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,eAAe,GAC1B,OAAO,QAAQ,EAAE,EACjB,OAAO,QAAQ,EAAE,KAChB;IAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAAC,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAA;CAuDhE,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,iBAAiB,GAAI,OAAO,QAAQ,EAAE,EAAE,UAAU,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,KAAG,MAAM,EAAE,EAa5F,CAAC"}

package/dist/layouts/treeTopology.js

@@ -0,0 +1,137 @@
+export const assertHierarchicalGraph = (nodes, edges) => {
+    if (!nodes.length) {
+        return;
+    }
+    const inDegree = new Map(nodes.map((node) => [node.id, 0]));
+    const outgoing = new Map();
+    for (const edge of edges) {
+        if (!inDegree.has(edge.source) || !inDegree.has(edge.target)) {
+            throw new Error(`Tree layout requires every edge to reference existing nodes. Invalid edge: ${edge.source} -> ${edge.target}.`);
+        }
+        inDegree.set(edge.target, (inDegree.get(edge.target) ?? 0) + 1);
+        outgoing.set(edge.source, [...(outgoing.get(edge.source) ?? []), edge.target]);
+    }
+    const queue = Array.from(inDegree.entries())
+        .filter(([, degree]) => degree === 0)
+        .map(([nodeId]) => nodeId);
+    if (!queue.length) {
+        throw new Error('Tree layout requires at least one root node and does not support cyclic graphs.');
+    }
+    let processed = 0;
+    for (let index = 0; index < queue.length; index += 1) {
+        const current = queue[index];
+        processed += 1;
+        for (const child of outgoing.get(current) ?? []) {
+            const nextDegree = (inDegree.get(child) ?? 0) - 1;
+            inDegree.set(child, nextDegree);
+            if (nextDegree === 0) {
+                queue.push(child);
+            }
+        }
+    }
+    if (processed !== nodes.length) {
+        throw new Error('Tree layout requires an acyclic graph. Cycles were detected in the input graph.');
+    }
+};
+/**
+ * Build graph topology from edges
+ */
+export const buildGraphTopology = (edges) => {
+    const incoming = new Map();
+    const outgoing = new Map();
+    edges.forEach((e) => {
+        incoming.set(e.target, (incoming.get(e.target) ?? 0) + 1);
+        outgoing.set(e.source, [...(outgoing.get(e.source) ?? []), e.target]);
+    });
+    return { incoming, outgoing };
+};
+/**
+ * Find root nodes (nodes with no incoming edges)
+ */
+export const findRootNodes = (nodes, incoming) => {
+    const roots = nodes.filter((n) => (incoming.get(n.id) ?? 0) === 0);
+    return roots.map((r) => r.id);
+};
+/**
+ * Assign nodes to levels using BFS
+ */
+export const assignNodesToLevels = (nodes, rootIds, outgoing) => {
+    const levelMap = new Map();
+    const queue = [...rootIds];
+    rootIds.forEach((id) => levelMap.set(id, 0));
+    for (let index = 0; index < queue.length; index += 1) {
+        const current = queue[index];
+        const level = levelMap.get(current) ?? 0;
+        for (const child of outgoing.get(current) ?? []) {
+            if (!levelMap.has(child)) {
+                levelMap.set(child, level + 1);
+                queue.push(child);
+            }
+        }
+    }
+    return levelMap;
+};
+/**
+ * Assign DAG-style max-depth levels using a single Kahn's BFS pass.
+ * Validates edge references and detects cycles in the same traversal,
+ * replacing the three-pass pattern of assertHierarchicalGraph +
+ * buildGraphTopology + an inline BFS.
+ */
+export const assignDagLevels = (nodes, edges) => {
+    if (!nodes.length) {
+        return { levels: new Map(), outgoing: new Map() };
+    }
+    const nodeSet = new Set(nodes.map((n) => n.id));
+    const inDegree = new Map(nodes.map((n) => [n.id, 0]));
+    const outgoing = new Map();
+    for (const edge of edges) {
+        if (!nodeSet.has(edge.source) || !nodeSet.has(edge.target)) {
+            throw new Error(`DAG layout requires every edge to reference existing nodes. Invalid edge: ${edge.source} -> ${edge.target}.`);
+        }
+        inDegree.set(edge.target, (inDegree.get(edge.target) ?? 0) + 1);
+        const children = outgoing.get(edge.source) ?? [];
+        children.push(edge.target);
+        outgoing.set(edge.source, children);
+    }
+    const levels = new Map();
+    const queue = nodes.filter((n) => inDegree.get(n.id) === 0).map((n) => n.id);
+    if (!queue.length) {
+        throw new Error('DAG layout requires at least one root node and does not support cyclic graphs.');
+    }
+    queue.forEach((id) => levels.set(id, 0));
+    let processed = 0;
+    for (let index = 0; index < queue.length; index += 1) {
+        const current = queue[index];
+        processed += 1;
+        const currentLevel = levels.get(current) ?? 0;
+        for (const child of outgoing.get(current) ?? []) {
+            levels.set(child, Math.max(levels.get(child) ?? 0, currentLevel + 1));
+            const nextInDegree = (inDegree.get(child) ?? 0) - 1;
+            inDegree.set(child, nextInDegree);
+            if (nextInDegree === 0) {
+                queue.push(child);
+            }
+        }
+    }
+    if (processed !== nodes.length) {
+        throw new Error('DAG layout requires an acyclic graph. Cycles were detected in the input graph.');
+    }
+    return { levels, outgoing };
+};
+/**
+ * Group nodes by their level
+ */
+export const groupNodesByLevel = (nodes, levelMap) => {
+    const levels = [];
+    nodes.forEach((n) => {
+        const l = levelMap.get(n.id);
+        if (l == null) {
+            throw new Error(`Tree layout could not assign a level to node "${n.id}". Ensure the graph is connected from at least one root and acyclic.`);
+        }
+        if (!levels[l])
+            levels[l] = [];
+        levels[l].push(n.id);
+    });
+    return levels;
+};
+//# sourceMappingURL=treeTopology.js.map

package/dist/layouts/treeTopology.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"treeTopology.js","sourceRoot":"","sources":["../../src/layouts/treeTopology.ts"],"names":[],"mappings":"AAEA,MAAM,CAAC,MAAM,uBAAuB,GAAG,CAAC,KAAiB,EAAE,KAAiB,EAAQ,EAAE;IACpF,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QAClB,OAAO;IACT,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAC7D,MAAM,IAAI,KAAK,CACb,8EAA8E,IAAI,CAAC,MAAM,OAAO,IAAI,CAAC,MAAM,GAAG,CAC/G,CAAC;QACJ,CAAC;QAED,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IACjF,CAAC;IAED,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;SACzC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,MAAM,KAAK,CAAC,CAAC;SACpC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC;IAE7B,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QAClB,MAAM,IAAI,KAAK,CACb,iFAAiF,CAClF,CAAC;IACJ,CAAC;IAED,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QACrD,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC7B,SAAS,IAAI,CAAC,CAAC;QAEf,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;YAChD,MAAM,UAAU,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YAClD,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;YAChC,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;gBACrB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,SAAS,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;QAC/B,MAAM,IAAI,KAAK,CACb,iFAAiF,CAClF,CAAC;IACJ,CAAC;AACH,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,KAAiB,EAAiB,EAAE;IACrE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE7C,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAClB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1D,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IACxE,CAAC,CAAC,CAAC;IAEH,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;AAChC,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,KAAiB,EAAE,QAA6B,EAAY,EAAE;IAC1F,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACnE,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AAChC,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,CACjC,KAAiB,EACjB,OAAiB,EACjB,QAA+B,EACV,EAAE;IACvB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,KAAK,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC;IAC3B,OAAO,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAE7C,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QACrD,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC7B,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACzC,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;YAChD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACzB,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;gBAC/B,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAC7B,KAAiB,EACjB,KAAiB,EACiD,EAAE;IACpE,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QAClB,OAAO,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC;IACpD,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAiB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACtE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAC3D,MAAM,IAAI,KAAK,CACb,6EAA6E,IAAI,CAAC,MAAM,OAAO,IAAI,CAAC,MAAM,GAAG,CAC9G,CAAC;QACJ,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChE,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QACjD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IACtC,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAE7E,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QAClB,MAAM,IAAI,KAAK,CACb,gFAAgF,CACjF,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACzC,IAAI,SAAS,GAAG,CAAC,CAAC;IAElB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QACrD,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC7B,SAAS,IAAI,CAAC,CAAC;QACf,MAAM,YAAY,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAE9C,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;YAChD,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC;YACtE,MAAM,YAAY,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACpD,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;YAClC,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;gBACvB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,SAAS,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;QAC/B,MAAM,IAAI,KAAK,CACb,gFAAgF,CACjF,CAAC;IACJ,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;AAC9B,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,KAAiB,EAAE,QAA6B,EAAc,EAAE;IAChG,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAClB,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YACd,MAAM,IAAI,KAAK,CACb,iDAAiD,CAAC,CAAC,EAAE,sEAAsE,CAC5H,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;YAAE,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QAC/B,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACvB,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC"}

package/dist/rendering/defaultRenderers.d.ts

@@ -0,0 +1,10 @@
+import type { NodeRenderer, EdgeRenderer } from '@graph-render/types';
+/**
+ * Default node renderer - creates a rounded rectangle with centered text
+ */
+export declare const defaultNodeRenderer: NodeRenderer;
+/**
+ * Default edge renderer - creates an SVG path with optional arrow marker
+ */
+export declare const defaultEdgeRenderer: EdgeRenderer;
+//# sourceMappingURL=defaultRenderers.d.ts.map

package/dist/rendering/defaultRenderers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"defaultRenderers.d.ts","sourceRoot":"","sources":["../../src/rendering/defaultRenderers.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAuEtE;;GAEG;AACH,eAAO,MAAM,mBAAmB,EAAE,YAMjC,CAAC;AAgBF;;GAEG;AACH,eAAO,MAAM,mBAAmB,EAAE,YASjC,CAAC"}

package/dist/rendering/defaultRenderers.js

@@ -0,0 +1,85 @@
+import { EdgeType } from '@graph-render/types';
+import { escapeXml } from './utils';
+import { DEFAULT_NODE_WIDTH, DEFAULT_NODE_HEIGHT, DEFAULT_NODE_RADIUS, DEFAULT_NODE_FILL, DEFAULT_NODE_STROKE, DEFAULT_TEXT_FILL, DEFAULT_TEXT_SIZE, } from '../utils';
+const MAX_RENDER_LABEL_LENGTH = 2000;
+const MAX_RENDER_LABEL_LINES = 8;
+/**
+ * Extract label from node data
+ */
+const getNodeLabel = (node) => {
+    if (typeof node.label === 'string' || typeof node.label === 'number') {
+        return String(node.label);
+    }
+    return node.id;
+};
+const getRenderableLabelLines = (label) => {
+    const truncated = label.slice(0, MAX_RENDER_LABEL_LENGTH);
+    const lines = truncated
+        .split(/\r?\n/)
+        .slice(0, MAX_RENDER_LABEL_LINES)
+        .map((line) => line.trim())
+        .filter((line) => line.length > 0);
+    return lines.length ? lines : [''];
+};
+/**
+ * Get node dimensions
+ */
+const getNodeDimensions = (node) => {
+    return {
+        width: node.size?.width ?? DEFAULT_NODE_WIDTH,
+        height: node.size?.height ?? DEFAULT_NODE_HEIGHT,
+    };
+};
+/**
+ * Create SVG rectangle element for node
+ */
+const createNodeRect = (width, height, radius) => {
+    return `<rect x="0" y="0" width="${width}" height="${height}" rx="${radius}" ry="${radius}" fill="${DEFAULT_NODE_FILL}" stroke="${DEFAULT_NODE_STROKE}" stroke-width="1" />`;
+};
+/**
+ * Create SVG text element for node label
+ */
+const createNodeText = (label, width, height) => {
+    const lines = getRenderableLabelLines(label);
+    const x = width / 2;
+    const lineHeight = DEFAULT_TEXT_SIZE + 4;
+    const firstLineY = height / 2 - ((lines.length - 1) * lineHeight) / 2 + 4;
+    const tspans = lines
+        .map((line, index) => `<tspan x="${x}" y="${firstLineY + index * lineHeight}">${escapeXml(line)}</tspan>`)
+        .join('');
+    return `<text x="${x}" fill="${DEFAULT_TEXT_FILL}" font-size="${DEFAULT_TEXT_SIZE}" font-weight="600" text-anchor="middle">${tspans}</text>`;
+};
+/**
+ * Default node renderer - creates a rounded rectangle with centered text
+ */
+export const defaultNodeRenderer = (node) => {
+    const { width, height } = getNodeDimensions(node);
+    const label = getNodeLabel(node);
+    const rect = createNodeRect(width, height, DEFAULT_NODE_RADIUS);
+    const text = createNodeText(label, width, height);
+    return [rect, text].join('');
+};
+/**
+ * Determine if edge should have an arrow marker
+ */
+const shouldShowArrow = (edgeType) => {
+    return edgeType === EdgeType.Directed;
+};
+/**
+ * Create marker-end attribute for directed edges
+ */
+const createMarkerAttribute = (markerId) => {
+    return ` marker-end="url(#${markerId})"`;
+};
+/**
+ * Default edge renderer - creates an SVG path with optional arrow marker
+ */
+export const defaultEdgeRenderer = (edge, pathD, theme) => {
+    const marker = shouldShowArrow(edge.type) && theme.markerId ? createMarkerAttribute(theme.markerId) : '';
+    const path = `<path d="${pathD}" stroke="${theme.edgeColor}" stroke-width="${theme.edgeWidth}" fill="none"${marker}/>`;
+    const label = edge.label != null && edge.labelPosition
+        ? `<text x="${edge.labelPosition.x}" y="${edge.labelPosition.y - 6}" fill="${theme.edgeLabelColor}" font-size="12" font-weight="600" text-anchor="middle">${escapeXml(String(edge.label))}</text>`
+        : '';
+    return `${path}${label}`;
+};
+//# sourceMappingURL=defaultRenderers.js.map

package/dist/rendering/defaultRenderers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"defaultRenderers.js","sourceRoot":"","sources":["../../src/rendering/defaultRenderers.ts"],"names":[],"mappings":"AAAA,OAAO,EAAkB,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAE/D,OAAO,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AACpC,OAAO,EACL,kBAAkB,EAClB,mBAAmB,EACnB,mBAAmB,EACnB,iBAAiB,EACjB,mBAAmB,EACnB,iBAAiB,EACjB,iBAAiB,GAClB,MAAM,UAAU,CAAC;AAElB,MAAM,uBAAuB,GAAG,IAAK,CAAC;AACtC,MAAM,sBAAsB,GAAG,CAAC,CAAC;AAEjC;;GAEG;AACH,MAAM,YAAY,GAAG,CAAC,IAAoB,EAAU,EAAE;IACpD,IAAI,OAAO,IAAI,CAAC,KAAK,KAAK,QAAQ,IAAI,OAAO,IAAI,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;QACrE,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IACD,OAAO,IAAI,CAAC,EAAE,CAAC;AACjB,CAAC,CAAC;AAEF,MAAM,uBAAuB,GAAG,CAAC,KAAa,EAAY,EAAE;IAC1D,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,uBAAuB,CAAC,CAAC;IAC1D,MAAM,KAAK,GAAG,SAAS;SACpB,KAAK,CAAC,OAAO,CAAC;SACd,KAAK,CAAC,CAAC,EAAE,sBAAsB,CAAC;SAChC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;SAC1B,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAErC,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACrC,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,iBAAiB,GAAG,CAAC,IAAoB,EAAqC,EAAE;IACpF,OAAO;QACL,KAAK,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,IAAI,kBAAkB;QAC7C,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,IAAI,mBAAmB;KACjD,CAAC;AACJ,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,cAAc,GAAG,CAAC,KAAa,EAAE,MAAc,EAAE,MAAc,EAAU,EAAE;IAC/E,OAAO,4BAA4B,KAAK,aAAa,MAAM,SAAS,MAAM,SAAS,MAAM,WAAW,iBAAiB,aAAa,mBAAmB,uBAAuB,CAAC;AAC/K,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,cAAc,GAAG,CAAC,KAAa,EAAE,KAAa,EAAE,MAAc,EAAU,EAAE;IAC9E,MAAM,KAAK,GAAG,uBAAuB,CAAC,KAAK,CAAC,CAAC;IAC7C,MAAM,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;IACpB,MAAM,UAAU,GAAG,iBAAiB,GAAG,CAAC,CAAC;IACzC,MAAM,UAAU,GAAG,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC1E,MAAM,MAAM,GAAG,KAAK;SACjB,GAAG,CACF,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACd,aAAa,CAAC,QAAQ,UAAU,GAAG,KAAK,GAAG,UAAU,KAAK,SAAS,CAAC,IAAI,CAAC,UAAU,CACtF;SACA,IAAI,CAAC,EAAE,CAAC,CAAC;IAEZ,OAAO,YAAY,CAAC,WAAW,iBAAiB,gBAAgB,iBAAiB,4CAA4C,MAAM,SAAS,CAAC;AAC/I,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAiB,CAAC,IAAI,EAAE,EAAE;IACxD,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;IAClD,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IACjC,MAAM,IAAI,GAAG,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,mBAAmB,CAAC,CAAC;IAChE,MAAM,IAAI,GAAG,cAAc,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IAClD,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAC/B,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,eAAe,GAAG,CAAC,QAAmB,EAAW,EAAE;IACvD,OAAO,QAAQ,KAAK,QAAQ,CAAC,QAAQ,CAAC;AACxC,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,qBAAqB,GAAG,CAAC,QAAgB,EAAU,EAAE;IACzD,OAAO,qBAAqB,QAAQ,IAAI,CAAC;AAC3C,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAiB,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE;IACtE,MAAM,MAAM,GACV,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,qBAAqB,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC5F,MAAM,IAAI,GAAG,YAAY,KAAK,aAAa,KAAK,CAAC,SAAS,mBAAmB,KAAK,CAAC,SAAS,gBAAgB,MAAM,IAAI,CAAC;IACvH,MAAM,KAAK,GACT,IAAI,CAAC,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,aAAa;QACtC,CAAC,CAAC,YAAY,IAAI,CAAC,aAAa,CAAC,CAAC,QAAQ,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,WAAW,KAAK,CAAC,cAAc,2DAA2D,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,SAAS;QAClM,CAAC,CAAC,EAAE,CAAC;IACT,OAAO,GAAG,IAAI,GAAG,KAAK,EAAE,CAAC;AAC3B,CAAC,CAAC"}

package/dist/rendering/index.d.ts

@@ -0,0 +1,4 @@
+export { renderGraphToSvg } from './svg';
+export { defaultNodeRenderer, defaultEdgeRenderer } from './defaultRenderers';
+export { escapeXml } from './utils';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/rendering/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,gBAAgB,EAAE,MAAM,OAAO,CAAC;AACzC,OAAO,EAAE,mBAAmB,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AAC9E,OAAO,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC"}

package/dist/rendering/index.js

@@ -0,0 +1,4 @@
+export { renderGraphToSvg } from './svg';
+export { defaultNodeRenderer, defaultEdgeRenderer } from './defaultRenderers';
+export { escapeXml } from './utils';
+//# sourceMappingURL=index.js.map

package/dist/rendering/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/rendering/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,gBAAgB,EAAE,MAAM,OAAO,CAAC;AACzC,OAAO,EAAE,mBAAmB,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AAC9E,OAAO,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC"}

package/dist/rendering/svg.d.ts

@@ -0,0 +1,7 @@
+import { NxGraphInput } from '@graph-render/types';
+import type { RenderGraphToSvgOptions, RenderGraphToSvgResult } from '@graph-render/types';
+/**
+ * Render a graph to SVG format
+ */
+export declare const renderGraphToSvg: (graph: NxGraphInput, options?: RenderGraphToSvgOptions) => RenderGraphToSvgResult;
+//# sourceMappingURL=svg.d.ts.map

package/dist/rendering/svg.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"svg.d.ts","sourceRoot":"","sources":["../../src/rendering/svg.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EASb,MAAM,qBAAqB,CAAC;AAE7B,OAAO,KAAK,EACV,uBAAuB,EACvB,sBAAsB,EAGvB,MAAM,qBAAqB,CAAC;AAkR7B;;GAEG;AACH,eAAO,MAAM,gBAAgB,GAC3B,OAAO,YAAY,EACnB,UAAU,uBAAuB,KAChC,sBAgDF,CAAC"}