@graphty/layout 1.2.2 → 1.2.4

package/dist/src/layouts/index.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Re-export all layout algorithms
+ */
+export * from './basic';
+export * from './geometric';
+export * from './force-directed';
+export * from './hierarchical';
+export * from './specialized';

package/dist/src/layouts/index.js

@@ -0,0 +1,9 @@
+/**
+ * Re-export all layout algorithms
+ */
+export * from './basic';
+export * from './geometric';
+export * from './force-directed';
+export * from './hierarchical';
+export * from './specialized';
+//# sourceMappingURL=index.js.map

package/dist/src/layouts/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/layouts/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,cAAc,SAAS,CAAC;AACxB,cAAc,aAAa,CAAC;AAC5B,cAAc,kBAAkB,CAAC;AACjC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,eAAe,CAAC"}

package/dist/src/layouts/specialized/index.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Specialized layout algorithms
+ */
+export { spectralLayout } from './spectral';
+export { planarLayout } from './planar';

package/dist/src/layouts/specialized/index.js

@@ -0,0 +1,6 @@
+/**
+ * Specialized layout algorithms
+ */
+export { spectralLayout } from './spectral';
+export { planarLayout } from './planar';
+//# sourceMappingURL=index.js.map

package/dist/src/layouts/specialized/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/layouts/specialized/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAC5C,OAAO,EAAE,YAAY,EAAE,MAAM,UAAU,CAAC"}

package/dist/src/layouts/specialized/planar.d.ts

@@ -0,0 +1,14 @@
+/**
+ * Planar layout algorithm
+ */
+import { Graph, PositionMap } from '../../types';
+/**
+ * Position nodes without edge intersections (planar layout).
+ *
+ * @param G - Graph
+ * @param scale - Scale factor for positions
+ * @param center - Coordinate pair around which to center the layout
+ * @param dim - Dimension of layout (must be 2)
+ * @returns Positions dictionary keyed by node
+ */
+export declare function planarLayout(G: Graph, scale?: number, center?: number[] | null, dim?: number): PositionMap;

package/dist/src/layouts/specialized/planar.js

@@ -0,0 +1,47 @@
+/**
+ * Planar layout algorithm
+ */
+import { _processParams } from '../../utils/params';
+import { getNodesFromGraph, getEdgesFromGraph } from '../../utils/graph';
+import { rescaleLayout } from '../../utils/rescale';
+import { checkPlanarity, combinatorialEmbeddingToPos } from '../../algorithms/planarity';
+/**
+ * Position nodes without edge intersections (planar layout).
+ *
+ * @param G - Graph
+ * @param scale - Scale factor for positions
+ * @param center - Coordinate pair around which to center the layout
+ * @param dim - Dimension of layout (must be 2)
+ * @returns Positions dictionary keyed by node
+ */
+export function planarLayout(G, scale = 1, center = null, dim = 2) {
+    if (dim !== 2) {
+        throw new Error("can only handle 2 dimensions");
+    }
+    const processed = _processParams(G, center || [0, 0], dim);
+    // Planar layout requires a proper Graph, not just a list of nodes
+    if (Array.isArray(processed.G)) {
+        throw new Error('Planar layout requires a Graph with edges, not just a list of nodes');
+    }
+    const graph = processed.G;
+    center = processed.center;
+    const nodes = getNodesFromGraph(graph);
+    const edges = getEdgesFromGraph(graph);
+    if (nodes.length === 0) {
+        return {};
+    }
+    // Check if graph is planar and get embedding
+    const { isPlanar, embedding } = checkPlanarity(graph, nodes, edges);
+    if (!isPlanar) {
+        throw new Error("G is not planar.");
+    }
+    if (!embedding) {
+        throw new Error("Failed to generate planar embedding.");
+    }
+    // Convert embedding to positions
+    let pos = combinatorialEmbeddingToPos(embedding, nodes);
+    // Rescale the positions
+    pos = rescaleLayout(pos, scale, center);
+    return pos;
+}
+//# sourceMappingURL=planar.js.map

