@graphty/layout 1.2.4 → 1.2.6

package/dist/src/layouts/hierarchical/bfs.js

@@ -1,62 +0,0 @@
-import { getNodesFromGraph, getNeighbors } from '../../utils/graph';
-import { _processParams } from '../../utils/params';
-import { multipartiteLayout } from './multipartite';
-/**
- * Position nodes according to breadth-first search algorithm.
- *
- * @param G - Graph
- * @param start - Starting node for bfs
- * @param align - The alignment of layers: 'vertical' or 'horizontal'
- * @param scale - Scale factor for positions
- * @param center - Coordinate pair around which to center the layout
- * @returns Positions dictionary keyed by node
- */
-export function bfsLayout(G, start, align = 'vertical', scale = 1, center = null) {
-    const processed = _processParams(G, center || [0, 0], 2);
-    // BFS layout requires a proper Graph, not just a list of nodes
-    if (Array.isArray(processed.G)) {
-        throw new Error('BFS layout requires a Graph with edges, not just a list of nodes');
-    }
-    const graph = processed.G;
-    center = processed.center;
-    const allNodes = getNodesFromGraph(graph);
-    if (allNodes.length === 0) {
-        return {};
-    }
-    // Compute BFS layers
-    const layers = {};
-    const visited = new Set();
-    let currentLayer = 0;
-    // Starting layer
-    layers[currentLayer] = [start];
-    visited.add(start);
-    // BFS traversal
-    while (Object.values(layers).flat().length < allNodes.length) {
-        const nextLayer = [];
-        const currentNodes = layers[currentLayer];
-        for (const node of currentNodes) {
-            // Get neighbors - this is a simplified approach
-            // In a real implementation, we would get neighbors from the graph
-            const neighbors = getNeighbors(graph, node);
-            for (const neighbor of neighbors) {
-                if (!visited.has(neighbor)) {
-                    nextLayer.push(neighbor);
-                    visited.add(neighbor);
-                }
-            }
-        }
-        if (nextLayer.length === 0) {
-            // No more connected nodes
-            const unvisited = allNodes.filter((node) => !visited.has(node));
-            if (unvisited.length > 0) {
-                throw new Error("bfs_layout didn't include all nodes. Graph may be disconnected.");
-            }
-            break;
-        }
-        currentLayer++;
-        layers[currentLayer] = nextLayer;
-    }
-    // Use multipartite_layout to position the layers
-    return multipartiteLayout(graph, layers, align, scale, center);
-}
-//# sourceMappingURL=bfs.js.map

package/dist/src/layouts/hierarchical/bfs.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"bfs.js","sourceRoot":"","sources":["../../../../src/layouts/hierarchical/bfs.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,iBAAiB,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACpE,OAAO,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AACpD,OAAO,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AAEpD;;;;;;;;;GASG;AACH,MAAM,UAAU,SAAS,CACvB,CAAQ,EACR,KAAW,EACX,QAAmC,UAAU,EAC7C,QAAgB,CAAC,EACjB,SAA0B,IAAI;IAE9B,MAAM,SAAS,GAAG,cAAc,CAAC,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEzD,+DAA+D;IAC/D,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;QAC/B,MAAM,IAAI,KAAK,CAAC,kEAAkE,CAAC,CAAC;IACtF,CAAC;IAED,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC;IAC1B,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAE1B,MAAM,QAAQ,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAE1C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,qBAAqB;IACrB,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAQ,CAAC;IAChC,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,iBAAiB;IACjB,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC/B,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAEnB,gBAAgB;IAChB,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QAC7D,MAAM,SAAS,GAAW,EAAE,CAAC;QAC7B,MAAM,YAAY,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC;QAE1C,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;YAChC,gDAAgD;YAChD,kEAAkE;YAClE,MAAM,SAAS,GAAG,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YAE5C,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC3B,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACzB,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBACxB,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,0BAA0B;YAC1B,MAAM,SAAS,GAAW,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAU,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9E,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACzB,MAAM,IAAI,KAAK,CAAC,iEAAiE,CAAC,CAAC;YACrF,CAAC;YACD,MAAM;QACR,CAAC;QAED,YAAY,EAAE,CAAC;QACf,MAAM,CAAC,YAAY,CAAC,GAAG,SAAS,CAAC;IACnC,CAAC;IAED,iDAAiD;IACjD,OAAO,kBAAkB,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;AACjE,CAAC"}

package/dist/src/layouts/hierarchical/bipartite.d.ts

