@graphty/layout 1.2.4 → 1.2.6

package/dist/src/algorithms/planarity/index.js

@@ -1,8 +0,0 @@
-/**
- * Re-export all planarity algorithms
- */
-export { checkPlanarity } from './check';
-export { isK5, isK33, tryFindBipartitePartition } from './special-graphs';
-export { lrPlanarityTest } from './lr-test';
-export { createTriangulationEmbedding, findCycle, combinatorialEmbeddingToPos } from './embedding';
-//# sourceMappingURL=index.js.map

package/dist/src/algorithms/planarity/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/algorithms/planarity/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,yBAAyB,EAAE,MAAM,kBAAkB,CAAC;AAC1E,OAAO,EAAE,eAAe,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,EACL,4BAA4B,EAC5B,SAAS,EACT,2BAA2B,EAC5B,MAAM,aAAa,CAAC"}

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

@@ -1,15 +0,0 @@
-/**
- * Left-Right Planarity Test implementation
- */
-import { Node, Edge, Embedding } from '../../types';
-/**
- * Left-Right Planarity Test for general graphs
- *
- * @param nodes - List of nodes
- * @param edges - List of edges
- * @returns Object containing isPlanar flag and embedding
- */
-export declare function lrPlanarityTest(nodes: Node[], edges: Edge[]): {
-    isPlanar: boolean;
-    embedding: Embedding | null;
-};

package/dist/src/algorithms/planarity/lr-test.js

@@ -1,54 +0,0 @@
-/**
- * Left-Right Planarity Test implementation
- */
-import { createTriangulationEmbedding } from './embedding';
-/**
- * Left-Right Planarity Test for general graphs
- *
- * @param nodes - List of nodes
- * @param edges - List of edges
- * @returns Object containing isPlanar flag and embedding
- */
-export function lrPlanarityTest(nodes, edges) {
-    // Create adjacency list for the graph
-    const adjList = {};
-    for (const node of nodes) {
-        adjList[node] = [];
-    }
-    for (const [u, v] of edges) {
-        adjList[u].push(v);
-        adjList[v].push(u);
-    }
-    // Step 1: Perform DFS to get an st-numbering (ordering of nodes)
-    const visited = new Set();
-    const ordering = [];
-    function dfs(node) {
-        visited.add(node);
-        ordering.push(node);
-        for (const neighbor of adjList[node]) {
-            if (!visited.has(neighbor)) {
-                dfs(neighbor);
-            }
-        }
-    }
-    // Start DFS from first node
-    dfs(nodes[0]);
-    // 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) };
-    }
-    // Step 2: For a general implementation, we'll use a simplified approach
-    // since this would normally require implementing the entire LR algorithm
-    // For this implementation, since we can't fully implement Boyer-Myrvold,
-    // we'll create a reasonable planar embedding for most planar graphs
-    // We assume the graph is planar if it's sparse enough (|E| <= 3|V| - 6)
-    // This is a necessary but not sufficient condition for planar graphs
-    if (edges.length > 3 * nodes.length - 6) {
-        return { isPlanar: false, embedding: null };
-    }
-    // Create a planar embedding using a triangulation approach
-    const embedding = createTriangulationEmbedding(nodes, edges);
-    return { isPlanar: true, embedding };
-}
-//# sourceMappingURL=lr-test.js.map

