@graphty/algorithms 1.2.0 → 1.4.2

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

@@ -0,0 +1,227 @@
+import { Graph } from "../core/graph.js";
+/**
+ * Convert Graph class to Map representation
+ * Used by community detection and flow algorithms
+ * @param graph - The Graph instance to convert
+ * @returns A nested Map where outer keys are source nodes and inner maps contain target nodes with edge weights
+ */
+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
+ * @param map - The nested Map representation of the graph
+ * @param isDirected - Whether the resulting graph should be directed (defaults to true)
+ * @returns A new Graph instance with nodes and edges from the map
+ */
+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 {
+    /**
+     * Creates a new GraphAdapter instance wrapping a Map representation.
+     * @param map - The nested Map representation of the graph
+     * @param isDirected - Whether the graph should be treated as directed (defaults to true)
+     */
+    constructor(map, isDirected = true) {
+        this.map = map;
+        this.isDirected = isDirected;
+    }
+    /**
+     * Get all nodes
+     * @returns Array of node objects with their ids
+     */
+    nodes() {
+        return Array.from(this.map.keys()).map((id) => ({ id }));
+    }
+    /**
+     * Get node count
+     * @returns The total number of nodes in the graph
+     */
+    get nodeCount() {
+        return this.map.size;
+    }
+    /**
+     * Check if node exists
+     * @param nodeId - The id of the node to check
+     * @returns True if the node exists, false otherwise
+     */
+    hasNode(nodeId) {
+        return this.map.has(String(nodeId));
+    }
+    /**
+     * Get neighbors of a node
+     * @param nodeId - The id of the node to get neighbors for
+     * @returns Array of neighbor node ids
+     */
+    neighbors(nodeId) {
+        const neighbors = this.map.get(String(nodeId));
+        if (!neighbors) {
+            return [];
+        }
+        return Array.from(neighbors.keys());
+    }
+    /**
+     * Get edge between two nodes
+     * @param source - The source node id
+     * @param target - The target node id
+     * @returns The edge object with source, target and weight, or null if no edge exists
+     */
+    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
+     * @param source - The source node id
+     * @param target - The target node id
+     * @returns True if an edge exists between source and target, false otherwise
+     */
+    hasEdge(source, target) {
+        const sourceNeighbors = this.map.get(String(source));
+        if (!sourceNeighbors) {
+            return false;
+        }
+        return sourceNeighbors.has(String(target));
+    }
+    /**
+     * Get all edges
+     * @returns Array of edge objects with source, target and optional weight
+     */
+    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
+     * @returns The total number of edges in the graph
+     */
+    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
+     * @param nodeId - The id of the node to get degree for
+     * @returns The number of edges connected to the node
+     */
+    degree(nodeId) {
+        const neighbors = this.map.get(String(nodeId));
+        return neighbors ? neighbors.size : 0;
+    }
+    /**
+     * Get in-degree (for directed graphs)
+     * @param nodeId - The id of the node to get in-degree for
+     * @returns The number of incoming edges to the node
+     */
+    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)
+     * @param nodeId - The id of the node to get out-degree for
+     * @returns The number of outgoing edges from the node
+     */
+    outDegree(nodeId) {
+        return this.degree(nodeId);
+    }
+    /**
+     * Get underlying map representation
+     * @returns The internal Map representation of the graph
+     */
+    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,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAGzC;;;;;GAKG;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;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,GAAqC,EAAE,UAAU,GAAG,IAAI;IAC/E,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC,CAAC;IAElD,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;;;;OAIG;IACH,YAAY,GAAqC,EAAE,UAAU,GAAG,IAAI;QAChE,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;IACjC,CAAC;IAED;;;OAGG;IACH,KAAK;QACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IAC7D,CAAC;IAED;;;OAGG;IACH,IAAI,SAAS;QACT,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;IACzB,CAAC;IAED;;;;OAIG;IACH,OAAO,CAAC,MAAc;QAClB,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IACxC,CAAC;IAED;;;;OAIG;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;;;;;OAKG;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,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;IACtC,CAAC;IAED;;;;;OAKG;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;;;OAGG;IACH,KAAK;QACD,MAAM,KAAK,GAA0D,EAAE,CAAC;QACxE,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,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;gBACvC,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAChC,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;OAGG;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;;;;OAIG;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;;;;OAIG;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;;;;OAIG;IACH,SAAS,CAAC,MAAc;QACpB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC/B,CAAC;IAED;;;OAGG;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,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AACzC,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAEhD;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,WAAW,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAiBhF;AAED;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,UAAQ,GAAG,GAAG,CAAC,MAAM,CAAC,CAY9G;AAED;;;;;;;GAOG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAY9F;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,GAAG,MAAM,CAQtF;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,CAMvD;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,GAAE,IAAI,GAAG,KAAK,GAAG,OAAiB,GAAG,MAAM,CAU1G;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,KAAK,GAAG,KAAK,CAqBlD;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,WAAW,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAkBlF"}

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,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAGzC;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAAI,MAAS,EAAE,WAA6B;IACvE,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,CAAC,KAAY,EAAE,MAAc,EAAE,MAAc,EAAE,QAAQ,GAAG,KAAK;IAC7F,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC;IACjG,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC;IAEjG,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,CAAC,KAAY,EAAE,MAAc,EAAE,MAAc;IAC7E,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,CAAC,MAAc,EAAE,MAAc,EAAE,UAAmB;IAC1E,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,CAAC,KAAY,EAAE,MAAc,EAAE,OAA+B,OAAO;IAC9F,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,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;IAElD,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,CAAI,WAA2B;IAC9D,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,63 @@
+/**
+ * Seeded random number generator for reproducible results
+ */
+export declare class SeededRandom {
+    private seed;
+    private readonly m;
+    private readonly a;
+    private readonly c;
+    /**
+     * Creates a new SeededRandom instance with the given seed.
+     * @param seed - The seed value for reproducible random number generation
+     */
+    constructor(seed: number);
+    /**
+     * Generate next random number between 0 and 1
+     * @returns A pseudo-random number in the range [0, 1]
+     */
+    next(): number;
+    /**
+     * Create a generator function for backward compatibility
+     * @param seed - The seed value for reproducible random number generation
+     * @returns A function that returns the next random number when called
+     */
+    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
+     * @param values - Map of values to normalize in place
+     */
+    minMax(values: Map<string, number>): void;
+    /**
+     * Normalize by maximum value
+     * @param values - Map of values to normalize in place
+     */
+    byMax(values: Map<string, number>): void;
+    /**
+     * L2 (Euclidean) normalization
+     * @param values - Map of values to normalize in place
+     */
+    l2Norm(values: Map<string, number>): void;
+    /**
+     * Normalize to sum to 1
+     * @param values - Map of values to normalize in place
+     */
+    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;IAE3B;;;OAGG;gBACS,IAAI,EAAE,MAAM;IAKxB;;;OAGG;IACH,IAAI,IAAI,MAAM;IAKd;;;;OAIG;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;;;OAGG;mBACY,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI;IAezC;;;OAGG;kBACW,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI;IAWxC;;;OAGG;mBACY,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI;IAazC;;;OAGG;qBACc,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI;CAW9C,CAAC"}

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

@@ -0,0 +1,132 @@
+/**
+ * Seeded random number generator for reproducible results
+ */
+export class SeededRandom {
+    /**
+     * Creates a new SeededRandom instance with the given seed.
+     * @param seed - The seed value for reproducible random number generation
+     */
+    constructor(seed) {
+        this.m = 0x80000000; // 2**31
+        this.a = 1103515245;
+        this.c = 12345;
+        // Handle negative seeds correctly
+        this.seed = ((seed % this.m) + this.m) % this.m;
+    }
+    /**
+     * Generate next random number between 0 and 1
+     * @returns A pseudo-random number in the range [0, 1]
+     */
+    next() {
+        this.seed = (this.a * this.seed + this.c) % this.m;
+        return this.seed / (this.m - 1);
+    }
+    /**
+     * Create a generator function for backward compatibility
+     * @param seed - The seed value for reproducible random number generation
+     * @returns A function that returns the next random number when called
+     */
+    static createGenerator(seed) {
+        const rng = new SeededRandom(seed);
+        return () => rng.next();
+    }
+}
+/**
+ * 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 function shuffle(array, rng = Math.random) {
+    for (let i = array.length - 1; i > 0; i--) {
+        const j = Math.floor(rng() * (i + 1));
+        const temp = array[i];
+        const tempJ = array[j];
+        if (temp !== undefined && tempJ !== undefined) {
+            array[i] = tempJ;
+            array[j] = temp;
+        }
+    }
+    return array;
+}
+/**
+ * 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 function euclideanDistance(a, b) {
+    if (a.length !== b.length) {
+        throw new Error("Vectors must have same length");
+    }
+    let sum = 0;
+    for (let i = 0; i < a.length; i++) {
+        const aVal = a[i];
+        const bVal = b[i];
+        if (aVal !== undefined && bVal !== undefined) {
+            const diff = aVal - bVal;
+            sum += diff * diff;
+        }
+    }
+    return Math.sqrt(sum);
+}
+export const normalize = {
+    /**
+     * Min-max normalization to [0, 1] range
+     * @param values - Map of values to normalize in place
+     */
+    minMax(values) {
+        const vals = Array.from(values.values());
+        const min = Math.min(...vals);
+        const max = Math.max(...vals);
+        const range = max - min;
+        if (range === 0) {
+            return;
+        }
+        for (const [key, value] of values) {
+            values.set(key, (value - min) / range);
+        }
+    },
+    /**
+     * Normalize by maximum value
+     * @param values - Map of values to normalize in place
+     */
+    byMax(values) {
+        const max = Math.max(...values.values());
+        if (max === 0) {
+            return;
+        }
+        for (const [key, value] of values) {
+            values.set(key, value / max);
+        }
+    },
+    /**
+     * L2 (Euclidean) normalization
+     * @param values - Map of values to normalize in place
+     */
+    l2Norm(values) {
+        const sumSquares = Array.from(values.values()).reduce((sum, val) => sum + val * val, 0);
+        const norm = Math.sqrt(sumSquares);
+        if (norm === 0) {
+            return;
+        }
+        for (const [key, value] of values) {
+            values.set(key, value / norm);
+        }
+    },
+    /**
+     * Normalize to sum to 1
+     * @param values - Map of values to normalize in place
+     */
+    sumToOne(values) {
+        const sum = Array.from(values.values()).reduce((acc, val) => acc + val, 0);
+        if (sum === 0) {
+            return;
+        }
+        for (const [key, value] of values) {
+            values.set(key, value / sum);
+        }
+    },
+};
+//# sourceMappingURL=math-utilities.js.map