package/dist/src/layouts/specialized/planar.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"planar.js","sourceRoot":"","sources":["../../../../src/layouts/specialized/planar.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,OAAO,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AACpD,OAAO,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AACzE,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACpD,OAAO,EAAE,cAAc,EAAE,2BAA2B,EAAE,MAAM,4BAA4B,CAAC;AAEzF;;;;;;;;GAQG;AACH,MAAM,UAAU,YAAY,CAC1B,CAAQ,EACR,QAAgB,CAAC,EACjB,SAA0B,IAAI,EAC9B,MAAc,CAAC;IAEf,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;QACd,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;IAClD,CAAC;IAED,MAAM,SAAS,GAAG,cAAc,CAAC,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAE3D,kEAAkE;IAClE,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;QAC/B,MAAM,IAAI,KAAK,CAAC,qEAAqE,CAAC,CAAC;IACzF,CAAC;IAED,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC;IAC1B,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAE1B,MAAM,KAAK,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IACvC,MAAM,KAAK,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAEvC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,6CAA6C;IAC7C,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,cAAc,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAEpE,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,MAAM,IAAI,KAAK,CAAC,kBAAkB,CAAC,CAAC;IACtC,CAAC;IAED,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;IAC1D,CAAC;IAED,iCAAiC;IACjC,IAAI,GAAG,GAAG,2BAA2B,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IAExD,wBAAwB;IACxB,GAAG,GAAG,aAAa,CAAC,GAAG,EAAE,KAAK,EAAE,MAAM,CAAgB,CAAC;IAEvD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/src/layouts/specialized/spectral.d.ts

@@ -0,0 +1,14 @@
+/**
+ * Spectral layout algorithm using eigenvectors of the graph Laplacian
+ */
+import { Graph, PositionMap } from '../../types';
+/**
+ * Position nodes in a spectral layout using eigenvectors of the graph Laplacian.
+ *
+ * @param G - Graph
+ * @param scale - Scale factor for positions
+ * @param center - Coordinate pair around which to center the layout
+ * @param dim - Dimension of layout
+ * @returns Positions dictionary keyed by node
+ */
+export declare function spectralLayout(G: Graph, scale?: number, center?: number[] | null, dim?: number): PositionMap;

package/dist/src/layouts/specialized/spectral.js

@@ -0,0 +1,106 @@
+/**
+ * Spectral layout algorithm using eigenvectors of the graph Laplacian
+ */
+import { _processParams } from '../../utils/params';
+import { getNodesFromGraph, getEdgesFromGraph } from '../../utils/graph';
+import { rescaleLayout } from '../../utils/rescale';
+/**
+ * Position nodes in a spectral layout using eigenvectors of the graph Laplacian.
+ *
+ * @param G - Graph
+ * @param scale - Scale factor for positions
+ * @param center - Coordinate pair around which to center the layout
+ * @param dim - Dimension of layout
+ * @returns Positions dictionary keyed by node
+ */
+export function spectralLayout(G, scale = 1, center = null, dim = 2) {
+    const processed = _processParams(G, center, dim);
+    const graph = processed.G;
+    center = processed.center;
+    const nodes = getNodesFromGraph(graph);
+    if (nodes.length <= 2) {
+        if (nodes.length === 0) {
+            return {};
+        }
+        else if (nodes.length === 1) {
+            return { [nodes[0]]: center };
+        }
+        else {
+            return {
+                [nodes[0]]: center.map(v => v - scale),
+                [nodes[1]]: center.map(v => v + scale)
+            };
+        }
+    }
+    // Create adjacency matrix
+    const N = nodes.length;
+    const nodeIndices = {};
+    nodes.forEach((node, i) => { nodeIndices[node] = i; });
+    const A = Array(N).fill(0).map(() => Array(N).fill(0));
+    const edges = getEdgesFromGraph(graph);
+    for (const [source, target] of edges) {
+        const i = nodeIndices[source];
+        const j = nodeIndices[target];
+        A[i][j] = 1;
+        A[j][i] = 1; // Make symmetric for undirected graphs
+    }
+    // Create Laplacian matrix: L = D - A where D is degree matrix
+    const L = Array(N).fill(0).map(() => Array(N).fill(0));
+    for (let i = 0; i < N; i++) {
+        // Compute degree (sum of row)
+        L[i][i] = A[i].reduce((sum, val) => sum + val, 0);
+        for (let j = 0; j < N; j++) {
+            L[i][j] -= A[i][j];
+        }
+    }
+    // Compute eigenvectors using power iteration method
+    // We need the smallest non-zero eigenvectors of L
+    const eigenvectors = [];
+    // For each dimension, find an eigenvector
+    for (let d = 0; d < dim; d++) {
+        let vector = Array(N).fill(0).map(() => Math.random() - 0.5);
+        // Orthogonalize against previous eigenvectors
+        for (const ev of eigenvectors) {
+            const dot = vector.reduce((acc, val, idx) => acc + val * ev[idx], 0);
+            vector = vector.map((val, idx) => val - dot * ev[idx]);
+        }
+        // Normalize
+        const norm = Math.sqrt(vector.reduce((acc, val) => acc + val * val, 0));
+        vector = vector.map(val => val / norm);
+        // Apply shifted inverse iteration to find smallest non-zero eigenvector
+        // This is a simplification of the actual algorithm
+        for (let iter = 0; iter < 100; iter++) {
+            // Apply Laplacian
+            const newVec = Array(N).fill(0);
+            for (let i = 0; i < N; i++) {
+                for (let j = 0; j < N; j++) {
+                    newVec[i] += L[i][j] * vector[j];
+                }
+            }
+            // Orthogonalize against the constant vector (eigenvector with eigenvalue 0)
+            const mean = newVec.reduce((acc, val) => acc + val, 0) / N;
+            newVec.forEach((val, idx, arr) => { arr[idx] = val - mean; });
+            // Normalize
+            const newNorm = Math.sqrt(newVec.reduce((acc, val) => acc + val * val, 0));
+            if (newNorm < 1e-10)
+                continue; // Skip if vector is close to zero
+            vector = newVec.map(val => val / newNorm);
+        }
+        eigenvectors.push(vector);
+    }
+    // Create position array from eigenvectors
+    const positions = Array(N).fill(0).map(() => Array(dim).fill(0));
+    for (let i = 0; i < N; i++) {
+        for (let d = 0; d < dim; d++) {
+            positions[i][d] = eigenvectors[d][i];
+        }
+    }
+    // Rescale and create position dictionary
+    const scaledPositions = rescaleLayout(positions, scale);
+    const pos = {};
+    nodes.forEach((node, i) => {
+        pos[node] = scaledPositions[i].map((val, j) => val + center[j]);
+    });
+    return pos;
+}
+//# sourceMappingURL=spectral.js.map

package/dist/src/layouts/specialized/spectral.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"spectral.js","sourceRoot":"","sources":["../../../../src/layouts/specialized/spectral.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,OAAO,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AACpD,OAAO,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AACzE,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAEpD;;;;;;;;GAQG;AACH,MAAM,UAAU,cAAc,CAC5B,CAAQ,EACR,QAAgB,CAAC,EACjB,SAA0B,IAAI,EAC9B,MAAc,CAAC;IAEf,MAAM,SAAS,GAAG,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;IACjD,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC;IAC1B,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAE1B,MAAM,KAAK,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAEvC,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACtB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,EAAE,CAAC;QACZ,CAAC;aAAM,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC9B,OAAO,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC;QAChC,CAAC;aAAM,CAAC;YACN,OAAO;gBACL,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC;gBACtC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC;aACvC,CAAC;QACJ,CAAC;IACH,CAAC;IAED,0BAA0B;IAC1B,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,MAAM,WAAW,GAAyB,EAAE,CAAC;IAC7C,KAAK,CAAC,OAAO,CAAC,CAAC,IAAU,EAAE,CAAS,EAAE,EAAE,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAErE,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,MAAM,KAAK,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAEvC,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACrC,MAAM,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;QAC9B,MAAM,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACZ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,uCAAuC;IACtD,CAAC;IAED,8DAA8D;IAC9D,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,8BAA8B;QAC9B,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;QAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAED,oDAAoD;IACpD,kDAAkD;IAClD,MAAM,YAAY,GAAe,EAAE,CAAC;IAEpC,0CAA0C;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,IAAI,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC;QAE7D,8CAA8C;QAC9C,KAAK,MAAM,EAAE,IAAI,YAAY,EAAE,CAAC;YAC9B,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACrE,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACzD,CAAC;QAED,YAAY;QACZ,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QACxE,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC;QAEvC,wEAAwE;QACxE,mDAAmD;QACnD,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC;YACtC,kBAAkB;YAClB,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBACnC,CAAC;YACH,CAAC;YAED,4EAA4E;YAC5E,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;YAC3D,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAE9D,YAAY;YACZ,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAC3E,IAAI,OAAO,GAAG,KAAK;gBAAE,SAAS,CAAC,kCAAkC;YAEjE,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,OAAO,CAAC,CAAC;QAC5C,CAAC;QAED,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC5B,CAAC;IAED,0CAA0C;IAC1C,MAAM,SAAS,GAAe,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IAED,yCAAyC;IACzC,MAAM,eAAe,GAAG,aAAa,CAAC,SAAgB,EAAE,KAAK,CAAC,CAAC;IAC/D,MAAM,GAAG,GAAgB,EAAE,CAAC;IAC5B,KAAK,CAAC,OAAO,CAAC,CAAC,IAAU,EAAE,CAAS,EAAE,EAAE;QACtC,GAAG,CAAC,IAAI,CAAC,GAAI,eAA8B,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAW,EAAE,CAAS,EAAE,EAAE,CAAC,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAClG,CAAC,CAAC,CAAC;IAEH,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/src/types/embedding.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Embedding type for planar layout algorithms
+ */
+import { Node, Position } from './index';
+export interface Embedding {
+    nodeOrder: Node[];
+    faceList: Node[][];
+    nodePositions: Record<Node, Position>;
+}

package/dist/src/types/embedding.js

@@ -0,0 +1,5 @@
+/**
+ * Embedding type for planar layout algorithms
+ */
+export {};
+//# sourceMappingURL=embedding.js.map

package/dist/src/types/embedding.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"embedding.js","sourceRoot":"","sources":["../../../src/types/embedding.ts"],"names":[],"mappings":"AAAA;;GAEG"}

package/dist/src/types/graph.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Core graph type definitions
+ */
+export type Node = string | number;
+export type Edge = [Node, Node];
+export type Graph = {
+    nodes: () => Node[];
+    edges: () => Edge[];
+    getEdgeData?: (source: Node, target: Node, attr: string) => any;
+};

package/dist/src/types/graph.js

@@ -0,0 +1,5 @@
+/**
+ * Core graph type definitions
+ */
+export {};
+//# sourceMappingURL=graph.js.map

package/dist/src/types/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../../src/types/graph.ts"],"names":[],"mappings":"AAAA;;GAEG"}

package/dist/src/types/index.d.ts

@@ -0,0 +1,6 @@
+/**
+ * Re-export all type definitions
+ */
+export * from './graph';
+export * from './layout';
+export * from './embedding';

package/dist/src/types/index.js

@@ -0,0 +1,7 @@
+/**
+ * Re-export all type definitions
+ */
+export * from './graph';
+export * from './layout';
+export * from './embedding';
+//# sourceMappingURL=index.js.map

package/dist/src/types/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/types/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,cAAc,SAAS,CAAC;AACxB,cAAc,UAAU,CAAC;AACzB,cAAc,aAAa,CAAC"}

package/dist/src/types/layout.d.ts

@@ -0,0 +1,6 @@
+/**
+ * Layout-specific type definitions
+ */
+import { Node } from './graph';
+export type Position = number[];
+export type PositionMap = Record<Node, Position>;

package/dist/src/types/layout.js

@@ -0,0 +1,5 @@
+/**
+ * Layout-specific type definitions
+ */
+export {};
+//# sourceMappingURL=layout.js.map

package/dist/src/types/layout.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"layout.js","sourceRoot":"","sources":["../../../src/types/layout.ts"],"names":[],"mappings":"AAAA;;GAEG"}