package/dist/src/algorithms/planarity/lr-test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"lr-test.js","sourceRoot":"","sources":["../../../../src/algorithms/planarity/lr-test.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,OAAO,EAAE,4BAA4B,EAAE,MAAM,aAAa,CAAC;AAE3D;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAC7B,KAAa,EACb,KAAa;IAEb,sCAAsC;IACtC,MAAM,OAAO,GAAyB,EAAE,CAAC;IACzC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;IACrB,CAAC;IAED,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;QAC3B,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IAED,iEAAiE;IACjE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAQ,CAAC;IAChC,MAAM,QAAQ,GAAW,EAAE,CAAC;IAE5B,SAAS,GAAG,CAAC,IAAU;QACrB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClB,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEpB,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACrC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC3B,GAAG,CAAC,QAAQ,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;IACH,CAAC;IAED,4BAA4B;IAC5B,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAEd,uFAAuF;IACvF,IAAI,QAAQ,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QACnC,kEAAkE;QAClE,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,SAAS,EAAE,4BAA4B,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;IACnF,CAAC;IAED,wEAAwE;IACxE,yEAAyE;IAEzE,yEAAyE;IACzE,oEAAoE;IAEpE,wEAAwE;IACxE,qEAAqE;IACrE,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxC,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;IAC9C,CAAC;IAED,2DAA2D;IAC3D,MAAM,SAAS,GAAG,4BAA4B,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAE7D,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;AACvC,CAAC"}

package/dist/src/algorithms/planarity/special-graphs.d.ts

@@ -1,28 +0,0 @@
-/**
- * Special graph detection functions for planarity testing
- */
-import { Node, Edge } from '../../types';
-/**
- * Check if graph is K5 (complete graph with 5 nodes)
- *
- * @param nodes - List of nodes
- * @param edges - List of edges
- * @returns True if graph is K5
- */
-export declare function isK5(nodes: Node[], edges: Edge[]): boolean;
-/**
- * Check if graph is K3,3 (complete bipartite with 3,3 nodes)
- *
- * @param nodes - List of nodes
- * @param edges - List of edges
- * @returns True if graph is K3,3
- */
-export declare function isK33(nodes: Node[], edges: Edge[]): boolean;
-/**
- * Try to find a bipartite partition of the nodes
- *
- * @param nodes - List of nodes
- * @param edges - List of edges
- * @returns Array of two partitions, or null if not bipartite
- */
-export declare function tryFindBipartitePartition(nodes: Node[], edges: Edge[]): [Node[], Node[]] | null;

package/dist/src/algorithms/planarity/special-graphs.js

@@ -1,108 +0,0 @@
-/**
- * Special graph detection functions for planarity testing
- */
-/**
- * Check if graph is K5 (complete graph with 5 nodes)
- *
- * @param nodes - List of nodes
- * @param edges - List of edges
- * @returns True if graph is K5
- */
-export function isK5(nodes, edges) {
-    if (nodes.length !== 5)
-        return false;
-    // K5 has exactly 10 edges
-    if (edges.length !== 10)
-        return false;
-    // Check if every pair of distinct nodes is connected
-    for (let i = 0; i < nodes.length; i++) {
-        for (let j = i + 1; j < nodes.length; j++) {
-            const hasEdge = edges.some(e => (e[0] === nodes[i] && e[1] === nodes[j]) ||
-                (e[0] === nodes[j] && e[1] === nodes[i]));
-            if (!hasEdge)
-                return false;
-        }
-    }
-    return true;
-}
-/**
- * Check if graph is K3,3 (complete bipartite with 3,3 nodes)
- *
- * @param nodes - List of nodes
- * @param edges - List of edges
- * @returns True if graph is K3,3
- */
-export function isK33(nodes, edges) {
-    if (nodes.length !== 6)
-        return false;
-    // K3,3 has exactly 9 edges
-    if (edges.length !== 9)
-        return false;
-    // Try to find a bipartite partition
-    const nodePartitions = tryFindBipartitePartition(nodes, edges);
-    if (!nodePartitions)
-        return false;
-    const [part1, part2] = nodePartitions;
-    // Check if both partitions have size 3
-    if (part1.length !== 3 || part2.length !== 3)
-        return false;
-    // Check if every node in part1 is connected to every node in part2
-    for (const n1 of part1) {
-        for (const n2 of part2) {
-            const hasEdge = edges.some(e => (e[0] === n1 && e[1] === n2) ||
-                (e[0] === n2 && e[1] === n1));
-            if (!hasEdge)
-                return false;
-        }
-    }
-    return true;
-}
-/**
- * Try to find a bipartite partition of the nodes
- *
- * @param nodes - List of nodes
- * @param edges - List of edges
- * @returns Array of two partitions, or null if not bipartite
- */
-export function tryFindBipartitePartition(nodes, edges) {
-    const colorMap = {};
-    const adjList = {};
-    // Create adjacency list
-    for (const node of nodes) {
-        adjList[node] = [];
-    }
-    for (const [u, v] of edges) {
-        adjList[u].push(v);
-        adjList[v].push(u);
-    }
-    // BFS to color nodes
-    const queue = [nodes[0]];
-    colorMap[nodes[0]] = 0;
-    while (queue.length > 0) {
-        const node = queue.shift();
-        const nodeColor = colorMap[node];
-        for (const neighbor of adjList[node]) {
-            if (colorMap[neighbor] === undefined) {
-                colorMap[neighbor] = 1 - nodeColor; // Toggle color (0/1)
-                queue.push(neighbor);
-            }
-            else if (colorMap[neighbor] === nodeColor) {
-                // Conflict: not bipartite
-                return null;
-            }
-        }
-    }
-    // Create partitions
-    const part0 = [];
-    const part1 = [];
-    for (const node of nodes) {
-        if (colorMap[node] === 0) {
-            part0.push(node);
-        }
-        else {
-            part1.push(node);
-        }
-    }
-    return [part0, part1];
-}
-//# sourceMappingURL=special-graphs.js.map

