@graphty/layout 1.2.7 → 1.2.9

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[][];
+}

package/dist/src/utils/random.js

@@ -0,0 +1,42 @@
+/**
+ * Random number generator for seed-based randomization
+ * Maintains exact same functionality as original implementation
+ */
+export class RandomNumberGenerator {
+    constructor(seed) {
+        this.seed = seed || Math.floor(Math.random() * 1000000);
+        this.m = 2 ** 35 - 31;
+        this.a = 185852;
+        this.c = 1;
+        this._state = this.seed % this.m;
+    }
+    _next() {
+        this._state = (this.a * this._state + this.c) % this.m;
+        return this._state / this.m;
+    }
+    rand(shape = null) {
+        if (shape === null) {
+            return this._next();
+        }
+        if (typeof shape === 'number') {
+            const result = [];
+            for (let i = 0; i < shape; i++) {
+                result.push(this._next());
+            }
+            return result;
+        }
+        if (shape.length === 1) {
+            const result = [];
+            for (let i = 0; i < shape[0]; i++) {
+                result.push(this._next());
+            }
+            return result;
+        }
+        const result = [];
+        for (let i = 0; i < shape[0]; i++) {
+            result.push(this.rand(shape.slice(1)));
+        }
+        return result;
+    }
+}
+//# sourceMappingURL=random.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"random.js","sourceRoot":"","sources":["../../../src/utils/random.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,MAAM,OAAO,qBAAqB;IAOhC,YAAY,IAAa;QACvB,IAAI,CAAC,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC;QACxD,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC;QAChB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACX,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC;IACnC,CAAC;IAED,KAAK;QACH,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACvD,OAAO,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC;IAC9B,CAAC;IAED,IAAI,CAAC,QAAkC,IAAI;QACzC,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;YACnB,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC;QACtB,CAAC;QAED,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC9B,MAAM,MAAM,GAAa,EAAE,CAAC;YAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;YAC5B,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,MAAM,MAAM,GAAa,EAAE,CAAC;YAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;YAC5B,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,MAAM,MAAM,GAAU,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF"}

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

@@ -0,0 +1,21 @@
+/**
+ * Layout rescaling utilities
+ */
+import { PositionMap } from '../types';
+/**
+ * Returns scaled position array/dict to (-scale, scale) in all axes.
+ *
+ * @param pos - Position dictionary or array
+ * @param scale - Scale factor for positions
+ * @param center - Coordinate pair around which to center the layout
+ * @returns Rescaled positions dictionary
+ */
+export declare function rescaleLayout(pos: PositionMap | number[][], scale?: number, center?: number[] | null): PositionMap | number[][];
+/**
+ * Return a dictionary of scaled positions centered at (0, 0).
+ *
+ * @param pos - Dictionary of positions
+ * @param scale - Scale factor for positions
+ * @returns Dictionary of scaled positions
+ */
+export declare function rescaleLayoutDict(pos: PositionMap, scale?: number): PositionMap;

package/dist/src/utils/rescale.js