package/dist/src/utils/graph.d.ts

@@ -0,0 +1,34 @@
+/**
+ * Graph utility functions
+ */
+import { Graph, Node, Edge } from '../types';
+/**
+ * Extract nodes from a graph object
+ *
+ * @param G - Graph or list of nodes
+ * @returns Array of nodes
+ */
+export declare function getNodesFromGraph(G: Graph | Node[]): Node[];
+/**
+ * Extract edges from a graph object
+ *
+ * @param G - Graph or list of nodes
+ * @returns Array of edges
+ */
+export declare function getEdgesFromGraph(G: Graph | Node[]): Edge[];
+/**
+ * Get the degree of a node in the graph
+ *
+ * @param graph - Graph object
+ * @param node - Node to get degree for
+ * @returns Degree of the node
+ */
+export declare function getNodeDegree(graph: Graph, node: Node): number;
+/**
+ * Get the neighbors of a node in the graph
+ *
+ * @param graph - Graph object
+ * @param node - Node to get neighbors for
+ * @returns Array of neighbor nodes
+ */
+export declare function getNeighbors(graph: Graph, node: Node): Node[];

package/dist/src/utils/graph.js

@@ -0,0 +1,69 @@
+/**
+ * Graph utility functions
+ */
+/**
+ * Extract nodes from a graph object
+ *
+ * @param G - Graph or list of nodes
+ * @returns Array of nodes
+ */
+export function getNodesFromGraph(G) {
+    if (Array.isArray(G)) {
+        return G;
+    }
+    return G.nodes();
+}
+/**
+ * Extract edges from a graph object
+ *
+ * @param G - Graph or list of nodes
+ * @returns Array of edges
+ */
+export function getEdgesFromGraph(G) {
+    if (Array.isArray(G)) {
+        return [];
+    }
+    return G.edges();
+}
+/**
+ * Get the degree of a node in the graph
+ *
+ * @param graph - Graph object
+ * @param node - Node to get degree for
+ * @returns Degree of the node
+ */
+export function getNodeDegree(graph, node) {
+    if (!graph.edges)
+        return 0;
+    const edges = graph.edges();
+    let degree = 0;
+    for (const [source, target] of edges) {
+        if (source === node || target === node) {
+            degree++;
+        }
+    }
+    return degree;
+}
+/**
+ * Get the neighbors of a node in the graph
+ *
+ * @param graph - Graph object
+ * @param node - Node to get neighbors for
+ * @returns Array of neighbor nodes
+ */
+export function getNeighbors(graph, node) {
+    if (!graph.edges)
+        return [];
+    const neighbors = new Set();
+    const edges = graph.edges();
+    for (const [source, target] of edges) {
+        if (source === node) {
+            neighbors.add(target);
+        }
+        else if (target === node) {
+            neighbors.add(source);
+        }
+    }
+    return Array.from(neighbors);
+}
+//# sourceMappingURL=graph.js.map

