@graphty/algorithms 1.2.0 → 1.3.1

package/dist/src/optimized/bit-packed.js

@@ -0,0 +1,292 @@
+import { TypedFastBitSet } from "typedfastbitset";
+/**
+ * Wrapper around TypedFastBitSet with graph-specific optimizations
+ *
+ * Provides efficient bit-packed set operations optimized for graph algorithms
+ * with 8x memory reduction compared to standard JavaScript Set for boolean values.
+ */
+export class GraphBitSet {
+    constructor(capacity) {
+        this._cardinality = 0;
+        this.bitset = new TypedFastBitSet();
+        if (capacity) {
+            // Pre-allocate for known size
+            this.bitset.resize(capacity);
+        }
+    }
+    /**
+   * Add a single element
+   */
+    add(index) {
+        if (!this.bitset.has(index)) {
+            this.bitset.add(index);
+            this._cardinality++;
+        }
+    }
+    /**
+   * Remove a single element
+   */
+    remove(index) {
+        if (this.bitset.has(index)) {
+            this.bitset.remove(index);
+            this._cardinality--;
+        }
+    }
+    /**
+   * Check if element exists
+   */
+    has(index) {
+        return this.bitset.has(index);
+    }
+    /**
+   * Clear all elements
+   */
+    clear() {
+        this.bitset.clear();
+        this._cardinality = 0;
+    }
+    /**
+   * Check if empty
+   */
+    isEmpty() {
+        return this._cardinality === 0;
+    }
+    /**
+   * Optimized for graph algorithms - add range of indices
+   */
+    addRange(start, end) {
+        for (let i = start; i < end; i++) {
+            if (!this.bitset.has(i)) {
+                this.bitset.add(i);
+                this._cardinality++;
+            }
+        }
+    }
+    /**
+   * Fast cardinality tracking
+   */
+    size() {
+        return this._cardinality;
+    }
+    /**
+   * Batch operations for frontier management - swap contents
+   */
+    swap(other) {
+        [this.bitset, other.bitset] = [other.bitset, this.bitset];
+        [this._cardinality, other._cardinality] = [other._cardinality, this._cardinality];
+    }
+    /**
+   * Efficient iteration
+   */
+    *[Symbol.iterator]() {
+        // Use TypedFastBitSet's optimized iteration
+        yield* this.bitset;
+    }
+    /**
+   * Set operations with cardinality tracking
+   */
+    union(other) {
+        const result = this.bitset.union(other.bitset);
+        this.bitset = result;
+        const size = this.bitset.size();
+        this._cardinality = size;
+    }
+    intersection(other) {
+        const result = this.bitset.intersection(other.bitset);
+        this.bitset = result;
+        const size = this.bitset.size();
+        this._cardinality = size;
+    }
+    difference(other) {
+        const result = this.bitset.difference(other.bitset);
+        this.bitset = result;
+        const size = this.bitset.size();
+        this._cardinality = size;
+    }
+    /**
+   * Clone the bitset
+   */
+    clone() {
+        const cloned = new GraphBitSet();
+        cloned.bitset = this.bitset.clone();
+        cloned._cardinality = this._cardinality;
+        return cloned;
+    }
+}
+/**
+ * Specialized bit array for visited tracking
+ *
+ * More memory efficient than GraphBitSet for simple boolean arrays
+ * that don't need set operations.
+ */
+export class VisitedBitArray {
+    constructor(size) {
+        this._size = size;
+        this.wordCount = Math.ceil(size / 32);
+        this.words = new Uint32Array(this.wordCount);
+    }
+    /**
+   * Set bit at index
+   */
+    set(index) {
+        if (index < 0 || index >= this._size) {
+            throw new Error(`Index ${String(index)} out of bounds [0, ${String(this._size)})`);
+        }
+        const wordIndex = index >>> 5; // divide by 32
+        const bitIndex = index & 31; // modulo 32
+        const word = this.words[wordIndex];
+        if (word !== undefined) {
+            this.words[wordIndex] = word | (1 << bitIndex);
+        }
+    }
+    /**
+   * Get bit at index
+   */
+    get(index) {
+        if (index < 0 || index >= this._size) {
+            return false;
+        }
+        const wordIndex = index >>> 5;
+        const bitIndex = index & 31;
+        const word = this.words[wordIndex];
+        return word !== undefined && (word & (1 << bitIndex)) !== 0;
+    }
+    /**
+   * Clear all bits
+   */
+    clear() {
+        this.words.fill(0);
+    }
+    /**
+   * Toggle bit at index
+   */
+    toggle(index) {
+        if (index < 0 || index >= this._size) {
+            throw new Error(`Index ${String(index)} out of bounds [0, ${String(this._size)})`);
+        }
+        const wordIndex = index >>> 5;
+        const bitIndex = index & 31;
+        const word = this.words[wordIndex];
+        if (word !== undefined) {
+            this.words[wordIndex] = word ^ (1 << bitIndex);
+        }
+    }
+    /**
+   * Population count for statistics
+   */
+    popcount() {
+        let count = 0;
+        for (let i = 0; i < this.wordCount; i++) {
+            const word = this.words[i];
+            if (word !== undefined) {
+                count += this.popcountWord(word);
+            }
+        }
+        return count;
+    }
+    /**
+   * Efficient population count for a single word
+   * Uses bit manipulation tricks for fast counting
+   */
+    popcountWord(n) {
+        let x = n;
+        x = x - ((x >>> 1) & 0x55555555);
+        x = (x & 0x33333333) + ((x >>> 2) & 0x33333333);
+        return (((x + (x >>> 4)) & 0xF0F0F0F) * 0x1010101) >>> 24;
+    }
+    /**
+   * Get size of the bit array
+   */
+    size() {
+        return this._size;
+    }
+    /**
+   * Check if all bits are zero
+   */
+    isEmpty() {
+        for (let i = 0; i < this.wordCount; i++) {
+            if (this.words[i] !== 0) {
+                return false;
+            }
+        }
+        return true;
+    }
+    /**
+   * Set multiple bits from array
+   */
+    setMultiple(indices) {
+        for (const index of indices) {
+            this.set(index);
+        }
+    }
+    /**
+   * Get indices of all set bits
+   */
+    getSetIndices() {
+        const indices = [];
+        for (let wordIndex = 0; wordIndex < this.wordCount; wordIndex++) {
+            const word = this.words[wordIndex];
+            if (!word || word === 0) {
+                continue;
+            }
+            for (let bitIndex = 0; bitIndex < 32; bitIndex++) {
+                if (word & (1 << bitIndex)) {
+                    const index = (wordIndex << 5) + bitIndex;
+                    if (index < this._size) {
+                        indices.push(index);
+                    }
+                }
+            }
+        }
+        return indices;
+    }
+}
+/**
+ * Bit-packed distance array for BFS
+ *
+ * Optimized for storing distances using 16-bit integers (up to 65,535 levels)
+ * Still provides 2x memory savings compared to standard 32-bit numbers
+ */
+export class CompactDistanceArray {
+    constructor(size) {
+        this._size = size;
+        this.data = new Uint16Array(size);
+        this.data.fill(CompactDistanceArray.INFINITY); // Initialize with max value (unvisited)
+    }
+    /**
+   * Set distance at index
+   */
+    set(index, distance) {
+        if (distance >= CompactDistanceArray.INFINITY) {
+            throw new Error(`Distance exceeds maximum value (${String(CompactDistanceArray.INFINITY - 1)})`);
+        }
+        this.data[index] = distance;
+    }
+    /**
+   * Get distance at index
+   */
+    get(index) {
+        const value = this.data[index];
+        return value ?? CompactDistanceArray.INFINITY; // Default to unvisited
+    }
+    /**
+   * Check if node has been visited
+   */
+    isVisited(index) {
+        return this.data[index] !== CompactDistanceArray.INFINITY;
+    }
+    /**
+   * Reset all distances
+   */
+    clear() {
+        this.data.fill(CompactDistanceArray.INFINITY);
+    }
+    /**
+   * Get size
+   */
+    size() {
+        return this._size;
+    }
+}
+CompactDistanceArray.INFINITY = 65535;
+//# sourceMappingURL=bit-packed.js.map