package/dist/src/algorithms/planarity/special-graphs.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"special-graphs.js","sourceRoot":"","sources":["../../../../src/algorithms/planarity/special-graphs.ts"],"names":[],"mappings":"AAAA;;GAEG;AAIH;;;;;;GAMG;AACH,MAAM,UAAU,IAAI,CAAC,KAAa,EAAE,KAAa;IAC/C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAErC,0BAA0B;IAC1B,IAAI,KAAK,CAAC,MAAM,KAAK,EAAE;QAAE,OAAO,KAAK,CAAC;IAEtC,qDAAqD;IACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CACxB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC3C,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAC3C,CAAC;YACF,IAAI,CAAC,OAAO;gBAAE,OAAO,KAAK,CAAC;QAC7B,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,KAAK,CAAC,KAAa,EAAE,KAAa;IAChD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAErC,2BAA2B;IAC3B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAErC,oCAAoC;IACpC,MAAM,cAAc,GAAG,yBAAyB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAC/D,IAAI,CAAC,cAAc;QAAE,OAAO,KAAK,CAAC;IAElC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,cAAc,CAAC;IAEtC,uCAAuC;IACvC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAE3D,mEAAmE;IACnE,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;QACvB,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CACxB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;gBAC/B,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAC/B,CAAC;YACF,IAAI,CAAC,OAAO;gBAAE,OAAO,KAAK,CAAC;QAC7B,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,yBAAyB,CACvC,KAAa,EACb,KAAa;IAEb,MAAM,QAAQ,GAAyB,EAAE,CAAC;IAC1C,MAAM,OAAO,GAAyB,EAAE,CAAC;IAEzC,wBAAwB;IACxB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;IACrB,CAAC;IAED,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;QAC3B,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IAED,qBAAqB;IACrB,MAAM,KAAK,GAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACjC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAEvB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC5B,MAAM,SAAS,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;QAEjC,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACrC,IAAI,QAAQ,CAAC,QAAQ,CAAC,KAAK,SAAS,EAAE,CAAC;gBACrC,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,qBAAqB;gBACzD,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACvB,CAAC;iBAAM,IAAI,QAAQ,CAAC,QAAQ,CAAC,KAAK,SAAS,EAAE,CAAC;gBAC5C,0BAA0B;gBAC1B,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;IACH,CAAC;IAED,oBAAoB;IACpB,MAAM,KAAK,GAAW,EAAE,CAAC;IACzB,MAAM,KAAK,GAAW,EAAE,CAAC;IAEzB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACzB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IAED,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;AACxB,CAAC"}