package/dist/src/utils/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../../src/utils/graph.ts"],"names":[],"mappings":"AAAA;;GAEG;AAIH;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAAC,CAAiB;IACjD,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;QACrB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC;AACnB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAAC,CAAiB;IACjD,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;QACrB,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC;AACnB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAAC,KAAY,EAAE,IAAU;IACpD,IAAI,CAAC,KAAK,CAAC,KAAK;QAAE,OAAO,CAAC,CAAC;IAE3B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;IAC5B,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACrC,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACvC,MAAM,EAAE,CAAC;QACX,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAAC,KAAY,EAAE,IAAU;IACnD,IAAI,CAAC,KAAK,CAAC,KAAK;QAAE,OAAO,EAAE,CAAC;IAE5B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAQ,CAAC;IAClC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;IAE5B,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACrC,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACpB,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACxB,CAAC;aAAM,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YAC3B,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;AAC/B,CAAC"}

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

@@ -0,0 +1,8 @@
+/**
+ * Re-export all utilities
+ */
+export * from './numpy';
+export * from './random';
+export * from './graph';
+export * from './params';
+export * from './rescale';

package/dist/src/utils/index.js

@@ -0,0 +1,9 @@
+/**
+ * Re-export all utilities
+ */
+export * from './numpy';
+export * from './random';
+export * from './graph';
+export * from './params';
+export * from './rescale';
+//# sourceMappingURL=index.js.map

