@graphty/algorithms 1.2.0 → 1.3.1

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

@@ -53,6 +53,12 @@ export interface TraversalOptions {
 }
 export interface DijkstraOptions {
     target?: NodeId;
+    /**
+     * Use bidirectional search optimization for point-to-point queries.
+     * Defaults to true for graphs with >10 nodes, false for smaller graphs.
+     * Set explicitly to override automatic heuristic.
+     */
+    bidirectional?: boolean;
 }
 export interface BellmanFordResult {
     distances: Map<NodeId, number>;
@@ -75,9 +81,11 @@ export interface LouvainOptions {
     resolution?: number;
     maxIterations?: number;
     tolerance?: number;
+    useOptimized?: boolean;
 }
 export interface GirvanNewmanOptions {
     maxCommunities?: number;
     minCommunitySize?: number;
+    maxIterations?: number;
 }
 //# sourceMappingURL=index.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/types/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,MAAM,MAAM,MAAM,GAAG,MAAM,GAAG,MAAM,CAAC;AAGrC,MAAM,WAAW,IAAI;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,CAAC;CAC9C;AAGD,MAAM,WAAW,IAAI;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,CAAC;CAC9C;AAGD,MAAM,WAAW,WAAW;IACxB,QAAQ,EAAE,OAAO,CAAC;IAClB,cAAc,EAAE,OAAO,CAAC;IACxB,kBAAkB,EAAE,OAAO,CAAC;CAC/B;AAGD,MAAM,WAAW,kBAAkB;IAC/B,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC;CAC3C;AAED,MAAM,MAAM,gBAAgB,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAEtD,MAAM,WAAW,eAAe;IAC5B,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACrB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,IAAI,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC;CACrC;AAED,MAAM,WAAW,eAAe;IAC5B,WAAW,EAAE,MAAM,EAAE,EAAE,CAAC;IACxB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,eAAe;IAC5B,UAAU,EAAE,MAAM,EAAE,EAAE,CAAC;IACvB,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACrC;AAED,MAAM,WAAW,SAAS;IACtB,KAAK,EAAE,IAAI,EAAE,CAAC;IACd,WAAW,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,mBAAmB;IAChC,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC5C,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC;IACtD,gBAAgB,EAAE,OAAO,CAAC;CAC7B;AAGD,MAAM,WAAW,gBAAgB;IAC7B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,aAAa,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,KAAK,IAAI,CAAC;CACzD;AAED,MAAM,WAAW,eAAe;IAC5B,MAAM,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,iBAAiB;IAC9B,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/B,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC;IACrC,gBAAgB,EAAE,OAAO,CAAC;IAC1B,kBAAkB,CAAC,EAAE,MAAM,EAAE,CAAC;CACjC;AAED,MAAM,WAAW,iBAAiB;IAC9B,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,IAAI,CAAC,EAAE,IAAI,GAAG,KAAK,GAAG,OAAO,CAAC;CACjC;AAED,MAAM,WAAW,eAAe;IAC5B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,eAAe,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACzC;AAED,MAAM,WAAW,cAAc;IAC3B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,SAAS,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,mBAAmB;IAChC,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,gBAAgB,CAAC,EAAE,MAAM,CAAC;CAC7B"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/types/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,MAAM,MAAM,MAAM,GAAG,MAAM,GAAG,MAAM,CAAC;AAGrC,MAAM,WAAW,IAAI;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,CAAC;CAC9C;AAGD,MAAM,WAAW,IAAI;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,CAAC;CAC9C;AAGD,MAAM,WAAW,WAAW;IACxB,QAAQ,EAAE,OAAO,CAAC;IAClB,cAAc,EAAE,OAAO,CAAC;IACxB,kBAAkB,EAAE,OAAO,CAAC;CAC/B;AAGD,MAAM,WAAW,kBAAkB;IAC/B,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC;CAC3C;AAED,MAAM,MAAM,gBAAgB,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAEtD,MAAM,WAAW,eAAe;IAC5B,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACrB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,IAAI,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC;CACrC;AAED,MAAM,WAAW,eAAe;IAC5B,WAAW,EAAE,MAAM,EAAE,EAAE,CAAC;IACxB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,eAAe;IAC5B,UAAU,EAAE,MAAM,EAAE,EAAE,CAAC;IACvB,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACrC;AAED,MAAM,WAAW,SAAS;IACtB,KAAK,EAAE,IAAI,EAAE,CAAC;IACd,WAAW,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,mBAAmB;IAChC,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC5C,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC;IACtD,gBAAgB,EAAE,OAAO,CAAC;CAC7B;AAGD,MAAM,WAAW,gBAAgB;IAC7B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,aAAa,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,KAAK,IAAI,CAAC;CACzD;AAED,MAAM,WAAW,eAAe;IAC5B,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB;;;;OAIG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;CAC3B;AAED,MAAM,WAAW,iBAAiB;IAC9B,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/B,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC;IACrC,gBAAgB,EAAE,OAAO,CAAC;IAC1B,kBAAkB,CAAC,EAAE,MAAM,EAAE,CAAC;CACjC;AAED,MAAM,WAAW,iBAAiB;IAC9B,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,IAAI,CAAC,EAAE,IAAI,GAAG,KAAK,GAAG,OAAO,CAAC;CACjC;AAED,MAAM,WAAW,eAAe;IAC5B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,eAAe,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACzC;AAED,MAAM,WAAW,cAAc;IAC3B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,YAAY,CAAC,EAAE,OAAO,CAAC;CAC1B;AAED,MAAM,WAAW,mBAAmB;IAChC,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,aAAa,CAAC,EAAE,MAAM,CAAC;CAC1B"}

package/dist/src/utils/algorithm-utilities.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=algorithm-utilities.d.ts.map

package/dist/src/utils/algorithm-utilities.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"algorithm-utilities.d.ts","sourceRoot":"","sources":["../../../src/utils/algorithm-utilities.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,CAAC"}

package/dist/src/utils/algorithm-utilities.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=algorithm-utilities.js.map

package/dist/src/utils/algorithm-utilities.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"algorithm-utilities.js","sourceRoot":"","sources":["../../../src/utils/algorithm-utilities.ts"],"names":[],"mappings":""}

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

