@graphty/algorithms 1.2.0 → 1.4.2

package/dist/src/optimized/direction-optimized-bfs.js

@@ -0,0 +1,242 @@
+import { CompactDistanceArray, GraphBitSet } from "./bit-packed.js";
+/**
+ * Direction-Optimized Breadth-First Search
+ *
+ * Dynamically switches between top-down and bottom-up search strategies
+ * based on the size of the frontier. Particularly effective for low-diameter
+ * graphs like social networks.
+ *
+ * Based on: Beamer, S., Asanović, K., & Patterson, D. (2012).
+ * "Direction-optimizing breadth-first search." SC'12.
+ */
+export class DirectionOptimizedBFS {
+    /**
+     * Creates a new DirectionOptimizedBFS instance.
+     * @param graph - The CSR graph to perform BFS on
+     * @param options - Optional configuration for switching thresholds
+     */
+    constructor(graph, options) {
+        this.graph = graph;
+        this.alpha = options?.alpha ?? 15;
+        this.beta = options?.beta ?? 18;
+        const nodeCount = graph.nodeCount();
+        this.parent = new Int32Array(nodeCount).fill(-1);
+        this.frontier = new GraphBitSet(nodeCount);
+        this.nextFrontier = new GraphBitSet(nodeCount);
+        this.distances = new CompactDistanceArray(nodeCount);
+    }
+    /**
+     * Perform BFS from a single source node.
+     * @param source - The source node ID to start the BFS from
+     * @returns The BFS result containing distances and parent pointers
+     */
+    search(source) {
+        const sourceIndex = this.graph.nodeToIndex(source);
+        this.parent[sourceIndex] = -2; // Mark as source
+        this.frontier.add(sourceIndex);
+        this.distances.set(sourceIndex, 0);
+        // let currentDistance = 0; // Variable not used
+        // Initialize edgesToCheck to total edges to prevent immediate switch to bottom-up
+        let edgesToCheck = this.graph.edgeCount();
+        let scoutCount = 0; // Will be set after first top-down step
+        let awakeCount = 1; // Number of nodes in current frontier
+        let oldAwakeCount = 0;
+        // Direction tracking
+        let useBottomUp = false;
+        while (!this.frontier.isEmpty()) {
+            oldAwakeCount = awakeCount;
+            if (useBottomUp) {
+                // Check if we should switch back to top-down
+                if (awakeCount >= oldAwakeCount || awakeCount > this.graph.nodeCount() / this.beta) {
+                    useBottomUp = false;
+                }
+            }
+            else {
+                // Check if we should switch to bottom-up
+                if (scoutCount > edgesToCheck / this.alpha) {
+                    useBottomUp = true;
+                }
+            }
+            if (useBottomUp) {
+                awakeCount = this.bottomUpStep();
+            }
+            else {
+                scoutCount = this.topDownStep();
+                awakeCount = this.nextFrontier.size();
+            }
+            // Swap frontiers
+            this.frontier.swap(this.nextFrontier);
+            this.nextFrontier.clear();
+            // currentDistance++; // Variable not used
+            edgesToCheck = this.calculateEdgesToCheck();
+        }
+        return this.buildResult();
+    }
+    /**
+     * Top-down BFS step - explore from frontier.
+     * @returns The scout count (total degree of newly discovered nodes)
+     */
+    topDownStep() {
+        let scoutCount = 0;
+        // Iterate through frontier nodes
+        for (const node of this.frontier) {
+            const currentDistance = this.distances.get(node);
+            for (const neighbor of this.graph.iterateNeighborIndices(node)) {
+                if (this.parent[neighbor] === -1) {
+                    this.parent[neighbor] = node;
+                    this.distances.set(neighbor, currentDistance + 1);
+                    this.nextFrontier.add(neighbor);
+                    scoutCount += this.graph.outDegreeByIndex(neighbor);
+                }
+            }
+        }
+        return scoutCount;
+    }
+    /**
+     * Bottom-up BFS step - check unvisited nodes for frontier neighbors.
+     * @returns The number of newly discovered nodes
+     */
+    bottomUpStep() {
+        const nodeCount = this.graph.nodeCount();
+        let awakeCount = 0;
+        // Check all unvisited nodes
+        for (let node = 0; node < nodeCount; node++) {
+            if (this.parent[node] === -1) {
+                // Use incoming edges for bottom-up traversal
+                for (const neighbor of this.graph.iterateIncomingNeighborIndices(node)) {
+                    if (this.frontier.has(neighbor)) {
+                        this.parent[node] = neighbor;
+                        const neighborDist = this.distances.get(neighbor);
+                        this.distances.set(node, neighborDist + 1);
+                        this.nextFrontier.add(node);
+                        awakeCount++;
+                        break; // Found a parent, no need to check more
+                    }
+                }
+            }
+        }
+        return awakeCount;
+    }
+    /**
+     * Calculate edges to check for switching heuristic.
+     * @returns The total number of outgoing edges from frontier nodes
+     */
+    calculateEdgesToCheck() {
+        let count = 0;
+        for (const node of this.frontier) {
+            count += this.graph.outDegreeByIndex(node);
+        }
+        return count;
+    }
+    /**
+     * Build result map from internal data structures.
+     * @returns The BFS result containing distances and parent pointers
+     */
+    buildResult() {
+        const distances = new Map();
+        const parents = new Map();
+        let visitedCount = 0;
+        for (let i = 0; i < this.graph.nodeCount(); i++) {
+            if (this.parent[i] !== -1) {
+                const nodeId = this.graph.indexToNodeId(i);
+                distances.set(nodeId, this.distances.get(i));
+                if (this.parent[i] === -2) {
+                    // Source node
+                    parents.set(nodeId, null);
+                }
+                else {
+                    // Regular node with parent
+                    const parentIndex = this.parent[i];
+                    if (parentIndex !== undefined && parentIndex >= 0) {
+                        parents.set(nodeId, this.graph.indexToNodeId(parentIndex));
+                    }
+                }
+                visitedCount++;
+            }
+        }
+        return { distances, parents, visitedCount };
+    }
+    /**
+     * Perform multi-source BFS from multiple source nodes.
+     * @param sources - Array of source node IDs to start the BFS from
+     * @returns The BFS result containing distances and parent pointers
+     */
+    searchMultiple(sources) {
+        // Initialize multiple sources
+        for (const source of sources) {
+            const sourceIndex = this.graph.nodeToIndex(source);
+            this.parent[sourceIndex] = -2; // Mark as source
+            this.frontier.add(sourceIndex);
+            this.distances.set(sourceIndex, 0);
+        }
+        // let currentDistance = 0; // Variable not used
+        let edgesToCheck = 0;
+        let scoutCount = 0;
+        // Calculate initial edges to check
+        for (const node of this.frontier) {
+            const degree = this.graph.outDegreeByIndex(node);
+            edgesToCheck += degree;
+            scoutCount += degree;
+        }
+        let awakeCount = sources.length;
+        let oldAwakeCount = 0;
+        let useBottomUp = false;
+        while (!this.frontier.isEmpty()) {
+            oldAwakeCount = awakeCount;
+            if (useBottomUp) {
+                if (awakeCount >= oldAwakeCount || awakeCount > this.graph.nodeCount() / this.beta) {
+                    useBottomUp = false;
+                }
+            }
+            else {
+                if (scoutCount > edgesToCheck / this.alpha) {
+                    useBottomUp = true;
+                }
+            }
+            if (useBottomUp) {
+                awakeCount = this.bottomUpStep();
+            }
+            else {
+                scoutCount = this.topDownStep();
+                awakeCount = this.nextFrontier.size();
+            }
+            this.frontier.swap(this.nextFrontier);
+            this.nextFrontier.clear();
+            // currentDistance++; // Variable not used
+            edgesToCheck = this.calculateEdgesToCheck();
+        }
+        return this.buildResult();
+    }
+    /**
+     * Reset internal state for reuse
+     */
+    reset() {
+        this.parent.fill(-1);
+        this.frontier.clear();
+        this.nextFrontier.clear();
+        this.distances.clear();
+    }
+}
+/**
+ * Convenience function for single-source BFS.
+ * @param graph - The CSR graph to perform BFS on
+ * @param source - The source node ID to start the BFS from
+ * @param options - Optional configuration for switching thresholds
+ * @returns The BFS result containing distances and parent pointers
+ */
+export function directionOptimizedBFS(graph, source, options) {
+    const bfs = new DirectionOptimizedBFS(graph, options);
+    return bfs.search(source);
+}
+/**
+ * Convenience function for multi-source BFS.
+ * @param graph - The CSR graph to perform BFS on
+ * @param sources - Array of source node IDs to start the BFS from
+ * @param options - Optional configuration for switching thresholds
+ * @returns The BFS result containing distances and parent pointers
+ */
+export function directionOptimizedBFSMultiple(graph, sources, options) {
+    const bfs = new DirectionOptimizedBFS(graph, options);
+    return bfs.searchMultiple(sources);
+}
+//# sourceMappingURL=direction-optimized-bfs.js.map

