@graph-render/core 1.0.1

package/dist/utils/graphParser.js

@@ -0,0 +1,277 @@
+import { EdgeType } from '@graph-render/types';
+const isPlainObject = (value) => {
+    return typeof value === 'object' && value !== null && !Array.isArray(value);
+};
+const isFiniteNumber = (value) => typeof value === 'number' && Number.isFinite(value);
+const sanitizeNodeId = (value, kind) => {
+    const normalized = value.trim();
+    if (!normalized) {
+        throw new TypeError(`Graph ${kind} identifiers must be non-empty strings.`);
+    }
+    return normalized;
+};
+const sanitizePoint = (value) => {
+    if (!isPlainObject(value) || !isFiniteNumber(value.x) || !isFiniteNumber(value.y)) {
+        return undefined;
+    }
+    return { x: value.x, y: value.y };
+};
+const sanitizeSize = (value) => {
+    if (!isPlainObject(value) || !isFiniteNumber(value.width) || !isFiniteNumber(value.height)) {
+        return undefined;
+    }
+    return value.width > 0 && value.height > 0
+        ? { width: value.width, height: value.height }
+        : undefined;
+};
+const sanitizeRecord = (value) => {
+    return isPlainObject(value) ? value : undefined;
+};
+const sanitizeMeasurementHints = (value) => {
+    if (!isPlainObject(value))
+        return undefined;
+    // FIX: was a bare cast `(value as NodeData['measurementHints'])` that let
+    // non-numeric values (e.g., paddingX: "8px") flow into layout arithmetic and
+    // produce NaN node sizes.  Each field is now validated individually.
+    return {
+        label: typeof value.label === 'string' ? value.label : undefined,
+        paddingX: isFiniteNumber(value.paddingX) && value.paddingX >= 0
+            ? value.paddingX
+            : undefined,
+        paddingY: isFiniteNumber(value.paddingY) && value.paddingY >= 0
+            ? value.paddingY
+            : undefined,
+        estimatedCharWidth: isFiniteNumber(value.estimatedCharWidth) && value.estimatedCharWidth > 0
+            ? value.estimatedCharWidth
+            : undefined,
+        lineHeight: isFiniteNumber(value.lineHeight) && value.lineHeight > 0
+            ? value.lineHeight
+            : undefined,
+    };
+};
+const sanitizeNodeData = (id, attrs) => {
+    const position = sanitizePoint(attrs.position);
+    const size = sanitizeSize(attrs.size);
+    const measuredSize = sanitizeSize(attrs.measuredSize);
+    const measurementHints = sanitizeMeasurementHints(attrs.measurementHints);
+    return {
+        id,
+        label: attrs.label,
+        position,
+        size,
+        measuredSize,
+        sizeMode: attrs.sizeMode === 'fixed' || attrs.sizeMode === 'label' || attrs.sizeMode === 'measured'
+            ? attrs.sizeMode
+            : undefined,
+        measurementHints,
+        data: attrs.data,
+        meta: sanitizeRecord(attrs.meta),
+    };
+};
+const sanitizeEdgePoints = (value) => {
+    if (!Array.isArray(value)) {
+        return undefined;
+    }
+    const points = value
+        .map((point) => sanitizePoint(point))
+        .filter((point) => point !== undefined);
+    return points.length >= 2 ? points : undefined;
+};
+const assertUniqueEdgeId = (candidate, usedEdgeIds) => {
+    if (usedEdgeIds.has(candidate)) {
+        throw new TypeError(`Graph edge identifiers must be unique. Duplicate edge id "${candidate}" was provided.`);
+    }
+    usedEdgeIds.add(candidate);
+    return candidate;
+};
+const assertValidGraphInput = (graph) => {
+    if (!isPlainObject(graph)) {
+        throw new TypeError('Graph input must be a plain object.');
+    }
+    if (!isPlainObject(graph.adj)) {
+        throw new TypeError('Graph input must include an adjacency map in `adj`.');
+    }
+    if (graph.nodes != null && !isPlainObject(graph.nodes)) {
+        throw new TypeError('Graph `nodes` must be a record of node attributes when provided.');
+    }
+    for (const [source, neighbors] of Object.entries(graph.adj)) {
+        if (!isPlainObject(neighbors)) {
+            throw new TypeError(`Adjacency entry for node "${source}" must be an object.`);
+        }
+        for (const [target, rawAttrs] of Object.entries(neighbors)) {
+            const attrsList = Array.isArray(rawAttrs) ? rawAttrs : [rawAttrs];
+            if (!attrsList.length) {
+                throw new TypeError(`Adjacency entry for edge "${source}" -> "${target}" must not be an empty array.`);
+            }
+            attrsList.forEach((attrs, index) => {
+                if (attrs != null && !isPlainObject(attrs)) {
+                    throw new TypeError(`Edge attributes for "${source}" -> "${target}" at index ${index} must be an object.`);
+                }
+            });
+        }
+    }
+};
+/**
+ * Build node map from graph node definitions
+ */
+const buildNodeMap = (graph) => {
+    const nodeMap = new Map();
+    if (graph.nodes) {
+        for (const [id, attrs] of Object.entries(graph.nodes)) {
+            if (attrs != null && !isPlainObject(attrs)) {
+                throw new TypeError(`Node attributes for "${id}" must be an object when provided.`);
+            }
+            const sanitizedId = sanitizeNodeId(id, 'node');
+            nodeMap.set(sanitizedId, sanitizeNodeData(sanitizedId, attrs ?? {}));
+        }
+    }
+    return nodeMap;
+};
+const hasExplicitNodeDefinitions = (graph) => {
+    return Boolean(graph.nodes && Object.keys(graph.nodes).length > 0);
+};
+/**
+ * Ensure a node exists in the map, creating it if necessary
+ */
+const ensureNodeExists = (nodeMap, nodeId) => {
+    const sanitizedNodeId = sanitizeNodeId(nodeId, 'edge-endpoint');
+    if (!nodeMap.has(sanitizedNodeId)) {
+        nodeMap.set(sanitizedNodeId, { id: sanitizedNodeId });
+    }
+};
+const assertNodeExists = (nodeMap, nodeId, graph, kind) => {
+    const sanitizedNodeId = sanitizeNodeId(nodeId, 'edge-endpoint');
+    if (!hasExplicitNodeDefinitions(graph)) {
+        ensureNodeExists(nodeMap, sanitizedNodeId);
+        return;
+    }
+    if (!nodeMap.has(sanitizedNodeId)) {
+        throw new TypeError(`Graph edge ${kind} "${sanitizedNodeId}" must exist in graph.nodes when explicit node definitions are provided.`);
+    }
+};
+/**
+ * Normalize edge attributes to array format
+ */
+const normalizeEdgeAttributes = (rawAttrs) => {
+    return Array.isArray(rawAttrs) ? rawAttrs : [rawAttrs];
+};
+/**
+ * Generate unique key for undirected edge deduplication
+ */
+const createUndirectedEdgeKey = (source, target, index) => {
+    return `${[source, target].sort().join('|')}|${index}`;
+};
+/**
+ * Generate default edge ID
+ */
+const generateEdgeId = (source, target, index) => {
+    return `${source}-${target}-${index}`;
+};
+/**
+ * Check if undirected edge was already processed
+ */
+const isUndirectedEdgeSeen = (edgeType, source, target, index, seenSet) => {
+    if (edgeType !== EdgeType.Undirected)
+        return false;
+    const key = createUndirectedEdgeKey(source, target, index);
+    if (seenSet.has(key))
+        return true;
+    seenSet.add(key);
+    return false;
+};
+/**
+ * Create edge data object from attributes
+ */
+const createEdgeData = (source, target, index, attrs, defaultEdgeType, usedEdgeIds) => {
+    const { id, type, points, meta, ...rest } = attrs ?? {};
+    const edgeType = type ?? defaultEdgeType;
+    const baseId = sanitizeNodeId(String(id ?? generateEdgeId(source, target, index)), 'node');
+    return {
+        id: assertUniqueEdgeId(baseId, usedEdgeIds),
+        source,
+        target,
+        type: edgeType === EdgeType.Directed || edgeType === EdgeType.Undirected
+            ? edgeType
+            : defaultEdgeType,
+        points: sanitizeEdgePoints(points),
+        meta: sanitizeRecord(meta),
+        ...rest,
+    };
+};
+const createTypedEdgeData = (source, target, index, attrs, defaultEdgeType, usedEdgeIds) => {
+    const edgeData = createEdgeData(source, target, index, attrs, defaultEdgeType, usedEdgeIds);
+    return edgeData;
+};
+/**
+ * Process edges from adjacency list for a source node
+ */
+const processNodeEdges = (source, neighbors, defaultEdgeType, graph, nodeMap, undirectedSeen, usedEdgeIds) => {
+    const edges = [];
+    for (const [target, rawAttrs] of Object.entries(neighbors)) {
+        const sanitizedTarget = sanitizeNodeId(target, 'edge-endpoint');
+        assertNodeExists(nodeMap, sanitizedTarget, graph, 'target');
+        const attrsList = normalizeEdgeAttributes(rawAttrs);
+        attrsList.forEach((attrs, idx) => {
+            const edgeData = createEdgeData(source, sanitizedTarget, idx, attrs, defaultEdgeType, usedEdgeIds);
+            // Skip if undirected edge already seen from other direction
+            if (!isUndirectedEdgeSeen(edgeData.type, source, sanitizedTarget, idx, undirectedSeen)) {
+                edges.push(edgeData);
+            }
+        });
+    }
+    return edges;
+};
+const processTypedNodeEdges = (source, neighbors, defaultEdgeType, graph, nodeMap, undirectedSeen, usedEdgeIds) => {
+    const edges = [];
+    for (const [target, rawAttrs] of Object.entries(neighbors)) {
+        const sanitizedTarget = sanitizeNodeId(target, 'edge-endpoint');
+        assertNodeExists(nodeMap, sanitizedTarget, graph, 'target');
+        const attrsList = normalizeEdgeAttributes(rawAttrs);
+        attrsList.forEach((attrs, idx) => {
+            const edgeData = createTypedEdgeData(source, sanitizedTarget, idx, attrs, defaultEdgeType, usedEdgeIds);
+            // Skip if undirected edge already seen from other direction
+            if (!isUndirectedEdgeSeen(edgeData.type, source, sanitizedTarget, idx, undirectedSeen)) {
+                edges.push(edgeData);
+            }
+        });
+    }
+    return edges;
+};
+/**
+ * Parse NetworkX-style graph input to internal format
+ */
+export const fromNxGraph = (graph, defaultEdgeType = EdgeType.Undirected) => {
+    assertValidGraphInput(graph);
+    const nodeMap = buildNodeMap(graph);
+    const undirectedSeen = new Set();
+    const usedEdgeIds = new Set();
+    const edges = [];
+    for (const [source, neighbors] of Object.entries(graph.adj)) {
+        const sanitizedSource = sanitizeNodeId(source, 'edge-endpoint');
+        assertNodeExists(nodeMap, sanitizedSource, graph, 'source');
+        const nodeEdges = processNodeEdges(sanitizedSource, neighbors, defaultEdgeType, graph, nodeMap, undirectedSeen, usedEdgeIds);
+        edges.push(...nodeEdges);
+    }
+    return {
+        nodes: Array.from(nodeMap.values()),
+        edges,
+    };
+};
+export const fromTypedNxGraph = (graph, defaultEdgeType = EdgeType.Undirected) => {
+    assertValidGraphInput(graph);
+    const nodeMap = buildNodeMap(graph);
+    const undirectedSeen = new Set();
+    const usedEdgeIds = new Set();
+    const edges = [];
+    for (const [source, neighbors] of Object.entries(graph.adj)) {
+        const sanitizedSource = sanitizeNodeId(source, 'edge-endpoint');
+        assertNodeExists(nodeMap, sanitizedSource, graph, 'source');
+        const nodeEdges = processTypedNodeEdges(sanitizedSource, neighbors, defaultEdgeType, graph, nodeMap, undirectedSeen, usedEdgeIds);
+        edges.push(...nodeEdges);
+    }
+    return {
+        nodes: Array.from(nodeMap.values()),
+        edges,
+    };
+};
+//# sourceMappingURL=graphParser.js.map