@@ -0,0 +1,79 @@
+import { Graph } from "../core/graph.js";
+import type { NodeId } from "../types/index.js";
+/**
+ * Convert Graph class to Map representation
+ * Used by community detection and flow algorithms
+ */
+export declare function graphToMap(graph: Graph): Map<string, Map<string, number>>;
+/**
+ * Convert Map representation to Graph class
+ */
+export declare function mapToGraph(map: Map<string, Map<string, number>>, isDirected?: boolean): Graph;
+/**
+ * Adapter for using Graph algorithms with Map representation
+ * Implements a subset of Graph interface methods needed by algorithms
+ */
+export declare class GraphAdapter {
+    private map;
+    readonly isDirected: boolean;
+    constructor(map: Map<string, Map<string, number>>, isDirected?: boolean);
+    /**
+     * Get all nodes
+     */
+    nodes(): {
+        id: NodeId;
+    }[];
+    /**
+     * Get node count
+     */
+    get nodeCount(): number;
+    /**
+     * Check if node exists
+     */
+    hasNode(nodeId: NodeId): boolean;
+    /**
+     * Get neighbors of a node
+     */
+    neighbors(nodeId: NodeId): NodeId[];
+    /**
+     * Get edge between two nodes
+     */
+    getEdge(source: NodeId, target: NodeId): {
+        source: NodeId;
+        target: NodeId;
+        weight?: number;
+    } | null;
+    /**
+     * Check if edge exists
+     */
+    hasEdge(source: NodeId, target: NodeId): boolean;
+    /**
+     * Get all edges
+     */
+    edges(): {
+        source: NodeId;
+        target: NodeId;
+        weight?: number;
+    }[];
+    /**
+     * Get edge count
+     */
+    get edgeCount(): number;
+    /**
+     * Get node degree
+     */
+    degree(nodeId: NodeId): number;
+    /**
+     * Get in-degree (for directed graphs)
+     */
+    inDegree(nodeId: NodeId): number;
+    /**
+     * Get out-degree (for directed graphs)
+     */
+    outDegree(nodeId: NodeId): number;
+    /**
+     * Get underlying map representation
+     */
+    getMap(): Map<string, Map<string, number>>;
+}
+//# sourceMappingURL=graph-converters.d.ts.map