package/dist/src/utils/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/utils/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,cAAc,SAAS,CAAC;AACxB,cAAc,UAAU,CAAC;AACzB,cAAc,SAAS,CAAC;AACxB,cAAc,UAAU,CAAC;AACzB,cAAc,WAAW,CAAC"}

package/dist/src/utils/numpy.d.ts

@@ -0,0 +1,17 @@
+/**
+ * NumPy-like array manipulation functions
+ * Maintains exact same functionality as original implementation
+ */
+export declare const np: {
+    zeros: (shape: number | number[]) => number | number[] | number[][] | any[];
+    ones: (shape: number | number[]) => number | any[];
+    linspace: (start: number, stop: number, num: number) => number[];
+    array: (arr: any) => any[];
+    repeat: (a: any, repeats: number) => any[];
+    mean: (arr: number[] | number[][], axis?: number | null) => number | number[];
+    add: (a: number | number[], b: number | number[]) => number | number[];
+    subtract: (a: number | number[], b: number | number[]) => number | number[];
+    max: (arr: number | number[]) => number;
+    min: (arr: number | number[]) => number;
+    norm: (arr: number[]) => number;
+};

package/dist/src/utils/numpy.js

@@ -0,0 +1,101 @@
+/**
+ * NumPy-like array manipulation functions
+ * Maintains exact same functionality as original implementation
+ */
+export const np = {
+    zeros: function (shape) {
+        if (typeof shape === 'number') {
+            return Array(shape).fill(0);
+        }
+        if (shape.length === 1) {
+            return Array(shape[0]).fill(0);
+        }
+        return Array(shape[0]).fill(0).map(() => this.zeros(shape.slice(1)));
+    },
+    ones: function (shape) {
+        if (typeof shape === 'number') {
+            return Array(shape).fill(1);
+        }
+        if (shape.length === 1) {
+            return Array(shape[0]).fill(1);
+        }
+        return Array(shape[0]).fill(1).map(() => this.ones(shape.slice(1)));
+    },
+    linspace: function (start, stop, num) {
+        if (num === 1) {
+            return [start];
+        }
+        const step = (stop - start) / (num - 1);
+        return Array.from({ length: num }, (_, i) => start + i * step);
+    },
+    array: function (arr) {
+        return Array.isArray(arr) ? [...arr] : [arr];
+    },
+    repeat: function (a, repeats) {
+        const result = [];
+        for (let i = 0; i < repeats; i++) {
+            result.push(...np.array(a));
+        }
+        return result;
+    },
+    mean: function (arr, axis = null) {
+        if (axis === null) {
+            const flatArr = Array.isArray(arr[0])
+                ? arr.flat(Infinity)
+                : arr;
+            const sum = flatArr.reduce((a, b) => a + b, 0);
+            return sum / flatArr.length;
+        }
+        if (axis === 0) {
+            const result = [];
+            const matrix = arr;
+            for (let i = 0; i < matrix[0].length; i++) {
+                let sum = 0;
+                for (let j = 0; j < matrix.length; j++) {
+                    sum += matrix[j][i];
+                }
+                result.push(sum / matrix.length);
+            }
+            return result;
+        }
+        return arr.map(row => np.mean(row));
+    },
+    add: function (a, b) {
+        if (!Array.isArray(a) && !Array.isArray(b)) {
+            return a + b;
+        }
+        if (!Array.isArray(a)) {
+            return b.map(val => a + val);
+        }
+        if (!Array.isArray(b)) {
+            return a.map(val => val + b);
+        }
+        return a.map((val, i) => val + b[i]);
+    },
+    subtract: function (a, b) {
+        if (!Array.isArray(a) && !Array.isArray(b)) {
+            return a - b;
+        }
+        if (!Array.isArray(a)) {
+            return b.map(val => a - val);
+        }
+        if (!Array.isArray(b)) {
+            return a.map(val => val - b);
+        }
+        return a.map((val, i) => val - b[i]);
+    },
+    max: function (arr) {
+        if (!Array.isArray(arr))
+            return arr;
+        return Math.max(...arr.flat(Infinity));
+    },
+    min: function (arr) {
+        if (!Array.isArray(arr))
+            return arr;
+        return Math.min(...arr.flat(Infinity));
+    },
+    norm: function (arr) {
+        return Math.sqrt(arr.reduce((sum, val) => sum + val * val, 0));
+    }
+};
+//# sourceMappingURL=numpy.js.map