package/dist/utils/graphParser.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graphParser.js","sourceRoot":"","sources":["../../src/utils/graphParser.ts"],"names":[],"mappings":"AAAA,OAAO,EAAiD,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAa9F,MAAM,aAAa,GAAG,CAAC,KAAc,EAAoC,EAAE;IACzE,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAC9E,CAAC,CAAC;AAEF,MAAM,cAAc,GAAG,CAAC,KAAc,EAAmB,EAAE,CACzD,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AAEtD,MAAM,cAAc,GAAG,CAAC,KAAa,EAAE,IAA8B,EAAU,EAAE;IAC/E,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IAChC,IAAI,CAAC,UAAU,EAAE,CAAC;QAChB,MAAM,IAAI,SAAS,CAAC,SAAS,IAAI,yCAAyC,CAAC,CAAC;IAC9E,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC,CAAC;AAEF,MAAM,aAAa,GAAG,CAAC,KAAc,EAAwC,EAAE;IAC7E,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;QAClF,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,OAAO,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC;AACpC,CAAC,CAAC;AAEF,MAAM,YAAY,GAAG,CAAC,KAAc,EAAiD,EAAE;IACrF,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;QAC3F,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,OAAO,KAAK,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;QACxC,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE;QAC9C,CAAC,CAAC,SAAS,CAAC;AAChB,CAAC,CAAC;AAEF,MAAM,cAAc,GAAG,CAAoC,KAAc,EAAiB,EAAE;IAC1F,OAAO,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAE,KAAW,CAAC,CAAC,CAAC,SAAS,CAAC;AACzD,CAAC,CAAC;AAEF,MAAM,wBAAwB,GAAG,CAAC,KAAc,EAA4C,EAAE;IAC5F,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAC5C,0EAA0E;IAC1E,6EAA6E;IAC7E,qEAAqE;IACrE,OAAO;QACL,KAAK,EAAE,OAAO,KAAK,CAAC,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS;QAChE,QAAQ,EACN,cAAc,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAK,KAAK,CAAC,QAAmB,IAAI,CAAC;YAC/D,CAAC,CAAE,KAAK,CAAC,QAAmB;YAC5B,CAAC,CAAC,SAAS;QACf,QAAQ,EACN,cAAc,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAK,KAAK,CAAC,QAAmB,IAAI,CAAC;YAC/D,CAAC,CAAE,KAAK,CAAC,QAAmB;YAC5B,CAAC,CAAC,SAAS;QACf,kBAAkB,EAChB,cAAc,CAAC,KAAK,CAAC,kBAAkB,CAAC,IAAK,KAAK,CAAC,kBAA6B,GAAG,CAAC;YAClF,CAAC,CAAE,KAAK,CAAC,kBAA6B;YACtC,CAAC,CAAC,SAAS;QACf,UAAU,EACR,cAAc,CAAC,KAAK,CAAC,UAAU,CAAC,IAAK,KAAK,CAAC,UAAqB,GAAG,CAAC;YAClE,CAAC,CAAE,KAAK,CAAC,UAAqB;YAC9B,CAAC,CAAC,SAAS;KAChB,CAAC;AACJ,CAAC,CAAC;AAEF,MAAM,gBAAgB,GAAG,CACvB,EAAU,EACV,KAA8B,EACoB,EAAE;IACpD,MAAM,QAAQ,GAAG,aAAa,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IAC/C,MAAM,IAAI,GAAG,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACtC,MAAM,YAAY,GAAG,YAAY,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;IACtD,MAAM,gBAAgB,GAAG,wBAAwB,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC;IAE1E,OAAO;QACL,EAAE;QACF,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,QAAQ;QACR,IAAI;QACJ,YAAY;QACZ,QAAQ,EACN,KAAK,CAAC,QAAQ,KAAK,OAAO,IAAI,KAAK,CAAC,QAAQ,KAAK,OAAO,IAAI,KAAK,CAAC,QAAQ,KAAK,UAAU;YACvF,CAAC,CAAC,KAAK,CAAC,QAAQ;YAChB,CAAC,CAAC,SAAS;QACf,gBAAgB;QAChB,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,IAAI,EAAE,cAAc,CAAY,KAAK,CAAC,IAAI,CAAC;KACQ,CAAC;AACxD,CAAC,CAAC;AAEF,MAAM,kBAAkB,GAAG,CAAC,KAAc,EAAkC,EAAE;IAC5E,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,MAAM,MAAM,GAAG,KAAK;SACjB,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;SACpC,MAAM,CAAC,CAAC,KAAK,EAAoD,EAAE,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC;IAC5F,OAAO,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;AACjD,CAAC,CAAC;AAEF,MAAM,kBAAkB,GAAG,CAAC,SAAiB,EAAE,WAAwB,EAAU,EAAE;IACjF,IAAI,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;QAC/B,MAAM,IAAI,SAAS,CACjB,6DAA6D,SAAS,iBAAiB,CACxF,CAAC;IACJ,CAAC;IAED,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAC3B,OAAO,SAAS,CAAC;AACnB,CAAC,CAAC;AAEF,MAAM,qBAAqB,GAAG,CAAC,KAAmB,EAAQ,EAAE;IAC1D,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,MAAM,IAAI,SAAS,CAAC,qCAAqC,CAAC,CAAC;IAC7D,CAAC;IAED,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;QAC9B,MAAM,IAAI,SAAS,CAAC,qDAAqD,CAAC,CAAC;IAC7E,CAAC;IAED,IAAI,KAAK,CAAC,KAAK,IAAI,IAAI,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;QACvD,MAAM,IAAI,SAAS,CAAC,kEAAkE,CAAC,CAAC;IAC1F,CAAC;IAED,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;QAC5D,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,EAAE,CAAC;YAC9B,MAAM,IAAI,SAAS,CAAC,6BAA6B,MAAM,sBAAsB,CAAC,CAAC;QACjF,CAAC;QAED,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;YAC3D,MAAM,SAAS,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YAClE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;gBACtB,MAAM,IAAI,SAAS,CACjB,6BAA6B,MAAM,SAAS,MAAM,+BAA+B,CAClF,CAAC;YACJ,CAAC;YAED,SAAS,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;gBACjC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC3C,MAAM,IAAI,SAAS,CACjB,wBAAwB,MAAM,SAAS,MAAM,cAAc,KAAK,qBAAqB,CACtF,CAAC;gBACJ,CAAC;YACH,CAAC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;AACH,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,YAAY,GAAG,CAOnB,KAA4E,EACb,EAAE;IACjE,MAAM,OAAO,GAAG,IAAI,GAAG,EAA4D,CAAC;IAEpF,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAChB,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;YACtD,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3C,MAAM,IAAI,SAAS,CAAC,wBAAwB,EAAE,oCAAoC,CAAC,CAAC;YACtF,CAAC;YAED,MAAM,WAAW,GAAG,cAAc,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;YAC/C,OAAO,CAAC,GAAG,CACT,WAAW,EACX,gBAAgB,CAAmC,WAAW,EAAE,KAAK,IAAI,EAAE,CAAC,CAC7E,CAAC;QACJ,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC,CAAC;AAEF,MAAM,0BAA0B,GAAG,CAAC,KAAmB,EAAW,EAAE;IAClE,OAAO,OAAO,CAAC,KAAK,CAAC,KAAK,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACrE,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,gBAAgB,GAAG,CACvB,OAAgE,EAChE,MAAc,EACR,EAAE;IACR,MAAM,eAAe,GAAG,cAAc,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;IAChE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,EAAE,CAAC;QAClC,OAAO,CAAC,GAAG,CAAC,eAAe,EAAE,EAAE,EAAE,EAAE,eAAe,EAIjD,CAAC,CAAC;IACL,CAAC;AACH,CAAC,CAAC;AAEF,MAAM,gBAAgB,GAAG,CACvB,OAAgE,EAChE,MAAc,EACd,KAAmB,EACnB,IAAyB,EACnB,EAAE;IACR,MAAM,eAAe,GAAG,cAAc,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;IAEhE,IAAI,CAAC,0BAA0B,CAAC,KAAK,CAAC,EAAE,CAAC;QACvC,gBAAgB,CAAC,OAAO,EAAE,eAAe,CAAC,CAAC;QAC3C,OAAO;IACT,CAAC;IAED,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,SAAS,CACjB,cAAc,IAAI,KAAK,eAAe,0EAA0E,CACjH,CAAC;IACJ,CAAC;AACH,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,uBAAuB,GAAG,CAC9B,QAAmF,EAC7C,EAAE;IACxC,OAAO,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;AACzD,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,uBAAuB,GAAG,CAAC,MAAc,EAAE,MAAc,EAAE,KAAa,EAAU,EAAE;IACxF,OAAO,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC;AACzD,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,cAAc,GAAG,CAAC,MAAc,EAAE,MAAc,EAAE,KAAa,EAAU,EAAE;IAC/E,OAAO,GAAG,MAAM,IAAI,MAAM,IAAI,KAAK,EAAE,CAAC;AACxC,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,oBAAoB,GAAG,CAC3B,QAAkB,EAClB,MAAc,EACd,MAAc,EACd,KAAa,EACb,OAAoB,EACX,EAAE;IACX,IAAI,QAAQ,KAAK,QAAQ,CAAC,UAAU;QAAE,OAAO,KAAK,CAAC;IAEnD,MAAM,GAAG,GAAG,uBAAuB,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IAC3D,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAElC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACjB,OAAO,KAAK,CAAC;AACf,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,cAAc,GAAG,CACrB,MAAc,EACd,MAAc,EACd,KAAa,EACb,KAA8B,EAC9B,eAAyB,EACzB,WAAwB,EACd,EAAE;IACZ,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE,GAAG,KAAK,IAAI,EAAE,CAAC;IACxD,MAAM,QAAQ,GAAI,IAA6B,IAAI,eAAe,CAAC;IACnE,MAAM,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC,EAAE,IAAI,cAAc,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAE3F,OAAO;QACL,EAAE,EAAE,kBAAkB,CAAC,MAAM,EAAE,WAAW,CAAC;QAC3C,MAAM;QACN,MAAM;QACN,IAAI,EACF,QAAQ,KAAK,QAAQ,CAAC,QAAQ,IAAI,QAAQ,KAAK,QAAQ,CAAC,UAAU;YAChE,CAAC,CAAC,QAAQ;YACV,CAAC,CAAC,eAAe;QACrB,MAAM,EAAE,kBAAkB,CAAC,MAAM,CAAC;QAClC,IAAI,EAAE,cAAc,CAAgC,IAAI,CAAC;QACzD,GAAG,IAAI;KACR,CAAC;AACJ,CAAC,CAAC;AAEF,MAAM,mBAAmB,GAAG,CAC1B,MAAc,EACd,MAAc,EACd,KAAa,EACb,KAAqD,EACrD,eAAyB,EACzB,WAAwB,EACe,EAAE;IACzC,MAAM,QAAQ,GAAG,cAAc,CAC7B,MAAM,EACN,MAAM,EACN,KAAK,EACL,KAAgC,EAChC,eAAe,EACf,WAAW,CACZ,CAAC;IAEF,OAAO,QAAiD,CAAC;AAC3D,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,gBAAgB,GAAG,CACvB,MAAc,EACd,SAAsD,EACtD,eAA0C,EAC1C,KAAmB,EACnB,OAA8B,EAC9B,cAA2B,EAC3B,WAAwB,EACZ,EAAE;IACd,MAAM,KAAK,GAAe,EAAE,CAAC;IAE7B,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;QAC3D,MAAM,eAAe,GAAG,cAAc,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;QAChE,gBAAgB,CAAC,OAAO,EAAE,eAAe,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QAE5D,MAAM,SAAS,GAAG,uBAAuB,CAAC,QAAQ,CAAC,CAAC;QAEpD,SAAS,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;YAC/B,MAAM,QAAQ,GAAG,cAAc,CAC7B,MAAM,EACN,eAAe,EACf,GAAG,EACH,KAAK,EACL,eAA2B,EAC3B,WAAW,CACZ,CAAC;YAEF,4DAA4D;YAC5D,IAAI,CAAC,oBAAoB,CAAC,QAAQ,CAAC,IAAK,EAAE,MAAM,EAAE,eAAe,EAAE,GAAG,EAAE,cAAc,CAAC,EAAE,CAAC;gBACxF,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACvB,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC,CAAC;AAEF,MAAM,qBAAqB,GAAG,CAO5B,MAAc,EACd,SAGC,EACD,eAA0C,EAC1C,KAA4E,EAC5E,OAAsE,EACtE,cAA2B,EAC3B,WAAwB,EACiB,EAAE;IAC3C,MAAM,KAAK,GAA4C,EAAE,CAAC;IAE1D,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;QAC3D,MAAM,eAAe,GAAG,cAAc,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;QAChE,gBAAgB,CAAC,OAAO,EAAE,eAAe,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QAE5D,MAAM,SAAS,GAAG,uBAAuB,CAAwB,QAAQ,CAAC,CAAC;QAE3E,SAAS,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;YAC/B,MAAM,QAAQ,GAAG,mBAAmB,CAClC,MAAM,EACN,eAAe,EACf,GAAG,EACH,KAAK,EACL,eAA2B,EAC3B,WAAW,CACZ,CAAC;YAEF,4DAA4D;YAC5D,IAAI,CAAC,oBAAoB,CAAC,QAAQ,CAAC,IAAK,EAAE,MAAM,EAAE,eAAe,EAAE,GAAG,EAAE,cAAc,CAAC,EAAE,CAAC;gBACxF,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACvB,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,CACzB,KAAmB,EACnB,kBAA4B,QAAQ,CAAC,UAAU,EACL,EAAE;IAC5C,qBAAqB,CAAC,KAAK,CAAC,CAAC;IAE7B,MAAM,OAAO,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;IACpC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;IACzC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,MAAM,KAAK,GAAe,EAAE,CAAC;IAE7B,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;QAC5D,MAAM,eAAe,GAAG,cAAc,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;QAChE,gBAAgB,CAAC,OAAO,EAAE,eAAe,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QAE5D,MAAM,SAAS,GAAG,gBAAgB,CAChC,eAAe,EACf,SAAS,EACT,eAAe,EACf,KAAK,EACL,OAAO,EACP,cAAc,EACd,WAAW,CACZ,CAAC;QAEF,KAAK,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;IAC3B,CAAC;IAED,OAAO;QACL,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;QACnC,KAAK;KACN,CAAC;AACJ,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAO9B,KAA4E,EAC5E,kBAA4B,QAAQ,CAAC,UAAU,EAI/C,EAAE;IACF,qBAAqB,CAAC,KAAqB,CAAC,CAAC;IAE7C,MAAM,OAAO,GAAG,YAAY,CAA0D,KAAK,CAAC,CAAC;IAC7F,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;IACzC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,MAAM,KAAK,GAA4C,EAAE,CAAC;IAE1D,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;QAC5D,MAAM,eAAe,GAAG,cAAc,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;QAChE,gBAAgB,CAAC,OAAO,EAAE,eAAe,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QAE5D,MAAM,SAAS,GAAG,qBAAqB,CAOrC,eAAe,EACf,SAAS,EACT,eAAe,EACf,KAAK,EACL,OAAO,EACP,cAAc,EACd,WAAW,CACZ,CAAC;QAEF,KAAK,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;IAC3B,CAAC;IAED,OAAO;QACL,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;QACnC,KAAK;KACN,CAAC;AACJ,CAAC,CAAC"}