package/dist/src/optimized/direction-optimized-bfs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"direction-optimized-bfs.js","sourceRoot":"","sources":["../../../src/optimized/direction-optimized-bfs.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,oBAAoB,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAoBpE;;;;;;;;;GASG;AACH,MAAM,OAAO,qBAAqB;IAW9B;;;;OAIG;IACH,YAAY,KAAwB,EAAE,OAAsC;QACxE,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,OAAO,EAAE,KAAK,IAAI,EAAE,CAAC;QAClC,IAAI,CAAC,IAAI,GAAG,OAAO,EAAE,IAAI,IAAI,EAAE,CAAC;QAEhC,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;QACpC,IAAI,CAAC,MAAM,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,IAAI,CAAC,QAAQ,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC;QAC3C,IAAI,CAAC,YAAY,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC;QAC/C,IAAI,CAAC,SAAS,GAAG,IAAI,oBAAoB,CAAC,SAAS,CAAC,CAAC;IACzD,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,MAAe;QAClB,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACnD,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,iBAAiB;QAChD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAC/B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QAEnC,gDAAgD;QAChD,kFAAkF;QAClF,IAAI,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC;QAC1C,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC,wCAAwC;QAC5D,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC,sCAAsC;QAC1D,IAAI,aAAa,GAAG,CAAC,CAAC;QAEtB,qBAAqB;QACrB,IAAI,WAAW,GAAG,KAAK,CAAC;QAExB,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;YAC9B,aAAa,GAAG,UAAU,CAAC;YAE3B,IAAI,WAAW,EAAE,CAAC;gBACd,6CAA6C;gBAC7C,IAAI,UAAU,IAAI,aAAa,IAAI,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;oBACjF,WAAW,GAAG,KAAK,CAAC;gBACxB,CAAC;YACL,CAAC;iBAAM,CAAC;gBACJ,yCAAyC;gBACzC,IAAI,UAAU,GAAG,YAAY,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;oBACzC,WAAW,GAAG,IAAI,CAAC;gBACvB,CAAC;YACL,CAAC;YAED,IAAI,WAAW,EAAE,CAAC;gBACd,UAAU,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;YACrC,CAAC;iBAAM,CAAC;gBACJ,UAAU,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;gBAChC,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;YAC1C,CAAC;YAED,iBAAiB;YACjB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YACtC,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;YAE1B,0CAA0C;YAC1C,YAAY,GAAG,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAChD,CAAC;QAED,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;IAC9B,CAAC;IAED;;;OAGG;IACK,WAAW;QACf,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,iCAAiC;QACjC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC/B,MAAM,eAAe,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAEjD,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,sBAAsB,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC7D,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;oBAC/B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC;oBAC7B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,EAAE,eAAe,GAAG,CAAC,CAAC,CAAC;oBAClD,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBAChC,UAAU,IAAI,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;gBACxD,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,UAAU,CAAC;IACtB,CAAC;IAED;;;OAGG;IACK,YAAY;QAChB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC;QACzC,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,4BAA4B;QAC5B,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,SAAS,EAAE,IAAI,EAAE,EAAE,CAAC;YAC1C,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;gBAC3B,6CAA6C;gBAC7C,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,8BAA8B,CAAC,IAAI,CAAC,EAAE,CAAC;oBACrE,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;wBAC9B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC;wBAC7B,MAAM,YAAY,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;wBAClD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC;wBAC3C,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;wBAC5B,UAAU,EAAE,CAAC;wBACb,MAAM,CAAC,wCAAwC;oBACnD,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,UAAU,CAAC;IACtB,CAAC;IAED;;;OAGG;IACK,qBAAqB;QACzB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC/B,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;QAC/C,CAAC;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;OAGG;IACK,WAAW;QACf,MAAM,SAAS,GAAG,IAAI,GAAG,EAAmB,CAAC;QAC7C,MAAM,OAAO,GAAG,IAAI,GAAG,EAA2B,CAAC;QACnD,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;gBACxB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;gBAC3C,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAE7C,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;oBACxB,cAAc;oBACd,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;gBAC9B,CAAC;qBAAM,CAAC;oBACJ,2BAA2B;oBAC3B,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBACnC,IAAI,WAAW,KAAK,SAAS,IAAI,WAAW,IAAI,CAAC,EAAE,CAAC;wBAChD,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC,CAAC;oBAC/D,CAAC;gBACL,CAAC;gBAED,YAAY,EAAE,CAAC;YACnB,CAAC;QACL,CAAC;QAED,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,YAAY,EAAE,CAAC;IAChD,CAAC;IAED;;;;OAIG;IACH,cAAc,CAAC,OAAkB;QAC7B,8BAA8B;QAC9B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC3B,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YACnD,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,iBAAiB;YAChD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;YAC/B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QACvC,CAAC;QAED,gDAAgD;QAChD,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,mCAAmC;QACnC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;YACjD,YAAY,IAAI,MAAM,CAAC;YACvB,UAAU,IAAI,MAAM,CAAC;QACzB,CAAC;QAED,IAAI,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC;QAChC,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,WAAW,GAAG,KAAK,CAAC;QAExB,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;YAC9B,aAAa,GAAG,UAAU,CAAC;YAE3B,IAAI,WAAW,EAAE,CAAC;gBACd,IAAI,UAAU,IAAI,aAAa,IAAI,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;oBACjF,WAAW,GAAG,KAAK,CAAC;gBACxB,CAAC;YACL,CAAC;iBAAM,CAAC;gBACJ,IAAI,UAAU,GAAG,YAAY,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;oBACzC,WAAW,GAAG,IAAI,CAAC;gBACvB,CAAC;YACL,CAAC;YAED,IAAI,WAAW,EAAE,CAAC;gBACd,UAAU,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;YACrC,CAAC;iBAAM,CAAC;gBACJ,UAAU,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;gBAChC,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;YAC1C,CAAC;YAED,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YACtC,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;YAE1B,0CAA0C;YAC1C,YAAY,GAAG,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAChD,CAAC;QAED,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,KAAK;QACD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QAC1B,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;IAC3B,CAAC;CACJ;AAED;;;;;;GAMG;AACH,MAAM,UAAU,qBAAqB,CACjC,KAAwB,EACxB,MAAe,EACf,OAAsC;IAEtC,MAAM,GAAG,GAAG,IAAI,qBAAqB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACtD,OAAO,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;AAC9B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,6BAA6B,CACzC,KAAwB,EACxB,OAAkB,EAClB,OAAsC;IAEtC,MAAM,GAAG,GAAG,IAAI,qBAAqB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACtD,OAAO,GAAG,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;AACvC,CAAC"}