@@ -1,16 +0,0 @@
-/**
- * Bipartite layout algorithm
- */
-import { Graph, Node, PositionMap } from '../../types';
-/**
- * Position nodes in two straight lines (bipartite layout).
- *
- * @param G - Graph or list of nodes
- * @param nodes - Nodes in one node set of the graph
- * @param align - The alignment of nodes: 'vertical' or 'horizontal'
- * @param scale - Scale factor for positions
- * @param center - Coordinate pair around which to center the layout
- * @param aspectRatio - The ratio of the width to the height of the layout
- * @returns Positions dictionary keyed by node
- */
-export declare function bipartiteLayout(G: Graph, nodes?: Node[] | null, align?: 'vertical' | 'horizontal', scale?: number, center?: number[] | null, aspectRatio?: number): PositionMap;

package/dist/src/layouts/hierarchical/bipartite.js

@@ -1,72 +0,0 @@
-/**
- * Bipartite layout algorithm
- */
-import { _processParams } from '../../utils/params';
-import { getNodesFromGraph } from '../../utils/graph';
-import { rescaleLayout } from '../../utils/rescale';
-/**
- * Position nodes in two straight lines (bipartite layout).
- *
- * @param G - Graph or list of nodes
- * @param nodes - Nodes in one node set of the graph
- * @param align - The alignment of nodes: 'vertical' or 'horizontal'
- * @param scale - Scale factor for positions
- * @param center - Coordinate pair around which to center the layout
- * @param aspectRatio - The ratio of the width to the height of the layout
- * @returns Positions dictionary keyed by node
- */
-export function bipartiteLayout(G, nodes = null, align = 'vertical', scale = 1, center = null, aspectRatio = 4 / 3) {
-    if (align !== 'vertical' && align !== 'horizontal') {
-        throw new Error("align must be either vertical or horizontal");
-    }
-    const processed = _processParams(G, center || [0, 0], 2);
-    const graph = processed.G;
-    center = processed.center;
-    const allNodes = getNodesFromGraph(graph);
-    if (allNodes.length === 0) {
-        return {};
-    }
-    // If nodes not provided, try to determine bipartite sets
-    if (!nodes) {
-        // A simple heuristic for bipartite detection: use nodes with even/odd indices
-        // This is a simplification, in Python NetworkX has bipartite.sets()
-        nodes = allNodes.filter((_, i) => i % 2 === 0);
-    }
-    const left = new Set(nodes);
-    const right = new Set(allNodes.filter((n) => !left.has(n)));
-    const height = 1;
-    const width = aspectRatio * height;
-    const offset = [width / 2, height / 2];
-    const pos = {};
-    // Position nodes in the left set
-    const leftNodes = [...left];
-    leftNodes.forEach((node, i) => {
-        const x = 0;
-        const y = i * height / (leftNodes.length || 1);
-        pos[node] = [x, y];
-    });
-    // Position nodes in the right set
-    const rightNodes = [...right];
-    rightNodes.forEach((node, i) => {
-        const x = width;
-        const y = i * height / (rightNodes.length || 1);
-        pos[node] = [x, y];
-    });
-    // Center positions around the origin and apply offset
-    for (const node in pos) {
-        pos[node][0] -= offset[0];
-        pos[node][1] -= offset[1];
-    }
-    // Rescale positions
-    const scaledPos = rescaleLayout(pos, scale, center);
-    // Handle horizontal alignment
-    if (align === 'horizontal') {
-        for (const node in scaledPos) {
-            const temp = scaledPos[node][0];
-            scaledPos[node][0] = scaledPos[node][1];
-            scaledPos[node][1] = temp;
-        }
-    }
-    return scaledPos;
-}
-//# sourceMappingURL=bipartite.js.map