package/dist/utils/graphTraversal.d.ts

@@ -0,0 +1,13 @@
+import { PositionedEdge } from '@graph-render/types';
+/**
+ * Group edges by their target node
+ */
+export declare const groupEdgesByTarget: (edges: PositionedEdge[]) => Map<string, PositionedEdge[]>;
+/**
+ * Sort edges by their source node position (y first, then x)
+ */
+export declare const sortEdgesBySourcePosition: (edges: PositionedEdge[], nodePositions: Map<string, {
+    x: number;
+    y: number;
+}>) => PositionedEdge[];
+//# sourceMappingURL=graphTraversal.d.ts.map

package/dist/utils/graphTraversal.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graphTraversal.d.ts","sourceRoot":"","sources":["../../src/utils/graphTraversal.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAErD;;GAEG;AACH,eAAO,MAAM,kBAAkB,GAAI,OAAO,cAAc,EAAE,KAAG,GAAG,CAAC,MAAM,EAAE,cAAc,EAAE,CAQxF,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,yBAAyB,GACpC,OAAO,cAAc,EAAE,EACvB,eAAe,GAAG,CAAC,MAAM,EAAE;IAAE,CAAC,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC,KACnD,cAAc,EAUhB,CAAC"}

package/dist/utils/graphTraversal.js