package/dist/src/optimized/graph-adapter.d.ts

@@ -0,0 +1,111 @@
+import type { Graph } from "../core/graph.js";
+import type { NodeId } from "../types/index.js";
+import { CSRGraph, type ReadonlyGraph } from "./csr-graph.js";
+/**
+ * Adapter to convert standard Graph to CSR format
+ *
+ * Provides transparent conversion while maintaining API compatibility
+ */
+export declare class GraphAdapter<TNodeId = NodeId> implements ReadonlyGraph<TNodeId> {
+    private csrGraph;
+    /**
+     * Creates a new GraphAdapter that wraps or converts a graph to CSR format.
+     * @param graph - The graph to adapt (either standard Graph or ReadonlyGraph)
+     */
+    constructor(graph: Graph | ReadonlyGraph<TNodeId>);
+    /**
+     * Convert standard graph to CSR format.
+     * @param graph - The graph to convert
+     * @returns A new CSRGraph instance
+     */
+    private convertToCSR;
+    /**
+     * Get the total number of nodes in the graph.
+     * @returns The number of nodes
+     */
+    nodeCount(): number;
+    /**
+     * Get the total number of edges in the graph.
+     * @returns The number of edges
+     */
+    edgeCount(): number;
+    /**
+     * Check if a node exists in the graph.
+     * @param nodeId - The node ID to check
+     * @returns True if the node exists, false otherwise
+     */
+    hasNode(nodeId: TNodeId): boolean;
+    /**
+     * Check if an edge exists between two nodes.
+     * @param source - The source node ID
+     * @param target - The target node ID
+     * @returns True if the edge exists, false otherwise
+     */
+    hasEdge(source: TNodeId, target: TNodeId): boolean;
+    /**
+     * Get neighbors of a node as node IDs.
+     * @param nodeId - The node ID to get neighbors for
+     * @returns An iterator over neighbor node IDs
+     */
+    neighbors(nodeId: TNodeId): IterableIterator<TNodeId>;
+    /**
+     * Get the out-degree (number of outgoing edges) of a node.
+     * @param nodeId - The node ID to get the out-degree for
+     * @returns The number of outgoing edges from the node
+     */
+    outDegree(nodeId: TNodeId): number;
+    /**
+     * Get all nodes in the graph.
+     * @returns An iterator over all node IDs
+     */
+    nodes(): IterableIterator<TNodeId>;
+    /**
+     * Get the underlying CSR graph.
+     * @returns The CSRGraph instance used internally
+     */
+    getCSRGraph(): CSRGraph<TNodeId>;
+}
+/**
+ * Configuration for graph algorithm optimizations
+ */
+export interface GraphAlgorithmConfig {
+    useDirectionOptimizedBFS?: boolean;
+    useCSRFormat?: boolean;
+    useBitPackedStructures?: boolean;
+    bfsAlpha?: number;
+    bfsBeta?: number;
+    preallocateSize?: number;
+    enableCaching?: boolean;
+}
+/**
+ * Configure optimizations globally.
+ * @deprecated This function is a no-op and will be removed in a future version
+ * @param _config - The configuration object (ignored)
+ */
+export declare function configureOptimizations(_config: GraphAlgorithmConfig): void;
+/**
+ * Get current configuration.
+ * @deprecated This function returns empty config and will be removed in a future version
+ * @returns An empty configuration object
+ */
+export declare function getOptimizationConfig(): GraphAlgorithmConfig;
+/**
+ * Check if a graph is already in CSR format.
+ * @param graph - The graph to check
+ * @returns True if the graph is a CSRGraph instance
+ */
+export declare function isCSRGraph<TNodeId = NodeId>(graph: unknown): graph is CSRGraph<TNodeId>;
+/**
+ * Convert any graph to CSR format.
+ * @param graph - The graph to convert
+ * @returns A CSRGraph instance (either the original if already CSR, or a new converted one)
+ */
+export declare function toCSRGraph<TNodeId = NodeId>(graph: Graph | ReadonlyGraph<TNodeId> | CSRGraph<TNodeId>): CSRGraph<TNodeId>;
+/**
+ * Create an optimized graph from nodes and edges.
+ * @param nodes - Array of node IDs
+ * @param edges - Array of edge tuples [source, target, weight?]
+ * @returns A new CSRGraph instance
+ */
+export declare function createOptimizedGraph<TNodeId = NodeId>(nodes: TNodeId[], edges: [TNodeId, TNodeId, number?][]): CSRGraph<TNodeId>;
+//# sourceMappingURL=graph-adapter.d.ts.map