package/dist/src/generators/basic.d.ts

@@ -1,28 +0,0 @@
-/**
- * Basic graph generation functions
- */
-import { Graph } from '../types';
-/**
- * Create a complete graph with n nodes
- * @param n - Number of nodes
- * @returns Graph object with all nodes connected to all other nodes
- */
-export declare function completeGraph(n: number): Graph;
-/**
- * Create a cycle graph with n nodes
- * @param n - Number of nodes
- * @returns Graph object with nodes connected in a cycle
- */
-export declare function cycleGraph(n: number): Graph;
-/**
- * Create a star graph with n nodes (1 center + n-1 leaves)
- * @param n - Total number of nodes
- * @returns Graph object with star topology
- */
-export declare function starGraph(n: number): Graph;
-/**
- * Create a wheel graph with n nodes (1 center + n-1 rim nodes)
- * @param n - Total number of nodes
- * @returns Graph object with wheel topology
- */
-export declare function wheelGraph(n: number): Graph;

package/dist/src/generators/basic.js

@@ -1,79 +0,0 @@
-/**
- * Basic graph generation functions
- */
-/**
- * Create a complete graph with n nodes
- * @param n - Number of nodes
- * @returns Graph object with all nodes connected to all other nodes
- */
-export function completeGraph(n) {
-    const nodes = Array.from({ length: n }, (_, i) => i);
-    const edges = [];
-    for (let i = 0; i < n; i++) {
-        for (let j = i + 1; j < n; j++) {
-            edges.push([i, j]);
-        }
-    }
-    return {
-        nodes: () => nodes,
-        edges: () => edges
-    };
-}
-/**
- * Create a cycle graph with n nodes
- * @param n - Number of nodes
- * @returns Graph object with nodes connected in a cycle
- */
-export function cycleGraph(n) {
-    const nodes = Array.from({ length: n }, (_, i) => i);
-    const edges = [];
-    for (let i = 0; i < n; i++) {
-        edges.push([i, (i + 1) % n]);
-    }
-    return {
-        nodes: () => nodes,
-        edges: () => edges
-    };
-}
-/**
- * Create a star graph with n nodes (1 center + n-1 leaves)
- * @param n - Total number of nodes
- * @returns Graph object with star topology
- */
-export function starGraph(n) {
-    const nodes = Array.from({ length: n }, (_, i) => i);
-    const edges = [];
-    // Connect all nodes to node 0 (center)
-    for (let i = 1; i < n; i++) {
-        edges.push([0, i]);
-    }
-    return {
-        nodes: () => nodes,
-        edges: () => edges
-    };
-}
-/**
- * Create a wheel graph with n nodes (1 center + n-1 rim nodes)
- * @param n - Total number of nodes
- * @returns Graph object with wheel topology
- */
-export function wheelGraph(n) {
-    const nodes = Array.from({ length: n }, (_, i) => i);
-    const edges = [];
-    // Connect all rim nodes to center (node 0)
-    for (let i = 1; i < n; i++) {
-        edges.push([0, i]);
-    }
-    // Connect rim nodes in a cycle
-    for (let i = 1; i < n - 1; i++) {
-        edges.push([i, i + 1]);
-    }
-    if (n > 2) {
-        edges.push([n - 1, 1]);
-    }
-    return {
-        nodes: () => nodes,
-        edges: () => edges
-    };
-}
-//# sourceMappingURL=basic.js.map