@@ -0,0 +1,28 @@
+/**
+ * Group edges by their target node
+ */
+export const groupEdgesByTarget = (edges) => {
+    const map = new Map();
+    edges.forEach((edge) => {
+        const arr = map.get(edge.target) ?? [];
+        arr.push(edge);
+        map.set(edge.target, arr);
+    });
+    return map;
+};
+/**
+ * Sort edges by their source node position (y first, then x)
+ */
+export const sortEdgesBySourcePosition = (edges, nodePositions) => {
+    return [...edges].sort((a, b) => {
+        const pa = nodePositions.get(a.source);
+        const pb = nodePositions.get(b.source);
+        if (pa && pb) {
+            if (pa.y !== pb.y)
+                return pa.y - pb.y;
+            return pa.x - pb.x;
+        }
+        return 0;
+    });
+};
+//# sourceMappingURL=graphTraversal.js.map

package/dist/utils/graphTraversal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graphTraversal.js","sourceRoot":"","sources":["../../src/utils/graphTraversal.ts"],"names":[],"mappings":"AAEA;;GAEG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,KAAuB,EAAiC,EAAE;IAC3F,MAAM,GAAG,GAAG,IAAI,GAAG,EAA4B,CAAC;IAChD,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;QACrB,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QACvC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACf,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IACH,OAAO,GAAG,CAAC;AACb,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAG,CACvC,KAAuB,EACvB,aAAoD,EAClC,EAAE;IACpB,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC9B,MAAM,EAAE,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QACvC,MAAM,EAAE,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QACvC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC;YACb,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;gBAAE,OAAO,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACtC,OAAO,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC,CAAC,CAAC;AACL,CAAC,CAAC"}