package/dist/src/utils/graph-converters.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-converters.d.ts","sourceRoot":"","sources":["../../../src/utils/graph-converters.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,KAAK,EAAC,MAAM,kBAAkB,CAAC;AACvC,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,mBAAmB,CAAC;AAE9C;;;GAGG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,KAAK,GAAG,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CA6BzE;AAED;;GAEG;AACH,wBAAgB,UAAU,CACtB,GAAG,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EACrC,UAAU,UAAO,GAClB,KAAK,CA0BP;AAED;;;GAGG;AACH,qBAAa,YAAY;IACrB,OAAO,CAAC,GAAG,CAAmC;IAC9C,SAAgB,UAAU,EAAE,OAAO,CAAC;gBAExB,GAAG,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAAE,UAAU,UAAO;IAKpE;;OAEG;IACH,KAAK,IAAI;QAAC,EAAE,EAAE,MAAM,CAAA;KAAC,EAAE;IAIvB;;OAEG;IACH,IAAI,SAAS,IAAI,MAAM,CAEtB;IAED;;OAEG;IACH,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO;IAIhC;;OAEG;IACH,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE;IASnC;;OAEG;IACH,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,CAAA;KAAC,GAAG,IAAI;IAcjG;;OAEG;IACH,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO;IAShD;;OAEG;IACH,KAAK,IAAI;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,CAAA;KAAC,EAAE;IAqB5D;;OAEG;IACH,IAAI,SAAS,IAAI,MAAM,CAuBtB;IAED;;OAEG;IACH,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IAK9B;;OAEG;IACH,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IAiBhC;;OAEG;IACH,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IAIjC;;OAEG;IACH,MAAM,IAAI,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAG7C"}

package/dist/src/utils/graph-converters.js