package/dist/src/optimized/bit-packed.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bit-packed.js","sourceRoot":"","sources":["../../../src/optimized/bit-packed.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,eAAe,EAAC,MAAM,iBAAiB,CAAC;AAEhD;;;;;GAKG;AACH,MAAM,OAAO,WAAW;IAIpB,YAAY,QAAiB;QAFrB,iBAAY,GAAG,CAAC,CAAC;QAGrB,IAAI,CAAC,MAAM,GAAG,IAAI,eAAe,EAAE,CAAC;QACpC,IAAI,QAAQ,EAAE,CAAC;YACX,8BAA8B;YAC9B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACjC,CAAC;IACL,CAAC;IAED;;KAEC;IACD,GAAG,CAAC,KAAa;QACb,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACvB,IAAI,CAAC,YAAY,EAAE,CAAC;QACxB,CAAC;IACL,CAAC;IAED;;KAEC;IACD,MAAM,CAAC,KAAa;QAChB,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACzB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC1B,IAAI,CAAC,YAAY,EAAE,CAAC;QACxB,CAAC;IACL,CAAC;IAED;;KAEC;IACD,GAAG,CAAC,KAAa;QACb,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC;IAED;;KAEC;IACD,KAAK;QACD,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACpB,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;IAC1B,CAAC;IAED;;KAEC;IACD,OAAO;QACH,OAAO,IAAI,CAAC,YAAY,KAAK,CAAC,CAAC;IACnC,CAAC;IAED;;KAEC;IACD,QAAQ,CAAC,KAAa,EAAE,GAAW;QAC/B,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACtB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACnB,IAAI,CAAC,YAAY,EAAE,CAAC;YACxB,CAAC;QACL,CAAC;IACL,CAAC;IAED;;KAEC;IACD,IAAI;QACA,OAAO,IAAI,CAAC,YAAY,CAAC;IAC7B,CAAC;IAED;;KAEC;IACD,IAAI,CAAC,KAAkB;QACnB,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAC1D,CAAC,IAAI,CAAC,YAAY,EAAE,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;IACtF,CAAC;IAED;;KAEC;IACD,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC;QAClB,4CAA4C;QACxC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;IACvB,CAAC;IAED;;KAEC;IACD,KAAK,CAAC,KAAkB;QACpB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAC/C,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QAErB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAChC,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;IAC7B,CAAC;IAED,YAAY,CAAC,KAAkB;QAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACtD,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QAErB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAChC,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;IAC7B,CAAC;IAED,UAAU,CAAC,KAAkB;QACzB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACpD,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QAErB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAChC,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;IAC7B,CAAC;IAED;;KAEC;IACD,KAAK;QACD,MAAM,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;QACjC,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QAEpC,MAAM,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC;QACxC,OAAO,MAAM,CAAC;IAClB,CAAC;CACJ;AAED;;;;;GAKG;AACH,MAAM,OAAO,eAAe;IAKxB,YAAY,IAAY;QACpB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;QACtC,IAAI,CAAC,KAAK,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACjD,CAAC;IAED;;KAEC;IACD,GAAG,CAAC,KAAa;QACb,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,IAAI,KAAK,CAAC,SAAS,MAAM,CAAC,KAAK,CAAC,sBAAsB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACvF,CAAC;QAED,MAAM,SAAS,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,eAAe;QAC9C,MAAM,QAAQ,GAAG,KAAK,GAAG,EAAE,CAAC,CAAC,YAAY;QACzC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QACnC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACrB,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC;QACnD,CAAC;IACL,CAAC;IAED;;KAEC;IACD,GAAG,CAAC,KAAa;QACb,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACnC,OAAO,KAAK,CAAC;QACjB,CAAC;QAED,MAAM,SAAS,GAAG,KAAK,KAAK,CAAC,CAAC;QAC9B,MAAM,QAAQ,GAAG,KAAK,GAAG,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QACnC,OAAO,IAAI,KAAK,SAAS,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC;IAChE,CAAC;IAED;;KAEC;IACD,KAAK;QACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED;;KAEC;IACD,MAAM,CAAC,KAAa;QAChB,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,IAAI,KAAK,CAAC,SAAS,MAAM,CAAC,KAAK,CAAC,sBAAsB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACvF,CAAC;QAED,MAAM,SAAS,GAAG,KAAK,KAAK,CAAC,CAAC;QAC9B,MAAM,QAAQ,GAAG,KAAK,GAAG,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QACnC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACrB,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC;QACnD,CAAC;IACL,CAAC;IAED;;KAEC;IACD,QAAQ;QACJ,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACrB,KAAK,IAAI,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YACrC,CAAC;QACL,CAAC;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;KAGC;IACO,YAAY,CAAC,CAAS;QAC1B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;QACjC,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;QAChD,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC;IAC9D,CAAC;IAED;;KAEC;IACD,IAAI;QACA,OAAO,IAAI,CAAC,KAAK,CAAC;IACtB,CAAC;IAED;;KAEC;IACD,OAAO;QACH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBACtB,OAAO,KAAK,CAAC;YACjB,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;KAEC;IACD,WAAW,CAAC,OAAiB;QACzB,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC1B,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;IACL,CAAC;IAED;;KAEC;IACD,aAAa;QACT,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,IAAI,CAAC,SAAS,EAAE,SAAS,EAAE,EAAE,CAAC;YAC9D,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;YACnC,IAAI,CAAC,IAAI,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;gBACtB,SAAS;YACb,CAAC;YAED,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,EAAE,EAAE,QAAQ,EAAE,EAAE,CAAC;gBAC/C,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,QAAQ,CAAC,EAAE,CAAC;oBACzB,MAAM,KAAK,GAAG,CAAC,SAAS,IAAI,CAAC,CAAC,GAAG,QAAQ,CAAC;oBAC1C,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;wBACrB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACxB,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;QACD,OAAO,OAAO,CAAC;IACnB,CAAC;CACJ;AAED;;;;;GAKG;AACH,MAAM,OAAO,oBAAoB;IAK7B,YAAY,IAAY;QACpB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,IAAI,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,QAAQ,CAAC,CAAC,CAAC,wCAAwC;IAC3F,CAAC;IAED;;KAEC;IACD,GAAG,CAAC,KAAa,EAAE,QAAgB;QAC/B,IAAI,QAAQ,IAAI,oBAAoB,CAAC,QAAQ,EAAE,CAAC;YAC5C,MAAM,IAAI,KAAK,CAAC,mCAAmC,MAAM,CAAC,oBAAoB,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACrG,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC;IAChC,CAAC;IAED;;KAEC;IACD,GAAG,CAAC,KAAa;QACb,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/B,OAAO,KAAK,IAAI,oBAAoB,CAAC,QAAQ,CAAC,CAAC,uBAAuB;IAC1E,CAAC;IAED;;KAEC;IACD,SAAS,CAAC,KAAa;QACnB,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,oBAAoB,CAAC,QAAQ,CAAC;IAC9D,CAAC;IAED;;KAEC;IACD,KAAK;QACD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,QAAQ,CAAC,CAAC;IAClD,CAAC;IAED;;KAEC;IACD,IAAI;QACA,OAAO,IAAI,CAAC,KAAK,CAAC;IACtB,CAAC;;AA9CuB,6BAAQ,GAAG,KAAK,CAAC"}

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