package/dist/utils/index.d.ts

@@ -0,0 +1,8 @@
+export { fromNxGraph, fromTypedNxGraph } from './graphParser';
+export { DEFAULT_THEME, DEFAULT_NODE_SIZE, DEFAULT_NODE_GAP, DEFAULT_PADDING, DEFAULT_NODE_WIDTH, DEFAULT_NODE_HEIGHT, DEFAULT_NODE_RADIUS, DEFAULT_NODE_FILL, DEFAULT_NODE_STROKE, DEFAULT_TEXT_FILL, DEFAULT_TEXT_SIZE, } from './constants';
+export { groupEdgesByTarget, sortEdgesBySourcePosition } from './graphTraversal';
+export { applyNodeSizing } from './nodeSizing';
+export { getMaxNodeDimensions, getMaxNodeHeight, getMaxNodeWidth } from './nodeMetrics';
+export { normalizeGraphConfig } from './config';
+export type { NormalizedGraphConfig } from './config';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/utils/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAC;AAC9D,OAAO,EACL,aAAa,EACb,iBAAiB,EACjB,gBAAgB,EAChB,eAAe,EACf,kBAAkB,EAClB,mBAAmB,EACnB,mBAAmB,EACnB,iBAAiB,EACjB,mBAAmB,EACnB,iBAAiB,EACjB,iBAAiB,GAClB,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,kBAAkB,EAAE,yBAAyB,EAAE,MAAM,kBAAkB,CAAC;AACjF,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAC/C,OAAO,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AACxF,OAAO,EAAE,oBAAoB,EAAE,MAAM,UAAU,CAAC;AAChD,YAAY,EAAE,qBAAqB,EAAE,MAAM,UAAU,CAAC"}