@@ -0,0 +1,196 @@
+import { Graph } from "../core/graph.js";
+/**
+ * Convert Graph class to Map representation
+ * Used by community detection and flow algorithms
+ */
+export function graphToMap(graph) {
+    const map = new Map();
+    // Initialize all nodes
+    for (const node of graph.nodes()) {
+        map.set(String(node.id), new Map());
+    }
+    // Add edges with weights
+    for (const edge of graph.edges()) {
+        const source = String(edge.source);
+        const target = String(edge.target);
+        const weight = edge.weight ?? 1;
+        const sourceMap = map.get(source);
+        if (sourceMap) {
+            sourceMap.set(target, weight);
+        }
+        // For undirected graphs, add reverse edge
+        if (!graph.isDirected) {
+            const targetMap = map.get(target);
+            if (targetMap) {
+                targetMap.set(source, weight);
+            }
+        }
+    }
+    return map;
+}
+/**
+ * Convert Map representation to Graph class
+ */
+export function mapToGraph(map, isDirected = true) {
+    const graph = new Graph({ directed: isDirected });
+    // Add all nodes first
+    for (const node of map.keys()) {
+        graph.addNode(node);
+    }
+    // Add edges
+    const processedEdges = new Set();
+    for (const [source, neighbors] of map) {
+        for (const [target, weight] of neighbors) {
+            const edgeKey = isDirected ? `${source}->${target}` : [source, target].sort().join("-");
+            // Skip if we've already processed this edge (for undirected graphs)
+            if (!isDirected && processedEdges.has(edgeKey)) {
+                continue;
+            }
+            graph.addEdge(source, target, weight);
+            processedEdges.add(edgeKey);
+        }
+    }
+    return graph;
+}
+/**
+ * Adapter for using Graph algorithms with Map representation
+ * Implements a subset of Graph interface methods needed by algorithms
+ */
+export class GraphAdapter {
+    constructor(map, isDirected = true) {
+        this.map = map;
+        this.isDirected = isDirected;
+    }
+    /**
+     * Get all nodes
+     */
+    nodes() {
+        return Array.from(this.map.keys()).map((id) => ({ id }));
+    }
+    /**
+     * Get node count
+     */
+    get nodeCount() {
+        return this.map.size;
+    }
+    /**
+     * Check if node exists
+     */
+    hasNode(nodeId) {
+        return this.map.has(String(nodeId));
+    }
+    /**
+     * Get neighbors of a node
+     */
+    neighbors(nodeId) {
+        const neighbors = this.map.get(String(nodeId));
+        if (!neighbors) {
+            return [];
+        }
+        return Array.from(neighbors.keys());
+    }
+    /**
+     * Get edge between two nodes
+     */
+    getEdge(source, target) {
+        const sourceNeighbors = this.map.get(String(source));
+        if (!sourceNeighbors) {
+            return null;
+        }
+        const weight = sourceNeighbors.get(String(target));
+        if (weight === undefined) {
+            return null;
+        }
+        return { source, target, weight };
+    }
+    /**
+     * Check if edge exists
+     */
+    hasEdge(source, target) {
+        const sourceNeighbors = this.map.get(String(source));
+        if (!sourceNeighbors) {
+            return false;
+        }
+        return sourceNeighbors.has(String(target));
+    }
+    /**
+     * Get all edges
+     */
+    edges() {
+        const edges = [];
+        const processedEdges = new Set();
+        for (const [source, neighbors] of this.map) {
+            for (const [target, weight] of neighbors) {
+                const edgeKey = this.isDirected ? `${source}->${target}` : [source, target].sort().join("-");
+                // Skip if we've already processed this edge (for undirected graphs)
+                if (!this.isDirected && processedEdges.has(edgeKey)) {
+                    continue;
+                }
+                edges.push({ source, target, weight });
+                processedEdges.add(edgeKey);
+            }
+        }
+        return edges;
+    }
+    /**
+     * Get edge count
+     */
+    get edgeCount() {
+        if (this.isDirected) {
+            let count = 0;
+            for (const neighbors of this.map.values()) {
+                count += neighbors.size;
+            }
+            return count;
+        }
+        // For undirected graphs, count each edge once
+        let count = 0;
+        const counted = new Set();
+        for (const [source, neighbors] of this.map) {
+            for (const target of neighbors.keys()) {
+                const edgeKey = [source, target].sort().join("-");
+                if (!counted.has(edgeKey)) {
+                    counted.add(edgeKey);
+                    count++;
+                }
+            }
+        }
+        return count;
+    }
+    /**
+     * Get node degree
+     */
+    degree(nodeId) {
+        const neighbors = this.map.get(String(nodeId));
+        return neighbors ? neighbors.size : 0;
+    }
+    /**
+     * Get in-degree (for directed graphs)
+     */
+    inDegree(nodeId) {
+        if (!this.isDirected) {
+            return this.degree(nodeId);
+        }
+        let count = 0;
+        const targetId = String(nodeId);
+        for (const neighbors of this.map.values()) {
+            if (neighbors.has(targetId)) {
+                count++;
+            }
+        }
+        return count;
+    }
+    /**
+     * Get out-degree (for directed graphs)
+     */
+    outDegree(nodeId) {
+        return this.degree(nodeId);
+    }
+    /**
+     * Get underlying map representation
+     */
+    getMap() {
+        return this.map;
+    }
+}
+//# sourceMappingURL=graph-converters.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graph-converters.js","sourceRoot":"","sources":["../../../src/utils/graph-converters.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,KAAK,EAAC,MAAM,kBAAkB,CAAC;AAGvC;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,KAAY;IACnC,MAAM,GAAG,GAAG,IAAI,GAAG,EAA+B,CAAC;IAEnD,uBAAuB;IACvB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC/B,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IACxC,CAAC;IAED,yBAAyB;IACzB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACnC,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACnC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;QAEhC,MAAM,SAAS,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAClC,IAAI,SAAS,EAAE,CAAC;YACZ,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAClC,CAAC;QAED,0CAA0C;QAC1C,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;YACpB,MAAM,SAAS,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAClC,IAAI,SAAS,EAAE,CAAC;gBACZ,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YAClC,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,GAAG,CAAC;AACf,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,UAAU,CACtB,GAAqC,EACrC,UAAU,GAAG,IAAI;IAEjB,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,UAAU,EAAC,CAAC,CAAC;IAEhD,sBAAsB;IACtB,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC;QAC5B,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC;IAED,YAAY;IACZ,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;IAEzC,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,GAAG,EAAE,CAAC;QACpC,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YACvC,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,MAAM,KAAK,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAExF,oEAAoE;YACpE,IAAI,CAAC,UAAU,IAAI,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC7C,SAAS;YACb,CAAC;YAED,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YACtC,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAChC,CAAC;IACL,CAAC;IAED,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;GAGG;AACH,MAAM,OAAO,YAAY;IAIrB,YAAY,GAAqC,EAAE,UAAU,GAAG,IAAI;QAChE,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;IACjC,CAAC;IAED;;OAEG;IACH,KAAK;QACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAC,EAAE,EAAC,CAAC,CAAC,CAAC;IAC3D,CAAC;IAED;;OAEG;IACH,IAAI,SAAS;QACT,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,MAAc;QAClB,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IACxC,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,MAAc;QACpB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QAC/C,IAAI,CAAC,SAAS,EAAE,CAAC;YACb,OAAO,EAAE,CAAC;QACd,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC;IACxC,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,MAAc,EAAE,MAAc;QAClC,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QACrD,IAAI,CAAC,eAAe,EAAE,CAAC;YACnB,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,MAAM,MAAM,GAAG,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QACnD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACvB,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,OAAO,EAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAC,CAAC;IACpC,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,MAAc,EAAE,MAAc;QAClC,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QACrD,IAAI,CAAC,eAAe,EAAE,CAAC;YACnB,OAAO,KAAK,CAAC;QACjB,CAAC;QAED,OAAO,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED;;OAEG;IACH,KAAK;QACD,MAAM,KAAK,GAAwD,EAAE,CAAC;QACtE,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QAEzC,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;YACzC,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;gBACvC,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,MAAM,KAAK,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAE7F,oEAAoE;gBACpE,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;oBAClD,SAAS;gBACb,CAAC;gBAED,KAAK,CAAC,IAAI,CAAC,EAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAC,CAAC,CAAC;gBACrC,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAChC,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,IAAI,SAAS;QACT,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YAClB,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC;gBACxC,KAAK,IAAI,SAAS,CAAC,IAAI,CAAC;YAC5B,CAAC;YACD,OAAO,KAAK,CAAC;QACjB,CAAC;QAED,8CAA8C;QAC9C,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;YACzC,KAAK,MAAM,MAAM,IAAI,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC;gBACpC,MAAM,OAAO,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAClD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;oBACxB,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;oBACrB,KAAK,EAAE,CAAC;gBACZ,CAAC;YACL,CAAC;QACL,CAAC;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,MAAc;QACjB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QAC/C,OAAO,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,MAAc;QACnB,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YACnB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC/B,CAAC;QAED,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QAEhC,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC;YACxC,IAAI,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC1B,KAAK,EAAE,CAAC;YACZ,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,MAAc;QACpB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,MAAM;QACF,OAAO,IAAI,CAAC,GAAG,CAAC;IACpB,CAAC;CACJ"}

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