package/dist/src/optimized/graph-adapter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-adapter.d.ts","sourceRoot":"","sources":["../../../src/optimized/graph-adapter.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAC9C,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,QAAQ,EAAE,KAAK,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAE9D;;;;GAIG;AACH,qBAAa,YAAY,CAAC,OAAO,GAAG,MAAM,CAAE,YAAW,aAAa,CAAC,OAAO,CAAC;IACzE,OAAO,CAAC,QAAQ,CAAoB;IAEpC;;;OAGG;gBACS,KAAK,EAAE,KAAK,GAAG,aAAa,CAAC,OAAO,CAAC;IAUjD;;;;OAIG;IACH,OAAO,CAAC,YAAY;IAuDpB;;;OAGG;IACH,SAAS,IAAI,MAAM;IAInB;;;OAGG;IACH,SAAS,IAAI,MAAM;IAInB;;;;OAIG;IACH,OAAO,CAAC,MAAM,EAAE,OAAO,GAAG,OAAO;IAIjC;;;;;OAKG;IACH,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,OAAO;IAIlD;;;;OAIG;IACH,SAAS,CAAC,MAAM,EAAE,OAAO,GAAG,gBAAgB,CAAC,OAAO,CAAC;IAIrD;;;;OAIG;IACH,SAAS,CAAC,MAAM,EAAE,OAAO,GAAG,MAAM;IAIlC;;;OAGG;IACH,KAAK,IAAI,gBAAgB,CAAC,OAAO,CAAC;IAIlC;;;OAGG;IACH,WAAW,IAAI,QAAQ,CAAC,OAAO,CAAC;CAGnC;AAED;;GAEG;AACH,MAAM,WAAW,oBAAoB;IAEjC,wBAAwB,CAAC,EAAE,OAAO,CAAC;IACnC,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,sBAAsB,CAAC,EAAE,OAAO,CAAC;IAGjC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,OAAO,CAAC,EAAE,MAAM,CAAC;IAGjB,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,aAAa,CAAC,EAAE,OAAO,CAAC;CAC3B;AAED;;;;GAIG;AACH,wBAAgB,sBAAsB,CAAC,OAAO,EAAE,oBAAoB,GAAG,IAAI,CAE1E;AAED;;;;GAIG;AACH,wBAAgB,qBAAqB,IAAI,oBAAoB,CAE5D;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,OAAO,GAAG,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,QAAQ,CAAC,OAAO,CAAC,CAEvF;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,OAAO,GAAG,MAAM,EACvC,KAAK,EAAE,KAAK,GAAG,aAAa,CAAC,OAAO,CAAC,GAAG,QAAQ,CAAC,OAAO,CAAC,GAC1D,QAAQ,CAAC,OAAO,CAAC,CAOnB;AAED;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAAC,OAAO,GAAG,MAAM,EACjD,KAAK,EAAE,OAAO,EAAE,EAChB,KAAK,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC,EAAE,GACrC,QAAQ,CAAC,OAAO,CAAC,CAqBnB"}