package/dist/src/utils/numpy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"numpy.js","sourceRoot":"","sources":["../../../src/utils/numpy.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,MAAM,CAAC,MAAM,EAAE,GAAG;IAChB,KAAK,EAAE,UAAU,KAAwB;QACvC,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC9B,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,CAAC;QACD,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,CAAC;IAED,IAAI,EAAE,UAAU,KAAwB;QACtC,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC9B,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,CAAC;QACD,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtE,CAAC;IAED,QAAQ,EAAE,UAAU,KAAa,EAAE,IAAY,EAAE,GAAW;QAC1D,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;YACd,OAAO,CAAC,KAAK,CAAC,CAAC;QACjB,CAAC;QACD,MAAM,IAAI,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QACxC,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;IACjE,CAAC;IAED,KAAK,EAAE,UAAU,GAAQ;QACvB,OAAO,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC/C,CAAC;IAED,MAAM,EAAE,UAAU,CAAM,EAAE,OAAe;QACvC,MAAM,MAAM,GAAU,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,IAAI,EAAE,UAAU,GAA0B,EAAE,OAAsB,IAAI;QACpE,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACnC,CAAC,CAAE,GAAkB,CAAC,IAAI,CAAC,QAAQ,CAAa;gBAChD,CAAC,CAAC,GAAe,CAAC;YACpB,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/C,OAAO,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC;QAC9B,CAAC;QAED,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,MAAM,MAAM,GAAa,EAAE,CAAC;YAC5B,MAAM,MAAM,GAAG,GAAiB,CAAC;YACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,IAAI,GAAG,GAAG,CAAC,CAAC;gBACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACvC,GAAG,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtB,CAAC;gBACD,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;YACnC,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,OAAQ,GAAkB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAW,CAAC,CAAC;IAChE,CAAC;IAED,GAAG,EAAE,UAAU,CAAoB,EAAE,CAAoB;QACvD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YAC3C,OAAO,CAAC,GAAG,CAAC,CAAC;QACf,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YACtB,OAAQ,CAAc,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QAC7C,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YACtB,OAAQ,CAAc,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QAC7C,CAAC;QACD,OAAQ,CAAc,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAI,CAAc,CAAC,CAAC,CAAC,CAAC,CAAC;IACnE,CAAC;IAED,QAAQ,EAAE,UAAU,CAAoB,EAAE,CAAoB;QAC5D,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YAC3C,OAAO,CAAC,GAAG,CAAC,CAAC;QACf,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YACtB,OAAQ,CAAc,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QAC7C,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YACtB,OAAQ,CAAc,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QAC7C,CAAC;QACD,OAAQ,CAAc,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAI,CAAc,CAAC,CAAC,CAAC,CAAC,CAAC;IACnE,CAAC;IAED,GAAG,EAAE,UAAU,GAAsB;QACnC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;YAAE,OAAO,GAAG,CAAC;QACpC,OAAO,IAAI,CAAC,GAAG,CAAC,GAAI,GAAgB,CAAC,IAAI,CAAC,QAAQ,CAAa,CAAC,CAAC;IACnE,CAAC;IAED,GAAG,EAAE,UAAU,GAAsB;QACnC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;YAAE,OAAO,GAAG,CAAC;QACpC,OAAO,IAAI,CAAC,GAAG,CAAC,GAAI,GAAgB,CAAC,IAAI,CAAC,QAAQ,CAAa,CAAC,CAAC;IACnE,CAAC;IAED,IAAI,EAAE,UAAU,GAAa;QAC3B,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACjE,CAAC;CACF,CAAC"}