package/dist/utils/index.js

@@ -0,0 +1,7 @@
+export { fromNxGraph, fromTypedNxGraph } from './graphParser';
+export { DEFAULT_THEME, DEFAULT_NODE_SIZE, DEFAULT_NODE_GAP, DEFAULT_PADDING, DEFAULT_NODE_WIDTH, DEFAULT_NODE_HEIGHT, DEFAULT_NODE_RADIUS, DEFAULT_NODE_FILL, DEFAULT_NODE_STROKE, DEFAULT_TEXT_FILL, DEFAULT_TEXT_SIZE, } from './constants';
+export { groupEdgesByTarget, sortEdgesBySourcePosition } from './graphTraversal';
+export { applyNodeSizing } from './nodeSizing';
+export { getMaxNodeDimensions, getMaxNodeHeight, getMaxNodeWidth } from './nodeMetrics';
+export { normalizeGraphConfig } from './config';
+//# sourceMappingURL=index.js.map

package/dist/utils/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/utils/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAC;AAC9D,OAAO,EACL,aAAa,EACb,iBAAiB,EACjB,gBAAgB,EAChB,eAAe,EACf,kBAAkB,EAClB,mBAAmB,EACnB,mBAAmB,EACnB,iBAAiB,EACjB,mBAAmB,EACnB,iBAAiB,EACjB,iBAAiB,GAClB,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,kBAAkB,EAAE,yBAAyB,EAAE,MAAM,kBAAkB,CAAC;AACjF,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAC/C,OAAO,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AACxF,OAAO,EAAE,oBAAoB,EAAE,MAAM,UAAU,CAAC"}

package/dist/utils/nodeMetrics.d.ts

@@ -0,0 +1,8 @@
+import { NodeData } from '@graph-render/types';
+export declare const getMaxNodeWidth: (nodes: NodeData[]) => number;
+export declare const getMaxNodeHeight: (nodes: NodeData[]) => number;
+export declare const getMaxNodeDimensions: (nodes: NodeData[]) => {
+    maxWidth: number;
+    maxHeight: number;
+};
+//# sourceMappingURL=nodeMetrics.d.ts.map

package/dist/utils/nodeMetrics.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"nodeMetrics.d.ts","sourceRoot":"","sources":["../../src/utils/nodeMetrics.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAG/C,eAAO,MAAM,eAAe,GAAI,OAAO,QAAQ,EAAE,KAAG,MAKnD,CAAC;AAEF,eAAO,MAAM,gBAAgB,GAAI,OAAO,QAAQ,EAAE,KAAG,MAKpD,CAAC;AAEF,eAAO,MAAM,oBAAoB,GAC/B,OAAO,QAAQ,EAAE,KAChB;IAAE,QAAQ,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAGtC,CAAC"}

package/dist/utils/nodeMetrics.js

@@ -0,0 +1,12 @@
+import { DEFAULT_NODE_SIZE } from './constants';
+export const getMaxNodeWidth = (nodes) => {
+    return nodes.reduce((max, node) => Math.max(max, node.size?.width ?? DEFAULT_NODE_SIZE.width), 0);
+};
+export const getMaxNodeHeight = (nodes) => {
+    return nodes.reduce((max, node) => Math.max(max, node.size?.height ?? DEFAULT_NODE_SIZE.height), 0);
+};
+export const getMaxNodeDimensions = (nodes) => ({
+    maxWidth: getMaxNodeWidth(nodes),
+    maxHeight: getMaxNodeHeight(nodes),
+});
+//# sourceMappingURL=nodeMetrics.js.map

package/dist/utils/nodeMetrics.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nodeMetrics.js","sourceRoot":"","sources":["../../src/utils/nodeMetrics.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAEhD,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,KAAiB,EAAU,EAAE;IAC3D,OAAO,KAAK,CAAC,MAAM,CACjB,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,IAAI,iBAAiB,CAAC,KAAK,CAAC,EACzE,CAAC,CACF,CAAC;AACJ,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,KAAiB,EAAU,EAAE;IAC5D,OAAO,KAAK,CAAC,MAAM,CACjB,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,IAAI,iBAAiB,CAAC,MAAM,CAAC,EAC3E,CAAC,CACF,CAAC;AACJ,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAClC,KAAiB,EACwB,EAAE,CAAC,CAAC;IAC7C,QAAQ,EAAE,eAAe,CAAC,KAAK,CAAC;IAChC,SAAS,EAAE,gBAAgB,CAAC,KAAK,CAAC;CACnC,CAAC,CAAC"}

package/dist/utils/nodeSizing.d.ts

@@ -0,0 +1,3 @@
+import { LayoutOptions, NodeData } from '@graph-render/types';
+export declare const applyNodeSizing: (nodes: NodeData[], options: LayoutOptions) => NodeData[];
+//# sourceMappingURL=nodeSizing.d.ts.map