package/dist/src/generators/basic.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"basic.js","sourceRoot":"","sources":["../../../src/generators/basic.ts"],"names":[],"mappings":"AAAA;;GAEG;AAIH;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,CAAS;IACrC,MAAM,KAAK,GAAW,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7D,MAAM,KAAK,GAAW,EAAE,CAAC;IAEzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAED,OAAO;QACL,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK;QAClB,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK;KACnB,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,CAAS;IAClC,MAAM,KAAK,GAAW,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7D,MAAM,KAAK,GAAW,EAAE,CAAC;IAEzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IAED,OAAO;QACL,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK;QAClB,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK;KACnB,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,SAAS,CAAC,CAAS;IACjC,MAAM,KAAK,GAAW,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7D,MAAM,KAAK,GAAW,EAAE,CAAC;IAEzB,uCAAuC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IAED,OAAO;QACL,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK;QAClB,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK;KACnB,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,CAAS;IAClC,MAAM,KAAK,GAAW,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7D,MAAM,KAAK,GAAW,EAAE,CAAC;IAEzB,2CAA2C;IAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IAED,+BAA+B;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC;IACD,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACV,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC;IAED,OAAO;QACL,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK;QAClB,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK;KACnB,CAAC;AACJ,CAAC"}

package/dist/src/generators/bipartite.d.ts

@@ -1,16 +0,0 @@
-/**
- * Bipartite graph generation function
- */
-import { Graph, Node } from '../types';
-/**
- * Create a bipartite graph with two sets of nodes
- * @param n1 - Number of nodes in first set
- * @param n2 - Number of nodes in second set
- * @param p - Probability of edge between nodes in different sets
- * @param seed - Random seed for reproducibility
- * @returns Graph object with bipartite structure and setA/setB properties
- */
-export declare function bipartiteGraph(n1: number, n2: number, p: number, seed?: number): Graph & {
-    setA: Node[];
-    setB: Node[];
-};

package/dist/src/generators/bipartite.js

@@ -1,40 +0,0 @@
-/**
- * Bipartite graph generation function
- */
-/**
- * Create a bipartite graph with two sets of nodes
- * @param n1 - Number of nodes in first set
- * @param n2 - Number of nodes in second set
- * @param p - Probability of edge between nodes in different sets
- * @param seed - Random seed for reproducibility
- * @returns Graph object with bipartite structure and setA/setB properties
- */
-export function bipartiteGraph(n1, n2, p, seed) {
-    const setA = Array.from({ length: n1 }, (_, i) => `A${i}`);
-    const setB = Array.from({ length: n2 }, (_, i) => `B${i}`);
-    const nodes = [...setA, ...setB];
-    const edges = [];
-    // Simple deterministic pseudo-random if seed provided
-    let currentSeed = seed;
-    let random = seed !== undefined
-        ? () => {
-            currentSeed = (currentSeed * 9301 + 49297) % 233280;
-            return currentSeed / 233280;
-        }
-        : Math.random;
-    // Only connect nodes between sets
-    for (const a of setA) {
-        for (const b of setB) {
-            if (random() < p) {
-                edges.push([a, b]);
-            }
-        }
-    }
-    return {
-        nodes: () => nodes,
-        edges: () => edges,
-        setA,
-        setB
-    };
-}
-//# sourceMappingURL=bipartite.js.map

package/dist/src/generators/bipartite.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"bipartite.js","sourceRoot":"","sources":["../../../src/generators/bipartite.ts"],"names":[],"mappings":"AAAA;;GAEG;AAIH;;;;;;;GAOG;AACH,MAAM,UAAU,cAAc,CAAC,EAAU,EAAE,EAAU,EAAE,CAAS,EAAE,IAAa;IAC7E,MAAM,IAAI,GAAW,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnE,MAAM,IAAI,GAAW,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnE,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC;IACjC,MAAM,KAAK,GAAW,EAAE,CAAC;IAEzB,sDAAsD;IACtD,IAAI,WAAW,GAAG,IAAI,CAAC;IACvB,IAAI,MAAM,GAAG,IAAI,KAAK,SAAS;QAC7B,CAAC,CAAC,GAAG,EAAE;YACH,WAAW,GAAG,CAAC,WAAY,GAAG,IAAI,GAAG,KAAK,CAAC,GAAG,MAAM,CAAC;YACrD,OAAO,WAAW,GAAG,MAAM,CAAC;QAC9B,CAAC;QACH,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;IAEhB,kCAAkC;IAClC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC;gBACjB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO;QACL,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK;QAClB,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK;QAClB,IAAI;QACJ,IAAI;KACL,CAAC;AACJ,CAAC"}