@@ -0,0 +1,62 @@
+import { Graph } from "../core/graph.js";
+import type { NodeId } from "../types/index.js";
+/**
+ * Reconstructs a path from source to target using a predecessor map
+ * @param target - The target node
+ * @param predecessor - Map of node to its predecessor in the path
+ * @returns Array of nodes from source to target, or empty array if no path exists
+ */
+export declare function reconstructPath<T>(target: T, predecessor: Map<T, T | null>): T[];
+/**
+ * Find common neighbors between two nodes
+ * @param graph - The graph
+ * @param source - First node
+ * @param target - Second node
+ * @param directed - Whether to consider edge direction
+ * @returns Set of common neighbor node IDs
+ */
+export declare function getCommonNeighbors(graph: Graph, source: NodeId, target: NodeId, directed?: boolean): Set<NodeId>;
+/**
+ * Find common neighbors for link prediction in directed graphs
+ * This finds nodes that form a path from source to target (source->X->target)
+ * @param graph - The graph
+ * @param source - First node
+ * @param target - Second node
+ * @returns Set of intermediate node IDs
+ */
+export declare function getIntermediateNodes(graph: Graph, source: NodeId, target: NodeId): Set<NodeId>;
+/**
+ * Generate a consistent edge key for undirected graphs
+ * @param source - Source node
+ * @param target - Target node
+ * @param isDirected - Whether the graph is directed
+ * @returns A consistent edge identifier
+ */
+export declare function getEdgeKey(source: NodeId, target: NodeId, isDirected: boolean): string;
+/**
+ * Calculate total edge weight in a graph
+ * @param graph - The graph
+ * @returns Total weight of all edges
+ */
+export declare function getTotalEdgeWeight(graph: Graph): number;
+/**
+ * Get node degree with optional mode for directed graphs
+ * @param graph - The graph
+ * @param nodeId - The node ID
+ * @param mode - Degree mode for directed graphs
+ * @returns Node degree
+ */
+export declare function getNodeDegree(graph: Graph, nodeId: NodeId, mode?: "in" | "out" | "total"): number;
+/**
+ * Convert directed graph to undirected
+ * @param graph - The directed graph
+ * @returns A new undirected graph
+ */
+export declare function makeUndirected(graph: Graph): Graph;
+/**
+ * Renumber communities consecutively starting from 0
+ * @param communities - Map of node to community ID
+ * @returns Map with renumbered community IDs
+ */
+export declare function renumberCommunities<T>(communities: Map<T, number>): Map<T, number>;
+//# sourceMappingURL=graph-utilities.d.ts.map