package/dist/src/utils/params.d.ts

@@ -0,0 +1,17 @@
+/**
+ * Parameter processing utilities
+ */
+import { Graph, Node } from '../types';
+/**
+ * Process and validate layout parameters
+ * Helper function similar to _process_params in Python version
+ *
+ * @param G - Graph object or array of nodes
+ * @param center - Center coordinates or null
+ * @param dim - Dimension of layout
+ * @returns Processed parameters
+ */
+export declare function _processParams(G: Graph | Node[], center: number[] | null, dim: number): {
+    G: Graph | Node[];
+    center: number[];
+};

package/dist/src/utils/params.js

@@ -0,0 +1,22 @@
+/**
+ * Parameter processing utilities
+ */
+/**
+ * Process and validate layout parameters
+ * Helper function similar to _process_params in Python version
+ *
+ * @param G - Graph object or array of nodes
+ * @param center - Center coordinates or null
+ * @param dim - Dimension of layout
+ * @returns Processed parameters
+ */
+export function _processParams(G, center, dim) {
+    if (!center) {
+        center = Array(dim).fill(0);
+    }
+    if (center.length !== dim) {
+        throw new Error("length of center coordinates must match dimension of layout");
+    }
+    return { G, center };
+}
+//# sourceMappingURL=params.js.map

package/dist/src/utils/params.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"params.js","sourceRoot":"","sources":["../../../src/utils/params.ts"],"names":[],"mappings":"AAAA;;GAEG;AAIH;;;;;;;;GAQG;AACH,MAAM,UAAU,cAAc,CAAC,CAAiB,EAAE,MAAuB,EAAE,GAAW;IACpF,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC;IAED,IAAI,MAAM,CAAC,MAAM,KAAK,GAAG,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CAAC,6DAA6D,CAAC,CAAC;IACjF,CAAC;IAED,OAAO,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC;AACvB,CAAC"}

package/dist/src/utils/random.d.ts

@@ -0,0 +1,14 @@
+/**
+ * Random number generator for seed-based randomization
+ * Maintains exact same functionality as original implementation
+ */
+export declare class RandomNumberGenerator {
+    private seed;
+    private m;
+    private a;
+    private c;
+    private _state;
+    constructor(seed?: number);
+    _next(): number;
+    rand(shape?: number | number[] | null): number | number[] | number[][];
+}