package/dist/src/generators/grid.d.ts

@@ -1,11 +0,0 @@
-/**
- * Grid graph generation function
- */
-import { Graph } from '../types';
-/**
- * Create a grid graph with rows x cols nodes
- * @param rows - Number of rows
- * @param cols - Number of columns
- * @returns Graph object with grid topology
- */
-export declare function gridGraph(rows: number, cols: number): Graph;

package/dist/src/generators/grid.js

@@ -1,37 +0,0 @@
-/**
- * Grid graph generation function
- */
-/**
- * Create a grid graph with rows x cols nodes
- * @param rows - Number of rows
- * @param cols - Number of columns
- * @returns Graph object with grid topology
- */
-export function gridGraph(rows, cols) {
-    const nodes = [];
-    const edges = [];
-    // Create nodes
-    for (let i = 0; i < rows; i++) {
-        for (let j = 0; j < cols; j++) {
-            nodes.push(`${i},${j}`);
-        }
-    }
-    // Create edges
-    for (let i = 0; i < rows; i++) {
-        for (let j = 0; j < cols; j++) {
-            // Connect to right neighbor
-            if (j < cols - 1) {
-                edges.push([`${i},${j}`, `${i},${j + 1}`]);
-            }
-            // Connect to bottom neighbor
-            if (i < rows - 1) {
-                edges.push([`${i},${j}`, `${i + 1},${j}`]);
-            }
-        }
-    }
-    return {
-        nodes: () => nodes,
-        edges: () => edges
-    };
-}
-//# sourceMappingURL=grid.js.map

package/dist/src/generators/grid.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"grid.js","sourceRoot":"","sources":["../../../src/generators/grid.ts"],"names":[],"mappings":"AAAA;;GAEG;AAIH;;;;;GAKG;AACH,MAAM,UAAU,SAAS,CAAC,IAAY,EAAE,IAAY;IAClD,MAAM,KAAK,GAAW,EAAE,CAAC;IACzB,MAAM,KAAK,GAAW,EAAE,CAAC;IAEzB,eAAe;IACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,eAAe;IACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,4BAA4B;YAC5B,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC;gBACjB,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7C,CAAC;YACD,6BAA6B;YAC7B,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC;gBACjB,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO;QACL,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK;QAClB,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK;KACnB,CAAC;AACJ,CAAC"}

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

@@ -1,8 +0,0 @@
-/**
- * Re-export all graph generation functions
- */
-export { completeGraph, cycleGraph, starGraph, wheelGraph } from './basic';
-export { gridGraph } from './grid';
-export { randomGraph } from './random';
-export { bipartiteGraph } from './bipartite';
-export { scaleFreeGraph } from './scale-free';

package/dist/src/generators/index.js

@@ -1,9 +0,0 @@
-/**
- * Re-export all graph generation functions
- */
-export { completeGraph, cycleGraph, starGraph, wheelGraph } from './basic';
-export { gridGraph } from './grid';
-export { randomGraph } from './random';
-export { bipartiteGraph } from './bipartite';
-export { scaleFreeGraph } from './scale-free';
-//# sourceMappingURL=index.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/generators/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EACL,aAAa,EACb,UAAU,EACV,SAAS,EACT,UAAU,EACX,MAAM,SAAS,CAAC;AAEjB,OAAO,EAAE,SAAS,EAAE,MAAM,QAAQ,CAAC;AACnC,OAAO,EAAE,WAAW,EAAE,MAAM,UAAU,CAAC;AACvC,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAC7C,OAAO,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC"}

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