package/dist/src/utils/graph-utilities.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-utilities.d.ts","sourceRoot":"","sources":["../../../src/utils/graph-utilities.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,KAAK,EAAC,MAAM,kBAAkB,CAAC;AACvC,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,mBAAmB,CAAC;AAE9C;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAC7B,MAAM,EAAE,CAAC,EACT,WAAW,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAC9B,CAAC,EAAE,CAiBL;AAED;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CAC9B,KAAK,EAAE,KAAK,EACZ,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,QAAQ,UAAQ,GACjB,GAAG,CAAC,MAAM,CAAC,CAgBb;AAED;;;;;;;GAOG;AACH,wBAAgB,oBAAoB,CAChC,KAAK,EAAE,KAAK,EACZ,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,GACf,GAAG,CAAC,MAAM,CAAC,CAYb;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CACtB,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,OAAO,GACpB,MAAM,CAQR;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,CAMvD;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CACzB,KAAK,EAAE,KAAK,EACZ,MAAM,EAAE,MAAM,EACd,IAAI,GAAE,IAAI,GAAG,KAAK,GAAG,OAAiB,GACvC,MAAM,CAUR;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,KAAK,GAAG,KAAK,CAqBlD;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EACjC,WAAW,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,GAC5B,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAkBhB"}

package/dist/src/utils/graph-utilities.js