package/dist/src/layouts/hierarchical/bipartite.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"bipartite.js","sourceRoot":"","sources":["../../../../src/layouts/hierarchical/bipartite.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,OAAO,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AACpD,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAEpD;;;;;;;;;;GAUG;AACH,MAAM,UAAU,eAAe,CAC7B,CAAQ,EACR,QAAuB,IAAI,EAC3B,QAAmC,UAAU,EAC7C,QAAgB,CAAC,EACjB,SAA0B,IAAI,EAC9B,cAAsB,CAAC,GAAG,CAAC;IAE3B,IAAI,KAAK,KAAK,UAAU,IAAI,KAAK,KAAK,YAAY,EAAE,CAAC;QACnD,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;IACjE,CAAC;IAED,MAAM,SAAS,GAAG,cAAc,CAAC,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACzD,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC;IAC1B,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAE1B,MAAM,QAAQ,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAE1C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,yDAAyD;IACzD,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,8EAA8E;QAC9E,oEAAoE;QACpE,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAO,EAAE,CAAS,EAAW,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IACxE,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;IAC5B,MAAM,KAAK,GAAc,IAAI,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAO,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE7E,MAAM,MAAM,GAAG,CAAC,CAAC;IACjB,MAAM,KAAK,GAAG,WAAW,GAAG,MAAM,CAAC;IACnC,MAAM,MAAM,GAAG,CAAC,KAAK,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;IAEvC,MAAM,GAAG,GAAgB,EAAE,CAAC;IAE5B,iCAAiC;IACjC,MAAM,SAAS,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;IAC5B,SAAS,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;QAC5B,MAAM,CAAC,GAAG,CAAC,CAAC;QACZ,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,GAAG,CAAC,SAAS,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;QAC/C,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrB,CAAC,CAAC,CAAC;IAEH,kCAAkC;IAClC,MAAM,UAAU,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;IAC9B,UAAU,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;QAC7B,MAAM,CAAC,GAAG,KAAK,CAAC;QAChB,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,GAAG,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;QAChD,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrB,CAAC,CAAC,CAAC;IAEH,sDAAsD;IACtD,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;QACvB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC;QAC1B,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC;IAED,oBAAoB;IACpB,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,EAAE,KAAK,EAAE,MAAM,CAAgB,CAAC;IAEnE,8BAA8B;IAC9B,IAAI,KAAK,KAAK,YAAY,EAAE,CAAC;QAC3B,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAChC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACxC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QAC5B,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC"}

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

@@ -1,6 +0,0 @@
-/**
- * Hierarchical layout algorithms
- */
-export { bipartiteLayout } from './bipartite';
-export { multipartiteLayout } from './multipartite';
-export { bfsLayout } from './bfs';

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

@@ -1,7 +0,0 @@
-/**
- * Hierarchical layout algorithms
- */
-export { bipartiteLayout } from './bipartite';
-export { multipartiteLayout } from './multipartite';
-export { bfsLayout } from './bfs';
-//# sourceMappingURL=index.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/layouts/hierarchical/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAC9C,OAAO,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AACpD,OAAO,EAAE,SAAS,EAAE,MAAM,OAAO,CAAC"}

package/dist/src/layouts/hierarchical/multipartite.d.ts

@@ -1,12 +0,0 @@
-import type { Graph, Node, PositionMap } from '../../types';
-/**
- * Position nodes in layers of straight lines (multipartite layout).
- *
- * @param G - Graph or list of nodes
- * @param subsetKey - Object mapping layers to node sets, or node attribute name
- * @param align - The alignment of nodes: 'vertical' or 'horizontal'
- * @param scale - Scale factor for positions
- * @param center - Coordinate pair around which to center the layout
- * @returns Positions dictionary keyed by node
- */
-export declare function multipartiteLayout(G: Graph, subsetKey?: Record<number | string, Node | Node[]> | string, align?: 'vertical' | 'horizontal', scale?: number, center?: number[] | null): PositionMap;

package/dist/src/layouts/hierarchical/multipartite.js

@@ -1,73 +0,0 @@
-import { getNodesFromGraph } from '../../utils/graph';
-import { _processParams } from '../../utils/params';
-import { rescaleLayout } from '../../utils/rescale';
-/**
- * Position nodes in layers of straight lines (multipartite layout).
- *
- * @param G - Graph or list of nodes
- * @param subsetKey - Object mapping layers to node sets, or node attribute name
- * @param align - The alignment of nodes: 'vertical' or 'horizontal'
- * @param scale - Scale factor for positions
- * @param center - Coordinate pair around which to center the layout
- * @returns Positions dictionary keyed by node
- */
-export function multipartiteLayout(G, subsetKey = 'subset', align = 'vertical', scale = 1, center = null) {
-    if (align !== 'vertical' && align !== 'horizontal') {
-        throw new Error("align must be either vertical or horizontal");
-    }
-    const processed = _processParams(G, center || [0, 0], 2);
-    const graph = processed.G;
-    center = processed.center;
-    const allNodes = getNodesFromGraph(graph);
-    if (allNodes.length === 0) {
-        return {};
-    }
-    // Convert subsetKey to a layer mapping if it's a string
-    let layers = {};
-    if (typeof subsetKey === 'string') {
-        // In JS we don't have access to node attributes directly
-        // This is a simplification - in a real implementation we would need
-        // to access node attributes from the graph
-        console.warn("Using string subsetKey requires node attributes, using default partitioning");
-        // Create a simple partitioning as fallback
-        layers = { 0: allNodes };
-    }
-    else {
-        // subsetKey is already a mapping of layers to nodes
-        // Convert single nodes to arrays
-        for (const [key, value] of Object.entries(subsetKey)) {
-            if (Array.isArray(value)) {
-                layers[key] = value;
-            }
-            else {
-                layers[key] = [value];
-            }
-        }
-    }
-    const layerCount = Object.keys(layers).length;
-    let pos = {};
-    // Process each layer
-    Object.entries(layers).forEach(([layer, nodes], layerIdx) => {
-        const layerNodes = Array.isArray(nodes) ? nodes : [nodes];
-        const layerSize = layerNodes.length;
-        layerNodes.forEach((node, nodeIdx) => {
-            // Place nodes in a grid: layerIdx determines x-coordinate (column)
-            // nodeIdx determines y-coordinate (row position within column)
-            const x = layerIdx - (layerCount - 1) / 2;
-            const y = nodeIdx - (layerSize - 1) / 2;
-            pos[node] = [x, y];
-        });
-    });
-    // Rescale positions
-    pos = rescaleLayout(pos, scale, center);
-    // Handle horizontal alignment
-    if (align === 'horizontal') {
-        for (const node in pos) {
-            const temp = pos[node][0];
-            pos[node][0] = pos[node][1];
-            pos[node][1] = temp;
-        }
-    }
-    return pos;
-}
-//# sourceMappingURL=multipartite.js.map