@@ -0,0 +1,194 @@
+/**
+ * Layout rescaling utilities
+ */
+/**
+ * Returns scaled position array/dict to (-scale, scale) in all axes.
+ *
+ * @param pos - Position dictionary or array
+ * @param scale - Scale factor for positions
+ * @param center - Coordinate pair around which to center the layout
+ * @returns Rescaled positions dictionary
+ */
+export function rescaleLayout(pos, scale = 1, center = null) {
+    // Check if pos is empty
+    if (Array.isArray(pos)) {
+        if (pos.length === 0)
+            return [];
+    }
+    else {
+        if (Object.keys(pos).length === 0)
+            return {};
+    }
+    // Extract position values
+    const posValues = Array.isArray(pos) ? pos : Object.values(pos);
+    const dim = posValues[0].length;
+    // Fix Bug #1: Default center should match dimensionality
+    if (!center) {
+        center = Array(dim).fill(0);
+    }
+    // Use the maximum dimension between positions and center
+    const targetDim = Math.max(dim, center.length);
+    // Calculate center of positions, handling NaN values (Bug #3)
+    const posCenter = Array(dim).fill(0);
+    const counts = Array(dim).fill(0);
+    for (const p of posValues) {
+        for (let i = 0; i < dim; i++) {
+            if (!isNaN(p[i])) {
+                posCenter[i] += p[i];
+                counts[i]++;
+            }
+        }
+    }
+    // Average by actual count, not total length
+    for (let i = 0; i < dim; i++) {
+        posCenter[i] = counts[i] > 0 ? posCenter[i] / counts[i] : 0;
+    }
+    // Center positions
+    let centeredPos = {};
+    if (Array.isArray(pos)) {
+        centeredPos = pos.map(p => {
+            const centered = Array(targetDim).fill(0);
+            for (let i = 0; i < targetDim; i++) {
+                centered[i] = (i < p.length ? p[i] : 0) - (i < posCenter.length ? posCenter[i] : 0);
+            }
+            return centered;
+        });
+    }
+    else {
+        for (const [node, p] of Object.entries(pos)) {
+            const centered = Array(targetDim).fill(0);
+            for (let i = 0; i < targetDim; i++) {
+                centered[i] = (i < p.length ? p[i] : 0) - (i < posCenter.length ? posCenter[i] : 0);
+            }
+            centeredPos[node] = centered;
+        }
+    }
+    // Find maximum distance from center, handling NaN values (Bug #3)
+    let maxDistance = 0;
+    const centeredValues = Array.isArray(centeredPos) ? centeredPos : Object.values(centeredPos);
+    for (const p of centeredValues) {
+        // Calculate distance, treating NaN as 0 for distance calculation
+        let sumSquares = 0;
+        for (const val of p) {
+            if (!isNaN(val)) {
+                sumSquares += val * val;
+            }
+        }
+        const distance = Math.sqrt(sumSquares);
+        if (!isNaN(distance)) {
+            maxDistance = Math.max(maxDistance, distance);
+        }
+    }
+    // Rescale
+    let scaledPos = Array.isArray(pos) ? [] : {};
+    if (maxDistance > 0) {
+        const scaleFactor = scale / maxDistance;
+        if (Array.isArray(pos)) {
+            scaledPos = centeredPos.map((p, idx) => p.map((val, i) => {
+                // Check if this dimension existed in the original position
+                const origPos = pos[idx];
+                if (i >= origPos.length) {
+                    // This dimension was added, use center value
+                    return center[i];
+                }
+                // Preserve NaN values (Bug #3)
+                if (isNaN(val))
+                    return NaN;
+                return val * scaleFactor + center[i];
+            }));
+        }
+        else {
+            for (const [node, p] of Object.entries(centeredPos)) {
+                const origPos = pos[node];
+                scaledPos[node] = p.map((val, i) => {
+                    // Check if this dimension existed in the original position
+                    if (i >= origPos.length) {
+                        // This dimension was added, use center value
+                        return center[i];
+                    }
+                    // Preserve NaN values (Bug #3)
+                    if (isNaN(val))
+                        return NaN;
+                    return val * scaleFactor + center[i];
+                });
+            }
+        }
+    }
+    else {
+        // All nodes at the same position - extend to target dimensionality
+        if (Array.isArray(pos)) {
+            scaledPos = pos.map(p => {
+                const result = Array(targetDim);
+                for (let i = 0; i < targetDim; i++) {
+                    if (i < p.length) {
+                        result[i] = isNaN(p[i]) ? NaN : center[i];
+                    }
+                    else {
+                        result[i] = center[i];
+                    }
+                }
+                return result;
+            });
+        }
+        else {
+            for (const [node, p] of Object.entries(pos)) {
+                const result = Array(targetDim);
+                for (let i = 0; i < targetDim; i++) {
+                    if (i < p.length) {
+                        result[i] = isNaN(p[i]) ? NaN : center[i];
+                    }
+                    else {
+                        result[i] = center[i];
+                    }
+                }
+                scaledPos[node] = result;
+            }
+        }
+    }
+    return scaledPos;
+}
+/**
+ * Return a dictionary of scaled positions centered at (0, 0).
+ *
+ * @param pos - Dictionary of positions
+ * @param scale - Scale factor for positions
+ * @returns Dictionary of scaled positions
+ */
+export function rescaleLayoutDict(pos, scale = 1) {
+    if (Object.keys(pos).length === 0) {
+        return {};
+    }
+    // Extract positions as array
+    const posArray = Object.values(pos);
+    // Find center of positions
+    const center = [];
+    for (let d = 0; d < posArray[0].length; d++) {
+        center[d] = posArray.reduce((sum, p) => sum + p[d], 0) / posArray.length;
+    }
+    // Center positions
+    const centeredPos = {};
+    for (const [node, p] of Object.entries(pos)) {
+        centeredPos[node] = p.map((val, d) => val - center[d]);
+    }
+    // Find maximum distance from center
+    let maxDist = 0;
+    for (const p of Object.values(centeredPos)) {
+        const dist = Math.sqrt(p.reduce((sum, val) => sum + val * val, 0));
+        maxDist = Math.max(maxDist, dist);
+    }
+    // Scale positions
+    const scaledPos = {};
+    if (maxDist > 0) {
+        for (const [node, p] of Object.entries(centeredPos)) {
+            scaledPos[node] = p.map(val => val * scale / maxDist);
+        }
+    }
+    else {
+        // All points at the center
+        for (const node of Object.keys(centeredPos)) {
+            scaledPos[node] = Array(centeredPos[node].length).fill(0);
+        }
+    }
+    return scaledPos;
+}
+//# sourceMappingURL=rescale.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"rescale.js","sourceRoot":"","sources":["../../../src/utils/rescale.ts"],"names":[],"mappings":"AAAA;;GAEG;AAIH;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAC3B,GAA6B,EAC7B,QAAgB,CAAC,EACjB,SAA0B,IAAI;IAE9B,wBAAwB;IACxB,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACvB,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;IAClC,CAAC;SAAM,CAAC;QACN,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;IAC/C,CAAC;IAED,0BAA0B;IAC1B,MAAM,SAAS,GAAe,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC5E,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAEhC,yDAAyD;IACzD,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC;IAED,yDAAyD;IACzD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;IAE/C,8DAA8D;IAC9D,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrC,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAElC,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACjB,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;YACd,CAAC;QACH,CAAC;IACH,CAAC;IAED,4CAA4C;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,SAAS,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9D,CAAC;IAED,mBAAmB;IACnB,IAAI,WAAW,GAA6B,EAAE,CAAC;IAC/C,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACvB,WAAW,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;YACxB,MAAM,QAAQ,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACtF,CAAC;YACD,OAAO,QAAQ,CAAC;QAClB,CAAC,CAAC,CAAC;IACL,CAAC;SAAM,CAAC;QACN,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YAC5C,MAAM,QAAQ,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACtF,CAAC;YACA,WAA2B,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC;QAChD,CAAC;IACH,CAAC;IAED,kEAAkE;IAClE,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,MAAM,cAAc,GAAG,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;IAC7F,KAAK,MAAM,CAAC,IAAI,cAAc,EAAE,CAAC;QAC/B,iEAAiE;QACjE,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,KAAK,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;YACpB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBAChB,UAAU,IAAI,GAAG,GAAG,GAAG,CAAC;YAC1B,CAAC;QACH,CAAC;QACD,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;YACrB,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;IAED,UAAU;IACV,IAAI,SAAS,GAA6B,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IAEvE,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;QACpB,MAAM,WAAW,GAAG,KAAK,GAAG,WAAW,CAAC;QAExC,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,SAAwB,GAAI,WAA0B,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CACrE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;gBACf,2DAA2D;gBAC3D,MAAM,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;gBACzB,IAAI,CAAC,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;oBACxB,6CAA6C;oBAC7C,OAAO,MAAO,CAAC,CAAC,CAAC,CAAC;gBACpB,CAAC;gBACD,+BAA+B;gBAC/B,IAAI,KAAK,CAAC,GAAG,CAAC;oBAAE,OAAO,GAAG,CAAC;gBAC3B,OAAO,GAAG,GAAG,WAAW,GAAG,MAAO,CAAC,CAAC,CAAC,CAAC;YACxC,CAAC,CAAC,CACH,CAAC;QACJ,CAAC;aAAM,CAAC;YACN,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,WAA0B,CAAC,EAAE,CAAC;gBACnE,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;gBACzB,SAAyB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;oBAClD,2DAA2D;oBAC3D,IAAI,CAAC,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;wBACxB,6CAA6C;wBAC7C,OAAO,MAAO,CAAC,CAAC,CAAC,CAAC;oBACpB,CAAC;oBACD,+BAA+B;oBAC/B,IAAI,KAAK,CAAC,GAAG,CAAC;wBAAE,OAAO,GAAG,CAAC;oBAC3B,OAAO,GAAG,GAAG,WAAW,GAAG,MAAO,CAAC,CAAC,CAAC,CAAC;gBACxC,CAAC,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;SAAM,CAAC;QACN,mEAAmE;QACnE,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,SAAwB,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;gBACtC,MAAM,MAAM,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC;gBAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;oBACnC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;wBACjB,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAO,CAAC,CAAC,CAAC,CAAC;oBAC7C,CAAC;yBAAM,CAAC;wBACN,MAAM,CAAC,CAAC,CAAC,GAAG,MAAO,CAAC,CAAC,CAAC,CAAC;oBACzB,CAAC;gBACH,CAAC;gBACD,OAAO,MAAM,CAAC;YAChB,CAAC,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC5C,MAAM,MAAM,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC;gBAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;oBACnC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;wBACjB,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAO,CAAC,CAAC,CAAC,CAAC;oBAC7C,CAAC;yBAAM,CAAC;wBACN,MAAM,CAAC,CAAC,CAAC,GAAG,MAAO,CAAC,CAAC,CAAC,CAAC;oBACzB,CAAC;gBACH,CAAC;gBACA,SAAyB,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;YAC5C,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAC/B,GAAgB,EAChB,QAAgB,CAAC;IAEjB,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAClC,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,6BAA6B;IAC7B,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAEpC,2BAA2B;IAC3B,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;IAC3E,CAAC;IAED,mBAAmB;IACnB,MAAM,WAAW,GAAgB,EAAE,CAAC;IACpC,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QAC5C,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC;IAED,oCAAoC;IACpC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC;QAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QACnE,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IACpC,CAAC;IAED,kBAAkB;IAClB,MAAM,SAAS,GAAgB,EAAE,CAAC;IAClC,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;YACpD,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,KAAK,GAAG,OAAO,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;SAAM,CAAC;QACN,2BAA2B;QAC3B,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;YAC5C,SAAS,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC"}