package/dist/utils/nodeSizing.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"nodeSizing.d.ts","sourceRoot":"","sources":["../../src/utils/nodeSizing.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,QAAQ,EAAQ,MAAM,qBAAqB,CAAC;AA2FpE,eAAO,MAAM,eAAe,GAAI,OAAO,QAAQ,EAAE,EAAE,SAAS,aAAa,KAAG,QAAQ,EAKnF,CAAC"}

package/dist/utils/nodeSizing.js

@@ -0,0 +1,77 @@
+import { DEFAULT_NODE_SIZE } from './constants';
+const DEFAULT_PADDING_X = 18;
+const DEFAULT_PADDING_Y = 12;
+const DEFAULT_CHAR_WIDTH = 8;
+const DEFAULT_LINE_HEIGHT = 18;
+const MAX_MEASUREMENT_TEXT_LENGTH = 4000;
+const MAX_MEASUREMENT_LINES = 200;
+const MAX_MEASUREMENT_CHARS_PER_LINE = 400;
+const clampSize = (value, fallback) => ({
+    width: Number.isFinite(value.width) && value.width > 0 ? value.width : fallback.width,
+    height: Number.isFinite(value.height) && value.height > 0 ? value.height : fallback.height,
+});
+const getNodeLabel = (node) => {
+    if (typeof node.measurementHints?.label === 'string') {
+        return node.measurementHints.label;
+    }
+    if (typeof node.label === 'string' || typeof node.label === 'number') {
+        return String(node.label);
+    }
+    return node.id;
+};
+const getMeasuredLines = (label) => {
+    const truncatedLabel = label.slice(0, MAX_MEASUREMENT_TEXT_LENGTH);
+    const rawLines = truncatedLabel.split(/\r?\n/);
+    const measuredLines = [];
+    for (let index = 0; index < rawLines.length && measuredLines.length < MAX_MEASUREMENT_LINES; index += 1) {
+        const codePoints = Array.from(rawLines[index]);
+        if (!codePoints.length) {
+            continue;
+        }
+        measuredLines.push(codePoints.slice(0, MAX_MEASUREMENT_CHARS_PER_LINE).join(''));
+    }
+    return measuredLines.length ? measuredLines : [''];
+};
+const estimateLabelSize = (node, options) => {
+    const label = getNodeLabel(node);
+    const lines = getMeasuredLines(label);
+    const paddingX = node.measurementHints?.paddingX ?? options.labelMeasurementPaddingX ?? DEFAULT_PADDING_X;
+    const paddingY = node.measurementHints?.paddingY ?? options.labelMeasurementPaddingY ?? DEFAULT_PADDING_Y;
+    const charWidth = node.measurementHints?.estimatedCharWidth ??
+        options.labelMeasurementCharWidth ??
+        DEFAULT_CHAR_WIDTH;
+    const lineHeight = node.measurementHints?.lineHeight ?? options.labelMeasurementLineHeight ?? DEFAULT_LINE_HEIGHT;
+    let maxChars = 1;
+    for (const line of lines) {
+        const lineLength = Array.from(line).length;
+        if (lineLength > maxChars) {
+            maxChars = lineLength;
+        }
+    }
+    const lineCount = Math.max(1, lines.length);
+    return {
+        width: Math.max(DEFAULT_NODE_SIZE.width, Math.ceil(maxChars * charWidth + paddingX * 2)),
+        height: Math.max(DEFAULT_NODE_SIZE.height, Math.ceil(lineCount * lineHeight + paddingY * 2)),
+    };
+};
+const getResolvedSize = (node, options) => {
+    const mode = node.sizeMode ?? options.nodeSizing ?? 'fixed';
+    const fixedSize = options.fixedNodeSize ?? DEFAULT_NODE_SIZE;
+    const explicitSize = node.size ? clampSize(node.size, fixedSize) : null;
+    const measuredSize = node.measuredSize ? clampSize(node.measuredSize, fixedSize) : null;
+    const estimatedSize = estimateLabelSize(node, options);
+    if (mode === 'measured') {
+        return measuredSize ?? explicitSize ?? estimatedSize;
+    }
+    if (mode === 'label') {
+        return explicitSize ?? estimatedSize;
+    }
+    return explicitSize ?? fixedSize;
+};
+export const applyNodeSizing = (nodes, options) => {
+    return nodes.map((node) => ({
+        ...node,
+        size: getResolvedSize(node, options),
+    }));
+};
+//# sourceMappingURL=nodeSizing.js.map