package/dist/src/layouts/hierarchical/multipartite.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"multipartite.js","sourceRoot":"","sources":["../../../../src/layouts/hierarchical/multipartite.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,iBAAiB,EAAgB,MAAM,mBAAmB,CAAC;AACpE,OAAO,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AACpD,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAEpD;;;;;;;;;GASG;AACH,MAAM,UAAU,kBAAkB,CAChC,CAAQ,EACR,YAA6D,QAAQ,EACrE,QAAmC,UAAU,EAC7C,QAAgB,CAAC,EACjB,SAA0B,IAAI;IAE9B,IAAI,KAAK,KAAK,UAAU,IAAI,KAAK,KAAK,YAAY,EAAE,CAAC;QACnD,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;IACjE,CAAC;IAED,MAAM,SAAS,GAAG,cAAc,CAAC,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACzD,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC;IAC1B,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAE1B,MAAM,QAAQ,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAE1C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,wDAAwD;IACxD,IAAI,MAAM,GAAoC,EAAE,CAAC;IACjD,IAAI,OAAO,SAAS,KAAK,QAAQ,EAAE,CAAC;QAClC,yDAAyD;QACzD,oEAAoE;QACpE,2CAA2C;QAC3C,OAAO,CAAC,IAAI,CAAC,6EAA6E,CAAC,CAAC;QAC5F,2CAA2C;QAC3C,MAAM,GAAG,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC;IAC3B,CAAC;SAAM,CAAC;QACN,oDAAoD;QACpD,iCAAiC;QACjC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;YACrD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBACzB,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;YACtB,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC;IAC9C,IAAI,GAAG,GAAgB,EAAE,CAAC;IAE1B,qBAAqB;IACrB,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,QAAQ,EAAE,EAAE;QAC1D,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAC1D,MAAM,SAAS,GAAG,UAAU,CAAC,MAAM,CAAC;QAEpC,UAAU,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE;YACnC,mEAAmE;YACnE,+DAA+D;YAC/D,MAAM,CAAC,GAAG,QAAQ,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YAC1C,MAAM,CAAC,GAAG,OAAO,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YACxC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACrB,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,oBAAoB;IACpB,GAAG,GAAG,aAAa,CAAC,GAAG,EAAE,KAAK,EAAE,MAAM,CAAgB,CAAC;IAEvD,8BAA8B;IAC9B,IAAI,KAAK,KAAK,YAAY,EAAE,CAAC;QAC3B,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;YACvB,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1B,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5B,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QACtB,CAAC;IACH,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC"}

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

@@ -1,8 +0,0 @@
-/**
- * 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

@@ -1,9 +0,0 @@
-/**
- * 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

@@ -1 +0,0 @@
-{"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

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

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

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

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

@@ -1 +0,0 @@
-{"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

@@ -1,14 +0,0 @@
-/**
- * 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

@@ -1,47 +0,0 @@
-/**
- * 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

@@ -1 +0,0 @@
-{"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

@@ -1,14 +0,0 @@
-/**
- * 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

@@ -1,106 +0,0 @@
-/**
- * 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

@@ -1 +0,0 @@
-{"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

@@ -1,9 +0,0 @@
-/**
- * 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

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

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

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

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

@@ -1,10 +0,0 @@
-/**
- * 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

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

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

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

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

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

package/dist/src/types/index.js

@@ -1,7 +0,0 @@
-/**
- * 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

@@ -1 +0,0 @@
-{"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

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

package/dist/src/types/layout.js

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

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

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

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

@@ -1,34 +0,0 @@
-/**
- * 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[];