package/dist/src/optimized/graph-adapter.js

@@ -0,0 +1,194 @@
+import { CSRGraph } from "./csr-graph.js";
+/**
+ * Adapter to convert standard Graph to CSR format
+ *
+ * Provides transparent conversion while maintaining API compatibility
+ */
+export class GraphAdapter {
+    /**
+     * Creates a new GraphAdapter that wraps or converts a graph to CSR format.
+     * @param graph - The graph to adapt (either standard Graph or ReadonlyGraph)
+     */
+    constructor(graph) {
+        // Check if already a CSRGraph
+        if (graph instanceof CSRGraph) {
+            this.csrGraph = graph;
+        }
+        else {
+            // Convert to CSR format
+            this.csrGraph = this.convertToCSR(graph);
+        }
+    }
+    /**
+     * Convert standard graph to CSR format.
+     * @param graph - The graph to convert
+     * @returns A new CSRGraph instance
+     */
+    convertToCSR(graph) {
+        const adjacencyList = new Map();
+        const weights = new Map();
+        // Handle both Graph and ReadonlyGraph interfaces
+        if ("nodes" in graph && typeof graph.nodes === "function") {
+            // Build adjacency list from Graph
+            for (const node of graph.nodes()) {
+                const nodeId = node.id;
+                const neighbors = [];
+                const graphTyped = graph;
+                for (const neighborId of graphTyped.neighbors(nodeId)) {
+                    neighbors.push(neighborId);
+                    // Get edge weight if available
+                    if ("getEdge" in graph && typeof graph.getEdge === "function") {
+                        const edge = graphTyped.getEdge(nodeId, neighborId);
+                        if (edge?.weight !== undefined) {
+                            weights.set(`${String(nodeId)}-${String(neighborId)}`, edge.weight);
+                        }
+                    }
+                }
+                adjacencyList.set(nodeId, neighbors);
+            }
+        }
+        else if ("nodeIds" in graph && typeof graph.nodeIds === "function") {
+            const readonlyGraph = graph;
+            for (const nodeId of readonlyGraph.nodeIds()) {
+                adjacencyList.set(nodeId, []);
+            }
+            // Build adjacency from edges
+            if ("edges" in readonlyGraph && typeof readonlyGraph.edges === "function") {
+                for (const edge of readonlyGraph.edges()) {
+                    const neighbors = adjacencyList.get(edge.source);
+                    if (neighbors) {
+                        neighbors.push(edge.target);
+                        if (edge.weight !== undefined) {
+                            weights.set(`${String(edge.source)}-${String(edge.target)}`, edge.weight);
+                        }
+                    }
+                }
+            }
+        }
+        return new CSRGraph(adjacencyList, weights.size > 0 ? weights : undefined);
+    }
+    // Delegate all methods to CSR implementation
+    /**
+     * Get the total number of nodes in the graph.
+     * @returns The number of nodes
+     */
+    nodeCount() {
+        return this.csrGraph.nodeCount();
+    }
+    /**
+     * Get the total number of edges in the graph.
+     * @returns The number of edges
+     */
+    edgeCount() {
+        return this.csrGraph.edgeCount();
+    }
+    /**
+     * Check if a node exists in the graph.
+     * @param nodeId - The node ID to check
+     * @returns True if the node exists, false otherwise
+     */
+    hasNode(nodeId) {
+        return this.csrGraph.hasNode(nodeId);
+    }
+    /**
+     * Check if an edge exists between two nodes.
+     * @param source - The source node ID
+     * @param target - The target node ID
+     * @returns True if the edge exists, false otherwise
+     */
+    hasEdge(source, target) {
+        return this.csrGraph.hasEdge(source, target);
+    }
+    /**
+     * Get neighbors of a node as node IDs.
+     * @param nodeId - The node ID to get neighbors for
+     * @returns An iterator over neighbor node IDs
+     */
+    neighbors(nodeId) {
+        return this.csrGraph.neighbors(nodeId);
+    }
+    /**
+     * Get the out-degree (number of outgoing edges) of a node.
+     * @param nodeId - The node ID to get the out-degree for
+     * @returns The number of outgoing edges from the node
+     */
+    outDegree(nodeId) {
+        return this.csrGraph.outDegree(nodeId);
+    }
+    /**
+     * Get all nodes in the graph.
+     * @returns An iterator over all node IDs
+     */
+    nodes() {
+        return this.csrGraph.nodes();
+    }
+    /**
+     * Get the underlying CSR graph.
+     * @returns The CSRGraph instance used internally
+     */
+    getCSRGraph() {
+        return this.csrGraph;
+    }
+}
+/**
+ * Configure optimizations globally.
+ * @deprecated This function is a no-op and will be removed in a future version
+ * @param _config - The configuration object (ignored)
+ */
+export function configureOptimizations(_config) {
+    // No-op for backward compatibility
+}
+/**
+ * Get current configuration.
+ * @deprecated This function returns empty config and will be removed in a future version
+ * @returns An empty configuration object
+ */
+export function getOptimizationConfig() {
+    return {};
+}
+/**
+ * Check if a graph is already in CSR format.
+ * @param graph - The graph to check
+ * @returns True if the graph is a CSRGraph instance
+ */
+export function isCSRGraph(graph) {
+    return graph instanceof CSRGraph;
+}
+/**
+ * Convert any graph to CSR format.
+ * @param graph - The graph to convert
+ * @returns A CSRGraph instance (either the original if already CSR, or a new converted one)
+ */
+export function toCSRGraph(graph) {
+    if (isCSRGraph(graph)) {
+        return graph;
+    }
+    const adapter = new GraphAdapter(graph);
+    return adapter.getCSRGraph();
+}
+/**
+ * Create an optimized graph from nodes and edges.
+ * @param nodes - Array of node IDs
+ * @param edges - Array of edge tuples [source, target, weight?]
+ * @returns A new CSRGraph instance
+ */
+export function createOptimizedGraph(nodes, edges) {
+    const adjacencyList = new Map();
+    const weights = new Map();
+    // Initialize nodes
+    for (const node of nodes) {
+        adjacencyList.set(node, []);
+    }
+    // Add edges
+    for (const [source, target, weight] of edges) {
+        const neighbors = adjacencyList.get(source);
+        if (neighbors) {
+            neighbors.push(target);
+            if (weight !== undefined) {
+                weights.set(`${String(source)}-${String(target)}`, weight);
+            }
+        }
+    }
+    return new CSRGraph(adjacencyList, weights.size > 0 ? weights : undefined);
+}
+//# sourceMappingURL=graph-adapter.js.map