package/dist/utils/nodeSizing.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nodeSizing.js","sourceRoot":"","sources":["../../src/utils/nodeSizing.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAEhD,MAAM,iBAAiB,GAAG,EAAE,CAAC;AAC7B,MAAM,iBAAiB,GAAG,EAAE,CAAC;AAC7B,MAAM,kBAAkB,GAAG,CAAC,CAAC;AAC7B,MAAM,mBAAmB,GAAG,EAAE,CAAC;AAC/B,MAAM,2BAA2B,GAAG,IAAK,CAAC;AAC1C,MAAM,qBAAqB,GAAG,GAAG,CAAC;AAClC,MAAM,8BAA8B,GAAG,GAAG,CAAC;AAE3C,MAAM,SAAS,GAAG,CAAC,KAAW,EAAE,QAAc,EAAQ,EAAE,CAAC,CAAC;IACxD,KAAK,EAAE,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK;IACrF,MAAM,EAAE,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM;CAC3F,CAAC,CAAC;AAEH,MAAM,YAAY,GAAG,CAAC,IAAc,EAAU,EAAE;IAC9C,IAAI,OAAO,IAAI,CAAC,gBAAgB,EAAE,KAAK,KAAK,QAAQ,EAAE,CAAC;QACrD,OAAO,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC;IACrC,CAAC;IAED,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;IAED,OAAO,IAAI,CAAC,EAAE,CAAC;AACjB,CAAC,CAAC;AAEF,MAAM,gBAAgB,GAAG,CAAC,KAAa,EAAY,EAAE;IACnD,MAAM,cAAc,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,2BAA2B,CAAC,CAAC;IACnE,MAAM,QAAQ,GAAG,cAAc,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC/C,MAAM,aAAa,GAAa,EAAE,CAAC;IAEnC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,QAAQ,CAAC,MAAM,IAAI,aAAa,CAAC,MAAM,GAAG,qBAAqB,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QACxG,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;QAC/C,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;YACvB,SAAS;QACX,CAAC;QAED,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,8BAA8B,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IACnF,CAAC;IAED,OAAO,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACrD,CAAC,CAAC;AAEF,MAAM,iBAAiB,GAAG,CAAC,IAAc,EAAE,OAAsB,EAAQ,EAAE;IACzE,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IACjC,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IACtC,MAAM,QAAQ,GACZ,IAAI,CAAC,gBAAgB,EAAE,QAAQ,IAAI,OAAO,CAAC,wBAAwB,IAAI,iBAAiB,CAAC;IAC3F,MAAM,QAAQ,GACZ,IAAI,CAAC,gBAAgB,EAAE,QAAQ,IAAI,OAAO,CAAC,wBAAwB,IAAI,iBAAiB,CAAC;IAC3F,MAAM,SAAS,GACb,IAAI,CAAC,gBAAgB,EAAE,kBAAkB;QACzC,OAAO,CAAC,yBAAyB;QACjC,kBAAkB,CAAC;IACrB,MAAM,UAAU,GACd,IAAI,CAAC,gBAAgB,EAAE,UAAU,IAAI,OAAO,CAAC,0BAA0B,IAAI,mBAAmB,CAAC;IACjG,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;QAC3C,IAAI,UAAU,GAAG,QAAQ,EAAE,CAAC;YAC1B,QAAQ,GAAG,UAAU,CAAC;QACxB,CAAC;IACH,CAAC;IACD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IAE5C,OAAO;QACL,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,iBAAiB,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,SAAS,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC;QACxF,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,iBAAiB,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,UAAU,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC;KAC7F,CAAC;AACJ,CAAC,CAAC;AAEF,MAAM,eAAe,GAAG,CAAC,IAAc,EAAE,OAAsB,EAAQ,EAAE;IACvE,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,IAAI,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC;IAC5D,MAAM,SAAS,GAAG,OAAO,CAAC,aAAa,IAAI,iBAAiB,CAAC;IAC7D,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACxE,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACxF,MAAM,aAAa,GAAG,iBAAiB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IAEvD,IAAI,IAAI,KAAK,UAAU,EAAE,CAAC;QACxB,OAAO,YAAY,IAAI,YAAY,IAAI,aAAa,CAAC;IACvD,CAAC;IAED,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;QACrB,OAAO,YAAY,IAAI,aAAa,CAAC;IACvC,CAAC;IAED,OAAO,YAAY,IAAI,SAAS,CAAC;AACnC,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,KAAiB,EAAE,OAAsB,EAAc,EAAE;IACvF,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC1B,GAAG,IAAI;QACP,IAAI,EAAE,eAAe,CAAC,IAAI,EAAE,OAAO,CAAC;KACrC,CAAC,CAAC,CAAC;AACN,CAAC,CAAC"}

package/package.json

@@ -0,0 +1,29 @@
+{
+  "name": "@graph-render/core",
+  "version": "1.0.1",
+  "private": false,
+  "publishConfig": {
+    "access": "public"
+  },
+  "type": "module",
+  "main": "dist/index.js",
+  "types": "dist/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js"
+    }
+  },
+  "license": "MIT",
+  "scripts": {
+    "build": "tsc -p tsconfig.json"
+  },
+  "dependencies": {
+    "@graph-render/types": "1.0.1"
+  },
+  "devDependencies": {
+    "@types/node": "^20.10.7",
+    "ts-node": "^10.9.2",
+    "typescript": "^5.3.3"
+  }
+}

package/project.json

@@ -0,0 +1,32 @@
+{
+  "name": "@graph-render/core",
+  "$schema": "../../node_modules/nx/schemas/project-schema.json",
+  "sourceRoot": "src/core-graph-render/src",
+  "projectType": "library",
+  "targets": {
+    "build": {
+      "executor": "nx:run-commands",
+      "outputs": ["{projectRoot}/dist"],
+      "options": {
+        "command": "tsc -p tsconfig.json",
+        "cwd": "{projectRoot}"
+      },
+      "dependsOn": ["^build"]
+    },
+    "lint": {
+      "executor": "nx:run-commands",
+      "options": {
+        "command": "eslint src --ext .ts --ignore-path ../../.eslintignore",
+        "cwd": "{projectRoot}"
+      }
+    },
+    "format": {
+      "executor": "nx:run-commands",
+      "options": {
+        "command": "prettier --write src",
+        "cwd": "{projectRoot}"
+      }
+    }
+  },
+  "tags": ["type:library"]
+}

package/src/edges/collision.ts

@@ -0,0 +1,31 @@
+import { Point } from '@graph-render/types';
+
+export const segmentIntersectsRect = (
+  p1: Point,
+  p2: Point,
+  rect: { x: number; y: number; w: number; h: number }
+): boolean => {
+  const { x, y, w, h } = rect;
+  const minX = Math.min(p1.x, p2.x);
+  const maxX = Math.max(p1.x, p2.x);
+  const minY = Math.min(p1.y, p2.y);
+  const maxY = Math.max(p1.y, p2.y);
+  if (maxX < x || minX > x + w || maxY < y || minY > y + h) return false;
+
+  const inside = (px: number, py: number) => px >= x && px <= x + w && py >= y && py <= y + h;
+  if (inside(p1.x, p1.y) || inside(p2.x, p2.y)) return true;
+
+  const intersectsEdge = (x1: number, y1: number, x2: number, y2: number) => {
+    const denom = (p2.y - p1.y) * (x2 - x1) - (p2.x - p1.x) * (y2 - y1);
+    if (denom === 0) return false;
+    const ua = ((p2.x - p1.x) * (y1 - p1.y) - (p2.y - p1.y) * (x1 - p1.x)) / denom;
+    const ub = ((x2 - x1) * (y1 - p1.y) - (y2 - y1) * (x1 - p1.x)) / denom;
+    return ua >= 0 && ua <= 1 && ub >= 0 && ub <= 1;
+  };
+
+  const r1 = intersectsEdge(x, y, x + w, y);
+  const r2 = intersectsEdge(x + w, y, x + w, y + h);
+  const r3 = intersectsEdge(x + w, y + h, x, y + h);
+  const r4 = intersectsEdge(x, y + h, x, y);
+  return r1 || r2 || r3 || r4;
+};