@@ -1,12 +0,0 @@
-/**
- * Random graph generation function
- */
-import { Graph } from '../types';
-/**
- * Create a random graph with n nodes and given edge probability
- * @param n - Number of nodes
- * @param p - Probability of edge between any two nodes (0-1)
- * @param seed - Random seed for reproducibility
- * @returns Graph object with random edges
- */
-export declare function randomGraph(n: number, p: number, seed?: number): Graph;

package/dist/src/generators/random.js

@@ -1,34 +0,0 @@
-/**
- * Random graph generation function
- */
-/**
- * Create a random graph with n nodes and given edge probability
- * @param n - Number of nodes
- * @param p - Probability of edge between any two nodes (0-1)
- * @param seed - Random seed for reproducibility
- * @returns Graph object with random edges
- */
-export function randomGraph(n, p, seed) {
-    const nodes = Array.from({ length: n }, (_, i) => i);
-    const edges = [];
-    // Simple deterministic pseudo-random if seed provided
-    let currentSeed = seed;
-    let random = seed !== undefined
-        ? () => {
-            currentSeed = (currentSeed * 9301 + 49297) % 233280;
-            return currentSeed / 233280;
-        }
-        : Math.random;
-    for (let i = 0; i < n; i++) {
-        for (let j = i + 1; j < n; j++) {
-            if (random() < p) {
-                edges.push([i, j]);
-            }
-        }
-    }
-    return {
-        nodes: () => nodes,
-        edges: () => edges
-    };
-}
-//# sourceMappingURL=random.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"random.js","sourceRoot":"","sources":["../../../src/generators/random.ts"],"names":[],"mappings":"AAAA;;GAEG;AAIH;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CAAC,CAAS,EAAE,CAAS,EAAE,IAAa;IAC7D,MAAM,KAAK,GAAW,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7D,MAAM,KAAK,GAAW,EAAE,CAAC;IAEzB,sDAAsD;IACtD,IAAI,WAAW,GAAG,IAAI,CAAC;IACvB,IAAI,MAAM,GAAG,IAAI,KAAK,SAAS;QAC7B,CAAC,CAAC,GAAG,EAAE;YACH,WAAW,GAAG,CAAC,WAAY,GAAG,IAAI,GAAG,KAAK,CAAC,GAAG,MAAM,CAAC;YACrD,OAAO,WAAW,GAAG,MAAM,CAAC;QAC9B,CAAC;QACH,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;IAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,IAAI,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC;gBACjB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO;QACL,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK;QAClB,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK;KACnB,CAAC;AACJ,CAAC"}

package/dist/src/generators/scale-free.d.ts

@@ -1,12 +0,0 @@
-/**
- * Scale-free graph generation function
- */
-import { Graph } from '../types';
-/**
- * Create a scale-free graph using Barabási-Albert model
- * @param n - Total number of nodes
- * @param m - Number of edges to attach from new node
- * @param seed - Random seed for reproducibility
- * @returns Graph object with scale-free properties
- */
-export declare function scaleFreeGraph(n: number, m: number, seed?: number): Graph;

package/dist/src/generators/scale-free.js