package/dist/src/optimized/graph-adapter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-adapter.js","sourceRoot":"","sources":["../../../src/optimized/graph-adapter.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,QAAQ,EAAsB,MAAM,gBAAgB,CAAC;AAE9D;;;;GAIG;AACH,MAAM,OAAO,YAAY;IAGrB;;;OAGG;IACH,YAAY,KAAqC;QAC7C,8BAA8B;QAC9B,IAAI,KAAK,YAAY,QAAQ,EAAE,CAAC;YAC5B,IAAI,CAAC,QAAQ,GAAG,KAA0B,CAAC;QAC/C,CAAC;aAAM,CAAC;YACJ,wBAAwB;YACxB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QAC7C,CAAC;IACL,CAAC;IAED;;;;OAIG;IACK,YAAY,CAAC,KAAqC;QACtD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAsB,CAAC;QACpD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE1C,iDAAiD;QACjD,IAAI,OAAO,IAAI,KAAK,IAAI,OAAO,KAAK,CAAC,KAAK,KAAK,UAAU,EAAE,CAAC;YACxD,kCAAkC;YAClC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;gBAC/B,MAAM,MAAM,GAAI,IAAwB,CAAC,EAAE,CAAC;gBAC5C,MAAM,SAAS,GAAc,EAAE,CAAC;gBAEhC,MAAM,UAAU,GAAG,KAAc,CAAC;gBAClC,KAAK,MAAM,UAAU,IAAI,UAAU,CAAC,SAAS,CAAC,MAAgB,CAAC,EAAE,CAAC;oBAC9D,SAAS,CAAC,IAAI,CAAC,UAAqB,CAAC,CAAC;oBAEtC,+BAA+B;oBAC/B,IAAI,SAAS,IAAI,KAAK,IAAI,OAAO,KAAK,CAAC,OAAO,KAAK,UAAU,EAAE,CAAC;wBAC5D,MAAM,IAAI,GAAG,UAAU,CAAC,OAAO,CAAC,MAAgB,EAAE,UAAU,CAAC,CAAC;wBAC9D,IAAI,IAAI,EAAE,MAAM,KAAK,SAAS,EAAE,CAAC;4BAC7B,OAAO,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,UAAU,CAAC,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;wBACxE,CAAC;oBACL,CAAC;gBACL,CAAC;gBAED,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;YACzC,CAAC;QACL,CAAC;aAAM,IAAI,SAAS,IAAI,KAAK,IAAI,OAAO,KAAK,CAAC,OAAO,KAAK,UAAU,EAAE,CAAC;YAMnE,MAAM,aAAa,GAAG,KAAiC,CAAC;YACxD,KAAK,MAAM,MAAM,IAAI,aAAa,CAAC,OAAO,EAAE,EAAE,CAAC;gBAC3C,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YAClC,CAAC;YAED,6BAA6B;YAC7B,IAAI,OAAO,IAAI,aAAa,IAAI,OAAO,aAAa,CAAC,KAAK,KAAK,UAAU,EAAE,CAAC;gBACxE,KAAK,MAAM,IAAI,IAAI,aAAa,CAAC,KAAK,EAAE,EAAE,CAAC;oBACvC,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBACjD,IAAI,SAAS,EAAE,CAAC;wBACZ,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;wBAC5B,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;4BAC5B,OAAO,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;wBAC9E,CAAC;oBACL,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,IAAI,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAC/E,CAAC;IAED,6CAA6C;IAC7C;;;OAGG;IACH,SAAS;QACL,OAAO,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC;IACrC,CAAC;IAED;;;OAGG;IACH,SAAS;QACL,OAAO,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC;IACrC,CAAC;IAED;;;;OAIG;IACH,OAAO,CAAC,MAAe;QACnB,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACzC,CAAC;IAED;;;;;OAKG;IACH,OAAO,CAAC,MAAe,EAAE,MAAe;QACpC,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACjD,CAAC;IAED;;;;OAIG;IACH,SAAS,CAAC,MAAe;QACrB,OAAO,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAC3C,CAAC;IAED;;;;OAIG;IACH,SAAS,CAAC,MAAe;QACrB,OAAO,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAC3C,CAAC;IAED;;;OAGG;IACH,KAAK;QACD,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;IACjC,CAAC;IAED;;;OAGG;IACH,WAAW;QACP,OAAO,IAAI,CAAC,QAAQ,CAAC;IACzB,CAAC;CACJ;AAoBD;;;;GAIG;AACH,MAAM,UAAU,sBAAsB,CAAC,OAA6B;IAChE,mCAAmC;AACvC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,qBAAqB;IACjC,OAAO,EAAE,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAmB,KAAc;IACvD,OAAO,KAAK,YAAY,QAAQ,CAAC;AACrC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,UAAU,CACtB,KAAyD;IAEzD,IAAI,UAAU,CAAU,KAAK,CAAC,EAAE,CAAC;QAC7B,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,YAAY,CAAU,KAAK,CAAC,CAAC;IACjD,OAAO,OAAO,CAAC,WAAW,EAAE,CAAC;AACjC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAChC,KAAgB,EAChB,KAAoC;IAEpC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAsB,CAAC;IACpD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE1C,mBAAmB;IACnB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IAChC,CAAC;IAED,YAAY;IACZ,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QAC3C,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC5C,IAAI,SAAS,EAAE,CAAC;YACZ,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACvB,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACvB,OAAO,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;YAC/D,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,IAAI,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;AAC/E,CAAC"}

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