@@ -0,0 +1,148 @@
+import { Graph } from "../core/graph.js";
+/**
+ * Reconstructs a path from source to target using a predecessor map
+ * @param target - The target node
+ * @param predecessor - Map of node to its predecessor in the path
+ * @returns Array of nodes from source to target, or empty array if no path exists
+ */
+export function reconstructPath(target, predecessor) {
+    const path = [];
+    let current = target;
+    // Build path backwards from target to source
+    while (current !== null) {
+        path.unshift(current);
+        const pred = predecessor.get(current);
+        if (pred === undefined) {
+            // No path exists
+            return [];
+        }
+        current = pred;
+    }
+    return path;
+}
+/**
+ * Find common neighbors between two nodes
+ * @param graph - The graph
+ * @param source - First node
+ * @param target - Second node
+ * @param directed - Whether to consider edge direction
+ * @returns Set of common neighbor node IDs
+ */
+export function getCommonNeighbors(graph, source, target, directed = false) {
+    const sourceNeighbors = new Set(directed ? graph.outNeighbors(source) : graph.neighbors(source));
+    const targetNeighbors = new Set(directed ? graph.outNeighbors(target) : graph.neighbors(target));
+    const common = new Set();
+    for (const neighbor of sourceNeighbors) {
+        if (targetNeighbors.has(neighbor)) {
+            common.add(neighbor);
+        }
+    }
+    return common;
+}
+/**
+ * Find common neighbors for link prediction in directed graphs
+ * This finds nodes that form a path from source to target (source->X->target)
+ * @param graph - The graph
+ * @param source - First node
+ * @param target - Second node
+ * @returns Set of intermediate node IDs
+ */
+export function getIntermediateNodes(graph, source, target) {
+    const sourceOutNeighbors = new Set(graph.outNeighbors(source));
+    const targetInNeighbors = new Set(graph.inNeighbors(target));
+    const common = new Set();
+    for (const neighbor of sourceOutNeighbors) {
+        if (targetInNeighbors.has(neighbor)) {
+            common.add(neighbor);
+        }
+    }
+    return common;
+}
+/**
+ * Generate a consistent edge key for undirected graphs
+ * @param source - Source node
+ * @param target - Target node
+ * @param isDirected - Whether the graph is directed
+ * @returns A consistent edge identifier
+ */
+export function getEdgeKey(source, target, isDirected) {
+    if (isDirected) {
+        return `${String(source)}->${String(target)}`;
+    }
+    // For undirected graphs, sort to ensure consistency
+    const [first, second] = source < target ? [source, target] : [target, source];
+    return `${String(first)}-${String(second)}`;
+}
+/**
+ * Calculate total edge weight in a graph
+ * @param graph - The graph
+ * @returns Total weight of all edges
+ */
+export function getTotalEdgeWeight(graph) {
+    let totalWeight = 0;
+    for (const edge of graph.edges()) {
+        totalWeight += edge.weight ?? 1;
+    }
+    return graph.isDirected ? totalWeight : totalWeight / 2;
+}
+/**
+ * Get node degree with optional mode for directed graphs
+ * @param graph - The graph
+ * @param nodeId - The node ID
+ * @param mode - Degree mode for directed graphs
+ * @returns Node degree
+ */
+export function getNodeDegree(graph, nodeId, mode = "total") {
+    if (!graph.isDirected || mode === "total") {
+        return graph.degree(nodeId);
+    }
+    if (mode === "in") {
+        return graph.inDegree(nodeId);
+    }
+    return graph.outDegree(nodeId);
+}
+/**
+ * Convert directed graph to undirected
+ * @param graph - The directed graph
+ * @returns A new undirected graph
+ */
+export function makeUndirected(graph) {
+    if (!graph.isDirected) {
+        return graph;
+    }
+    const undirected = new Graph({ directed: false });
+    // Add all nodes
+    for (const node of graph.nodes()) {
+        undirected.addNode(node.id, node.data);
+    }
+    // Add edges (will automatically be made bidirectional)
+    for (const edge of graph.edges()) {
+        // For undirected, we only add each edge once
+        if (!undirected.hasEdge(edge.source, edge.target)) {
+            undirected.addEdge(edge.source, edge.target, edge.weight, edge.data);
+        }
+    }
+    return undirected;
+}
+/**
+ * Renumber communities consecutively starting from 0
+ * @param communities - Map of node to community ID
+ * @returns Map with renumbered community IDs
+ */
+export function renumberCommunities(communities) {
+    const uniqueCommunities = new Set(communities.values());
+    const remapping = new Map();
+    let newId = 0;
+    for (const community of uniqueCommunities) {
+        remapping.set(community, newId++);
+    }
+    const renumbered = new Map();
+    for (const [node, community] of communities) {
+        const newCommunity = remapping.get(community);
+        if (newCommunity !== undefined) {
+            renumbered.set(node, newCommunity);
+        }
+    }
+    return renumbered;
+}
+//# sourceMappingURL=graph-utilities.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graph-utilities.js","sourceRoot":"","sources":["../../../src/utils/graph-utilities.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,KAAK,EAAC,MAAM,kBAAkB,CAAC;AAGvC;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAC3B,MAAS,EACT,WAA6B;IAE7B,MAAM,IAAI,GAAQ,EAAE,CAAC;IACrB,IAAI,OAAO,GAAa,MAAM,CAAC;IAE/B,6CAA6C;IAC7C,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;QACtB,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACtB,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACtC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACrB,iBAAiB;YACjB,OAAO,EAAE,CAAC;QACd,CAAC;QAED,OAAO,GAAG,IAAI,CAAC;IACnB,CAAC;IAED,OAAO,IAAI,CAAC;AAChB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,kBAAkB,CAC9B,KAAY,EACZ,MAAc,EACd,MAAc,EACd,QAAQ,GAAG,KAAK;IAEhB,MAAM,eAAe,GAAG,IAAI,GAAG,CAC3B,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAClE,CAAC;IACF,MAAM,eAAe,GAAG,IAAI,GAAG,CAC3B,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAClE,CAAC;IAEF,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;QACrC,IAAI,eAAe,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACzB,CAAC;IACL,CAAC;IAED,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,oBAAoB,CAChC,KAAY,EACZ,MAAc,EACd,MAAc;IAEd,MAAM,kBAAkB,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC;IAC/D,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC;IAE7D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,KAAK,MAAM,QAAQ,IAAI,kBAAkB,EAAE,CAAC;QACxC,IAAI,iBAAiB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAClC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACzB,CAAC;IACL,CAAC;IAED,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CACtB,MAAc,EACd,MAAc,EACd,UAAmB;IAEnB,IAAI,UAAU,EAAE,CAAC;QACb,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;IAClD,CAAC;IAED,oDAAoD;IACpD,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC9E,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;AAChD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAY;IAC3C,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC/B,WAAW,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC;AAC5D,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CACzB,KAAY,EACZ,MAAc,EACd,OAA+B,OAAO;IAEtC,IAAI,CAAC,KAAK,CAAC,UAAU,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;QACxC,OAAO,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAChC,CAAC;IAED,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;QAChB,OAAO,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAClC,CAAC;IAED,OAAO,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;AACnC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,KAAY;IACvC,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;QACpB,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,KAAK,EAAC,CAAC,CAAC;IAEhD,gBAAgB;IAChB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC/B,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3C,CAAC;IAED,uDAAuD;IACvD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC/B,6CAA6C;QAC7C,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAChD,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACzE,CAAC;IACL,CAAC;IAED,OAAO,UAAU,CAAC;AACtB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CAC/B,WAA2B;IAE3B,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;IACxD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,KAAK,MAAM,SAAS,IAAI,iBAAiB,EAAE,CAAC;QACxC,SAAS,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;IACtC,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,GAAG,EAAa,CAAC;IACxC,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,WAAW,EAAE,CAAC;QAC1C,MAAM,YAAY,GAAG,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC9C,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;YAC7B,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;QACvC,CAAC;IACL,CAAC;IAED,OAAO,UAAU,CAAC;AACtB,CAAC"}

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