package/dist/vitest.config.d.ts

@@ -0,0 +1,2 @@
+declare const _default: import("vite").UserConfig;
+export default _default;

package/dist/vitest.config.js

@@ -0,0 +1,30 @@
+import { defineConfig } from 'vitest/config';
+export default defineConfig({
+    test: {
+        globals: true,
+        environment: 'happy-dom',
+        pool: 'forks',
+        testTimeout: 30000,
+        coverage: {
+            provider: 'v8',
+            reporter: ['text', 'json', 'html', 'lcov'],
+            include: ['src/**/*.ts'],
+            exclude: ['**/*.d.ts', '**/*.test.ts'],
+            all: true,
+            thresholds: {
+                lines: 65,
+                functions: 60,
+                branches: 85,
+                statements: 65
+            }
+        },
+        include: ['test/**/*.test.ts', 'test/**/*.test.js'],
+        reporters: ['verbose']
+    },
+    resolve: {
+        alias: {
+            '@': '/src'
+        }
+    }
+});
+//# sourceMappingURL=vitest.config.js.map

package/dist/vitest.config.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"vitest.config.js","sourceRoot":"","sources":["../vitest.config.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAE7C,eAAe,YAAY,CAAC;IAC1B,IAAI,EAAE;QACJ,OAAO,EAAE,IAAI;QACb,WAAW,EAAE,WAAW;QACxB,IAAI,EAAE,OAAO;QACb,WAAW,EAAE,KAAK;QAClB,QAAQ,EAAE;YACR,QAAQ,EAAE,IAAI;YACd,QAAQ,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC;YAC1C,OAAO,EAAE,CAAC,aAAa,CAAC;YACxB,OAAO,EAAE,CAAC,WAAW,EAAE,cAAc,CAAC;YACtC,GAAG,EAAE,IAAI;YACT,UAAU,EAAE;gBACV,KAAK,EAAE,EAAE;gBACT,SAAS,EAAE,EAAE;gBACb,QAAQ,EAAE,EAAE;gBACZ,UAAU,EAAE,EAAE;aACf;SACF;QACD,OAAO,EAAE,CAAC,mBAAmB,EAAE,mBAAmB,CAAC;QACnD,SAAS,EAAE,CAAC,SAAS,CAAC;KACvB;IACD,OAAO,EAAE;QACP,KAAK,EAAE;YACL,GAAG,EAAE,MAAM;SACZ;KACF;CACF,CAAC,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@graphty/layout",
-  "version": "1.2.7",
+  "version": "1.2.9",
   "description": "graph layout algorithms based on networkx",
   "author": "Adam Powers <apowers@ato.ms>",
   "main": "dist/layout.js",
@@ -8,10 +8,10 @@
   "exports": {
     ".": {
       "import": "./dist/layout.js",
-      "types": "./dist/src/index.d.ts"
+      "types": "./dist/layout.d.ts"
     }
   },
-  "types": "dist/src/index.d.ts",
+  "types": "dist/layout.d.ts",
   "files": [
     "dist/",
     "src/",

package/src/algorithms/planarity/check.ts

@@ -19,11 +19,12 @@ import { createTriangulationEmbedding } from './embedding';
 export function checkPlanarity(
   G: Graph,
   nodes: Node[],
-  edges: Edge[]
+  edges: Edge[],
+  seed: number | null = null
 ): { isPlanar: boolean; embedding: Embedding | null } {
   // For small graphs (n <= 4), all are planar
   if (nodes.length <= 4) {
-    return { isPlanar: true, embedding: createTriangulationEmbedding(nodes, edges) };
+    return { isPlanar: true, embedding: createTriangulationEmbedding(nodes, edges, seed) };
   }
 
   // For K5 (complete graph with 5 nodes) and K3,3 (complete bipartite with 3,3 nodes)
@@ -33,6 +34,6 @@ export function checkPlanarity(
   }
 
   // For other graphs, use LR algorithm (Left-Right Planarity Test)
-  const result = lrPlanarityTest(nodes, edges);
+  const result = lrPlanarityTest(nodes, edges, seed);
   return result;
 }

package/src/algorithms/planarity/embedding.ts

@@ -3,6 +3,7 @@
  */
 
 import { Node, Edge, Embedding, PositionMap } from '../../types';
+import { RandomNumberGenerator } from '../../utils/random';
 
 /**
  * Create a triangulation-based embedding for a planar graph
@@ -13,8 +14,12 @@ import { Node, Edge, Embedding, PositionMap } from '../../types';
  */
 export function createTriangulationEmbedding(
   nodes: Node[],
-  edges: Edge[]
+  edges: Edge[],
+  seed: number | null = null
 ): Embedding {
+  // Create RNG instance for deterministic randomness
+  const rng = new RandomNumberGenerator(seed ?? undefined);
+  
   // Create a simple embedding using the incremental approach
   const embedding: Embedding = {
     nodeOrder: [...nodes],
@@ -67,15 +72,15 @@ export function createTriangulationEmbedding(
 
       if (count > 0) {
         // Place slightly away from center to avoid overlaps
-        const jitter = 0.1 * Math.random();
+        const jitter = 0.1 * (rng.rand() as number);
         embedding.nodePositions[node] = [
-          xSum / count + jitter * (Math.random() - 0.5),
-          ySum / count + jitter * (Math.random() - 0.5)
+          xSum / count + jitter * ((rng.rand() as number) - 0.5),
+          ySum / count + jitter * ((rng.rand() as number) - 0.5)
         ];
       } else {
         // No neighbors have positions yet, place randomly inside unit circle
-        const r = 0.5 * Math.random();
-        const angle = 2 * Math.PI * Math.random();
+        const r = 0.5 * (rng.rand() as number);
+        const angle = 2 * Math.PI * (rng.rand() as number);
         embedding.nodePositions[node] = [r * Math.cos(angle), r * Math.sin(angle)];
       }
     }

package/src/algorithms/planarity/lr-test.ts

@@ -14,7 +14,8 @@ import { createTriangulationEmbedding } from './embedding';
  */
 export function lrPlanarityTest(
   nodes: Node[],
-  edges: Edge[]
+  edges: Edge[],
+  seed: number | null = null
 ): { isPlanar: boolean; embedding: Embedding | null } {
   // Create adjacency list for the graph
   const adjList: Record<Node, Node[]> = {};
@@ -48,7 +49,7 @@ export function lrPlanarityTest(
   // If the graph is disconnected, it's still planar but we need to handle each component
   if (ordering.length < nodes.length) {
     // Create a simple triangulation embedding for disconnected graphs
-    return { isPlanar: true, embedding: createTriangulationEmbedding(nodes, edges) };
+    return { isPlanar: true, embedding: createTriangulationEmbedding(nodes, edges, seed) };
   }
 
   // Step 2: For a general implementation, we'll use a simplified approach
@@ -64,7 +65,7 @@ export function lrPlanarityTest(
   }
 
   // Create a planar embedding using a triangulation approach
-  const embedding = createTriangulationEmbedding(nodes, edges);
+  const embedding = createTriangulationEmbedding(nodes, edges, seed);
 
   return { isPlanar: true, embedding };
 }

package/src/layouts/specialized/planar.ts

@@ -15,13 +15,15 @@ import { checkPlanarity, combinatorialEmbeddingToPos } from '../../algorithms/pl
  * @param scale - Scale factor for positions
  * @param center - Coordinate pair around which to center the layout
  * @param dim - Dimension of layout (must be 2)
+ * @param seed - Random seed for reproducible layouts
  * @returns Positions dictionary keyed by node
  */
 export function planarLayout(
   G: Graph,
   scale: number = 1,
   center: number[] | null = null,
-  dim: number = 2
+  dim: number = 2,
+  seed: number | null = null
 ): PositionMap {
   if (dim !== 2) {
     throw new Error("can only handle 2 dimensions");
@@ -45,7 +47,7 @@ export function planarLayout(
   }
 
   // Check if graph is planar and get embedding
-  const { isPlanar, embedding } = checkPlanarity(graph, nodes, edges);
+  const { isPlanar, embedding } = checkPlanarity(graph, nodes, edges, seed);
 
   if (!isPlanar) {
     throw new Error("G is not planar.");