@@ -0,0 +1,14 @@
+/**
+ * Optimized graph algorithm implementations
+ *
+ * High-performance implementations using:
+ * - Direction-Optimized BFS
+ * - Compressed Sparse Row (CSR) format
+ * - Bit-packed data structures
+ */
+export { configureOptimizations, getOptimizationConfig, type GraphAlgorithmConfig } from "./graph-adapter.js";
+export { CompactDistanceArray, GraphBitSet, VisitedBitArray } from "./bit-packed.js";
+export { CSRGraph } from "./csr-graph.js";
+export { DirectionOptimizedBFS } from "./direction-optimized-bfs.js";
+export { createOptimizedGraph, isCSRGraph, toCSRGraph } from "./graph-adapter.js";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/optimized/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAKH,OAAO,EAAE,sBAAsB,EAAE,qBAAqB,EAAE,KAAK,oBAAoB,EAAE,MAAM,oBAAoB,CAAC;AAgB9G,OAAO,EAAE,oBAAoB,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AACrF,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,qBAAqB,EAAE,MAAM,8BAA8B,CAAC;AAGrE,OAAO,EAAE,oBAAoB,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC"}

package/dist/src/optimized/index.js

@@ -0,0 +1,30 @@
+/**
+ * Optimized graph algorithm implementations
+ *
+ * High-performance implementations using:
+ * - Direction-Optimized BFS
+ * - Compressed Sparse Row (CSR) format
+ * - Bit-packed data structures
+ */
+// Configuration and optimization control
+// These deprecated functions are intentionally re-exported for backward compatibility
+// eslint-disable-next-line @typescript-eslint/no-deprecated
+export { configureOptimizations, getOptimizationConfig } from "./graph-adapter.js";
+// Note: The main BFS functions in algorithms/traversal/bfs.ts automatically
+// use these optimizations for large graphs (>10k nodes) when optimizations are enabled.
+// No manual configuration needed - just use breadthFirstSearch, shortestPathBFS, etc.
+//
+// The previously exported bfsOptimized, shortestPathBFSOptimized, and
+// singleSourceShortestPathBFSOptimized functions have been removed since they
+// are no longer needed. All optimization happens automatically.
+// BFS optimization functions have been removed. The main BFS functions
+// (breadthFirstSearch, shortestPathBFS, singleSourceShortestPathBFS)
+// in algorithms/traversal/bfs.ts now automatically use optimizations
+// for large graphs without requiring manual configuration.
+// Export data structures for advanced users
+export { CompactDistanceArray, GraphBitSet, VisitedBitArray } from "./bit-packed.js";
+export { CSRGraph } from "./csr-graph.js";
+export { DirectionOptimizedBFS } from "./direction-optimized-bfs.js";
+// Export utilities
+export { createOptimizedGraph, isCSRGraph, toCSRGraph } from "./graph-adapter.js";
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/optimized/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,yCAAyC;AACzC,sFAAsF;AACtF,4DAA4D;AAC5D,OAAO,EAAE,sBAAsB,EAAE,qBAAqB,EAA6B,MAAM,oBAAoB,CAAC;AAE9G,4EAA4E;AAC5E,wFAAwF;AACxF,sFAAsF;AACtF,EAAE;AACF,sEAAsE;AACtE,8EAA8E;AAC9E,gEAAgE;AAEhE,uEAAuE;AACvE,qEAAqE;AACrE,qEAAqE;AACrE,2DAA2D;AAE3D,4CAA4C;AAC5C,OAAO,EAAE,oBAAoB,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AACrF,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,qBAAqB,EAAE,MAAM,8BAA8B,CAAC;AAErE,mBAAmB;AACnB,OAAO,EAAE,oBAAoB,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC"}