@@ -0,0 +1,5 @@
+export * from "./algorithm-utilities.js";
+export * from "./graph-utilities.js";
+export * from "./math-utilities.js";
+export * from "./matrix-utilities.js";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/utils/index.ts"],"names":[],"mappings":"AAAA,cAAc,0BAA0B,CAAC;AACzC,cAAc,sBAAsB,CAAC;AACrC,cAAc,qBAAqB,CAAC;AACpC,cAAc,uBAAuB,CAAC"}

package/dist/src/utils/index.js

@@ -0,0 +1,5 @@
+export * from "./algorithm-utilities.js";
+export * from "./graph-utilities.js";
+export * from "./math-utilities.js";
+export * from "./matrix-utilities.js";
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/utils/index.ts"],"names":[],"mappings":"AAAA,cAAc,0BAA0B,CAAC;AACzC,cAAc,sBAAsB,CAAC;AACrC,cAAc,qBAAqB,CAAC;AACpC,cAAc,uBAAuB,CAAC"}

package/dist/src/utils/math-utilities.d.ts

@@ -0,0 +1,52 @@
+/**
+ * Seeded random number generator for reproducible results
+ */
+export declare class SeededRandom {
+    private seed;
+    private readonly m;
+    private readonly a;
+    private readonly c;
+    constructor(seed: number);
+    /**
+     * Generate next random number between 0 and 1
+     */
+    next(): number;
+    /**
+     * Create a generator function for backward compatibility
+     */
+    static createGenerator(seed: number): () => number;
+}
+/**
+ * Fisher-Yates shuffle algorithm
+ * @param array - Array to shuffle (will be modified in place)
+ * @param rng - Optional random number generator (defaults to Math.random)
+ * @returns The shuffled array (same reference as input)
+ */
+export declare function shuffle<T>(array: T[], rng?: () => number): T[];
+/**
+ * Calculate Euclidean distance between two vectors
+ * @param a - First vector
+ * @param b - Second vector
+ * @returns Euclidean distance
+ * @throws Error if vectors have different lengths
+ */
+export declare function euclideanDistance(a: number[], b: number[]): number;
+export declare const normalize: {
+    /**
+     * Min-max normalization to [0, 1] range
+     */
+    minMax(values: Map<string, number>): void;
+    /**
+     * Normalize by maximum value
+     */
+    byMax(values: Map<string, number>): void;
+    /**
+     * L2 (Euclidean) normalization
+     */
+    l2Norm(values: Map<string, number>): void;
+    /**
+     * Normalize to sum to 1
+     */
+    sumToOne(values: Map<string, number>): void;
+};
+//# sourceMappingURL=math-utilities.d.ts.map

package/dist/src/utils/math-utilities.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"math-utilities.d.ts","sourceRoot":"","sources":["../../../src/utils/math-utilities.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,qBAAa,YAAY;IACrB,OAAO,CAAC,IAAI,CAAS;IACrB,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAc;IAChC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAc;IAChC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAS;gBAEf,IAAI,EAAE,MAAM;IAKxB;;OAEG;IACH,IAAI,IAAI,MAAM;IAKd;;OAEG;IACH,MAAM,CAAC,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,MAAM;CAIrD;AAED;;;;;GAKG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,GAAG,GAAE,MAAM,MAAoB,GAAG,CAAC,EAAE,CAW3E;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAelE;AAED,eAAO,MAAM,SAAS;IAClB;;OAEG;mBACY,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI;IAezC;;OAEG;kBACW,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI;IAWxC;;OAEG;mBACY,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI;IAczC;;OAEG;qBACc,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI;CAY9C,CAAC"}