@@ -1,62 +0,0 @@
-/**
- * Scale-free graph generation function
- */
-/**
- * Create a scale-free graph using Barabási-Albert model
- * @param n - Total number of nodes
- * @param m - Number of edges to attach from new node
- * @param seed - Random seed for reproducibility
- * @returns Graph object with scale-free properties
- */
-export function scaleFreeGraph(n, m, seed) {
-    if (m >= n) {
-        throw new Error('m must be less than n');
-    }
-    const nodes = Array.from({ length: n }, (_, i) => i);
-    const edges = [];
-    const degrees = new Array(n).fill(0);
-    // Simple deterministic pseudo-random if seed provided
-    let currentSeed = seed;
-    let random = seed !== undefined
-        ? () => {
-            currentSeed = (currentSeed * 9301 + 49297) % 233280;
-            return currentSeed / 233280;
-        }
-        : Math.random;
-    // Start with complete graph of m+1 nodes
-    for (let i = 0; i <= m; i++) {
-        for (let j = i + 1; j <= m; j++) {
-            edges.push([i, j]);
-            degrees[i]++;
-            degrees[j]++;
-        }
-    }
-    // Add remaining nodes
-    for (let i = m + 1; i < n; i++) {
-        const targets = new Set();
-        const totalDegree = degrees.reduce((sum, d) => sum + d, 0);
-        // Choose m targets based on preferential attachment
-        while (targets.size < m) {
-            let r = random() * totalDegree;
-            let cumSum = 0;
-            for (let j = 0; j < i; j++) {
-                cumSum += degrees[j];
-                if (r <= cumSum && !targets.has(j)) {
-                    targets.add(j);
-                    break;
-                }
-            }
-        }
-        // Add edges to targets
-        for (const target of targets) {
-            edges.push([i, target]);
-            degrees[i]++;
-            degrees[target]++;
-        }
-    }
-    return {
-        nodes: () => nodes,
-        edges: () => edges
-    };
-}
-//# sourceMappingURL=scale-free.js.map

package/dist/src/generators/scale-free.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"scale-free.js","sourceRoot":"","sources":["../../../src/generators/scale-free.ts"],"names":[],"mappings":"AAAA;;GAEG;AAIH;;;;;;GAMG;AACH,MAAM,UAAU,cAAc,CAAC,CAAS,EAAE,CAAS,EAAE,IAAa;IAChE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACX,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;IAC3C,CAAC;IAED,MAAM,KAAK,GAAW,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7D,MAAM,KAAK,GAAW,EAAE,CAAC;IACzB,MAAM,OAAO,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAErC,sDAAsD;IACtD,IAAI,WAAW,GAAG,IAAI,CAAC;IACvB,IAAI,MAAM,GAAG,IAAI,KAAK,SAAS;QAC7B,CAAC,CAAC,GAAG,EAAE;YACH,WAAW,GAAG,CAAC,WAAY,GAAG,IAAI,GAAG,KAAK,CAAC,GAAG,MAAM,CAAC;YACrD,OAAO,WAAW,GAAG,MAAM,CAAC;QAC9B,CAAC;QACH,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;IAEhB,yCAAyC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACnB,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YACb,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;QACf,CAAC;IACH,CAAC;IAED,sBAAsB;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAE3D,oDAAoD;QACpD,OAAO,OAAO,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YACxB,IAAI,CAAC,GAAG,MAAM,EAAE,GAAG,WAAW,CAAC;YAC/B,IAAI,MAAM,GAAG,CAAC,CAAC;YAEf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC;gBACrB,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACnC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACf,MAAM;gBACR,CAAC;YACH,CAAC;QACH,CAAC;QAED,uBAAuB;QACvB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;YACxB,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YACb,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QACpB,CAAC;IACH,CAAC;IAED,OAAO;QACL,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK;QAClB,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK;KACnB,CAAC;AACJ,CAAC"}

package/dist/src/index.d.ts

@@ -1,10 +0,0 @@
-/**
- * Main entry point for @graphty/layout
- *
- * This file exports the complete public API, maintaining
- * compatibility with the original layout.ts file.
- */
-export * from './types';
-export { rescaleLayout, rescaleLayoutDict } from './utils/rescale';
-export * from './layouts';
-export * from './generators';

package/dist/src/index.js

@@ -1,15 +0,0 @@
-/**
- * Main entry point for @graphty/layout
- *
- * This file exports the complete public API, maintaining
- * compatibility with the original layout.ts file.
- */
-// Re-export all types
-export * from './types';
-// Re-export utilities that are part of the public API
-export { rescaleLayout, rescaleLayoutDict } from './utils/rescale';
-// Re-export all layout algorithms
-export * from './layouts';
-// Re-export all graph generation functions
-export * from './generators';
-//# sourceMappingURL=index.js.map