@@ -0,0 +1,86 @@
+import type { NodeId } from "../types/index.js";
+/**
+ * Interface for read-only graph operations
+ */
+export interface ReadonlyGraph<TNodeId = NodeId> {
+    nodeCount(): number;
+    edgeCount(): number;
+    hasNode(nodeId: TNodeId): boolean;
+    hasEdge(source: TNodeId, target: TNodeId): boolean;
+    neighbors(nodeId: TNodeId): IterableIterator<TNodeId>;
+    outDegree(nodeId: TNodeId): number;
+    nodes(): IterableIterator<TNodeId>;
+}
+/**
+ * Compressed Sparse Row (CSR) graph representation
+ *
+ * Provides cache-efficient graph storage with sequential memory access patterns.
+ * Optimized for traversal operations and sparse graphs.
+ */
+export declare class CSRGraph<TNodeId = NodeId> implements ReadonlyGraph<TNodeId> {
+    private data;
+    constructor(adjacencyList: Map<TNodeId, TNodeId[]>, weights?: Map<string, number>, buildReverse?: boolean);
+    /**
+   * Build CSR structure from adjacency list
+   */
+    private buildCSR;
+    nodeCount(): number;
+    edgeCount(): number;
+    hasNode(nodeId: TNodeId): boolean;
+    hasEdge(source: TNodeId, target: TNodeId): boolean;
+    /**
+   * Get neighbors as node IDs
+   */
+    neighbors(nodeId: TNodeId): IterableIterator<TNodeId>;
+    /**
+   * Get all nodes
+   */
+    nodes(): IterableIterator<TNodeId>;
+    /**
+   * Get neighbors as indices (internal use)
+   */
+    getNeighborIndices(nodeIndex: number): number[];
+    outDegree(nodeId: TNodeId): number;
+    /**
+   * Get out-degree by index (internal use)
+   */
+    outDegreeByIndex(nodeIndex: number): number;
+    /**
+   * Iterator support for neighbor indices
+   */
+    iterateNeighborIndices(nodeIndex: number): Generator<number>;
+    /**
+   * Iterator support for incoming neighbor indices (for bottom-up BFS)
+   */
+    iterateIncomingNeighborIndices(nodeIndex: number): Generator<number>;
+    /**
+   * Convert node ID to index
+   */
+    nodeToIndex(nodeId: TNodeId): number;
+    /**
+   * Convert index to node ID
+   */
+    indexToNodeId(index: number): TNodeId;
+    /**
+   * Get edge weight
+   */
+    getEdgeWeight(source: TNodeId, target: TNodeId): number | undefined;
+    /**
+   * Binary search for target in sorted array
+   */
+    private binarySearch;
+    /**
+   * Create CSR graph from standard Graph
+   */
+    static fromGraph<TNodeId = NodeId>(graph: {
+        nodes(): IterableIterator<{
+            id: TNodeId;
+        }>;
+        neighbors(nodeId: TNodeId): IterableIterator<TNodeId>;
+        hasNode(nodeId: TNodeId): boolean;
+        getEdge?(source: TNodeId, target: TNodeId): {
+            weight?: number;
+        } | undefined;
+    }): CSRGraph<TNodeId>;
+}
+//# sourceMappingURL=csr-graph.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"csr-graph.d.ts","sourceRoot":"","sources":["../../../src/optimized/csr-graph.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,mBAAmB,CAAC;AAE9C;;GAEG;AACH,MAAM,WAAW,aAAa,CAAC,OAAO,GAAG,MAAM;IAC3C,SAAS,IAAI,MAAM,CAAC;IACpB,SAAS,IAAI,MAAM,CAAC;IACpB,OAAO,CAAC,MAAM,EAAE,OAAO,GAAG,OAAO,CAAC;IAClC,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,OAAO,CAAC;IACnD,SAAS,CAAC,MAAM,EAAE,OAAO,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;IACtD,SAAS,CAAC,MAAM,EAAE,OAAO,GAAG,MAAM,CAAC;IACnC,KAAK,IAAI,gBAAgB,CAAC,OAAO,CAAC,CAAC;CACtC;AAwBD;;;;;GAKG;AACH,qBAAa,QAAQ,CAAC,OAAO,GAAG,MAAM,CAAE,YAAW,aAAa,CAAC,OAAO,CAAC;IACrE,OAAO,CAAC,IAAI,CAAwB;gBAExB,aAAa,EAAE,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,YAAY,UAAO;IAItG;;KAEC;IACD,OAAO,CAAC,QAAQ;IA8IhB,SAAS,IAAI,MAAM;IAInB,SAAS,IAAI,MAAM;IAInB,OAAO,CAAC,MAAM,EAAE,OAAO,GAAG,OAAO;IAIjC,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,OAAO;IAmBlD;;KAEC;IACD,SAAS,CAAC,MAAM,EAAE,OAAO,GAAG,gBAAgB,CAAC,OAAO,CAAC;IA2BrD;;KAEC;IACD,KAAK,IAAI,gBAAgB,CAAC,OAAO,CAAC;IAIlC;;KAEC;IACD,kBAAkB,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,EAAE;IAc/C,SAAS,CAAC,MAAM,EAAE,OAAO,GAAG,MAAM;IASlC;;KAEC;IACD,gBAAgB,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM;IAU3C;;KAEC;IACA,sBAAsB,CAAC,SAAS,EAAE,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAc7D;;KAEC;IACA,8BAA8B,CAAC,SAAS,EAAE,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAkBrE;;KAEC;IACD,WAAW,CAAC,MAAM,EAAE,OAAO,GAAG,MAAM;IASpC;;KAEC;IACD,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IASrC;;KAEC;IACD,aAAa,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS;IA2BnE;;KAEC;IACD,OAAO,CAAC,YAAY;IA0BpB;;KAEC;IACD,MAAM,CAAC,SAAS,CAAC,OAAO,GAAG,MAAM,EAAE,KAAK,EAAE;QACtC,KAAK,IAAI,gBAAgB,CAAC;YAAC,EAAE,EAAE,OAAO,CAAA;SAAC,CAAC,CAAC;QACzC,SAAS,CAAC,MAAM,EAAE,OAAO,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;QACtD,OAAO,CAAC,MAAM,EAAE,OAAO,GAAG,OAAO,CAAC;QAClC,OAAO,CAAC,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG;YAAC,MAAM,CAAC,EAAE,MAAM,CAAA;SAAC,GAAG,SAAS,CAAC;KAC7E,GAAG,QAAQ,CAAC,OAAO,CAAC;CAuBxB"}