@graphty/algorithms 1.3.1 → 1.4.2

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

@@ -6,6 +6,10 @@ import { TypedFastBitSet } from "typedfastbitset";
  * with 8x memory reduction compared to standard JavaScript Set for boolean values.
  */
 export class GraphBitSet {
+    /**
+     * Creates a new GraphBitSet with optional pre-allocated capacity.
+     * @param capacity - The initial capacity to pre-allocate for the bitset
+     */
     constructor(capacity) {
         this._cardinality = 0;
         this.bitset = new TypedFastBitSet();
@@ -15,8 +19,9 @@ export class GraphBitSet {
         }
     }
     /**
-   * Add a single element
-   */
+     * Add a single element to the set.
+     * @param index - The element index to add
+     */
     add(index) {
         if (!this.bitset.has(index)) {
             this.bitset.add(index);
@@ -24,8 +29,9 @@ export class GraphBitSet {
         }
     }
     /**
-   * Remove a single element
-   */
+     * Remove a single element from the set.
+     * @param index - The element index to remove
+     */
     remove(index) {
         if (this.bitset.has(index)) {
             this.bitset.remove(index);
@@ -33,27 +39,32 @@ export class GraphBitSet {
         }
     }
     /**
-   * Check if element exists
-   */
+     * Check if an element exists in the set.
+     * @param index - The element index to check
+     * @returns True if the element exists, false otherwise
+     */
     has(index) {
         return this.bitset.has(index);
     }
     /**
-   * Clear all elements
-   */
+     * Clear all elements
+     */
     clear() {
         this.bitset.clear();
         this._cardinality = 0;
     }
     /**
-   * Check if empty
-   */
+     * Check if the set is empty.
+     * @returns True if the set contains no elements, false otherwise
+     */
     isEmpty() {
         return this._cardinality === 0;
     }
     /**
-   * Optimized for graph algorithms - add range of indices
-   */
+     * Optimized for graph algorithms - add a range of indices.
+     * @param start - The starting index (inclusive)
+     * @param end - The ending index (exclusive)
+     */
     addRange(start, end) {
         for (let i = start; i < end; i++) {
             if (!this.bitset.has(i)) {
@@ -63,40 +74,52 @@ export class GraphBitSet {
         }
     }
     /**
-   * Fast cardinality tracking
-   */
+     * Fast cardinality tracking - get the number of elements in the set.
+     * @returns The number of elements in the set
+     */
     size() {
         return this._cardinality;
     }
     /**
-   * Batch operations for frontier management - swap contents
-   */
+     * Batch operations for frontier management - swap contents with another GraphBitSet.
+     * @param other - The GraphBitSet to swap contents with
+     */
     swap(other) {
         [this.bitset, other.bitset] = [other.bitset, this.bitset];
         [this._cardinality, other._cardinality] = [other._cardinality, this._cardinality];
     }
     /**
-   * Efficient iteration
-   */
+     * Efficient iteration over all elements in the set.
+     * @yields The indices of elements in the set
+     */
     *[Symbol.iterator]() {
         // Use TypedFastBitSet's optimized iteration
         yield* this.bitset;
     }
     /**
-   * Set operations with cardinality tracking
-   */
+     * Perform union operation with another GraphBitSet, updating this set in place.
+     * @param other - The GraphBitSet to union with
+     */
     union(other) {
         const result = this.bitset.union(other.bitset);
         this.bitset = result;
         const size = this.bitset.size();
         this._cardinality = size;
     }
+    /**
+     * Perform intersection operation with another GraphBitSet, updating this set in place.
+     * @param other - The GraphBitSet to intersect with
+     */
     intersection(other) {
         const result = this.bitset.intersection(other.bitset);
         this.bitset = result;
         const size = this.bitset.size();
         this._cardinality = size;
     }
+    /**
+     * Perform difference operation with another GraphBitSet, updating this set in place.
+     * @param other - The GraphBitSet to subtract from this set
+     */
     difference(other) {
         const result = this.bitset.difference(other.bitset);
         this.bitset = result;
@@ -104,8 +127,9 @@ export class GraphBitSet {
         this._cardinality = size;
     }
     /**
-   * Clone the bitset
-   */
+     * Clone the bitset.
+     * @returns A new GraphBitSet with the same elements
+     */
     clone() {
         const cloned = new GraphBitSet();
         cloned.bitset = this.bitset.clone();
@@ -120,14 +144,19 @@ export class GraphBitSet {
  * that don't need set operations.
  */
 export class VisitedBitArray {
+    /**
+     * Creates a new VisitedBitArray with the specified size.
+     * @param size - The number of bits to allocate
+     */
     constructor(size) {
         this._size = size;
         this.wordCount = Math.ceil(size / 32);
         this.words = new Uint32Array(this.wordCount);
     }
     /**
-   * Set bit at index
-   */
+     * Set bit at the specified index.
+     * @param index - The bit index to set
+     */
     set(index) {
         if (index < 0 || index >= this._size) {
             throw new Error(`Index ${String(index)} out of bounds [0, ${String(this._size)})`);
@@ -140,8 +169,10 @@ export class VisitedBitArray {
         }
     }
     /**
-   * Get bit at index
-   */
+     * Get bit value at the specified index.
+     * @param index - The bit index to get
+     * @returns True if the bit is set, false otherwise
+     */
     get(index) {
         if (index < 0 || index >= this._size) {
             return false;
@@ -152,14 +183,15 @@ export class VisitedBitArray {
         return word !== undefined && (word & (1 << bitIndex)) !== 0;
     }
     /**
-   * Clear all bits
-   */
+     * Clear all bits
+     */
     clear() {
         this.words.fill(0);
     }
     /**
-   * Toggle bit at index
-   */
+     * Toggle bit at the specified index.
+     * @param index - The bit index to toggle
+     */
     toggle(index) {
         if (index < 0 || index >= this._size) {
             throw new Error(`Index ${String(index)} out of bounds [0, ${String(this._size)})`);
@@ -172,8 +204,9 @@ export class VisitedBitArray {
         }
     }
     /**
-   * Population count for statistics
-   */
+     * Population count for statistics - count the number of set bits.
+     * @returns The number of bits set to 1
+     */
     popcount() {
         let count = 0;
         for (let i = 0; i < this.wordCount; i++) {
@@ -185,24 +218,28 @@ export class VisitedBitArray {
         return count;
     }
     /**
-   * Efficient population count for a single word
-   * Uses bit manipulation tricks for fast counting
-   */
+     * Efficient population count for a single word.
+     * Uses bit manipulation tricks for fast counting.
+     * @param n - The 32-bit word to count
+     * @returns The number of bits set to 1 in the word
+     */
     popcountWord(n) {
         let x = n;
         x = x - ((x >>> 1) & 0x55555555);
         x = (x & 0x33333333) + ((x >>> 2) & 0x33333333);
-        return (((x + (x >>> 4)) & 0xF0F0F0F) * 0x1010101) >>> 24;
+        return (((x + (x >>> 4)) & 0xf0f0f0f) * 0x1010101) >>> 24;
     }
     /**
-   * Get size of the bit array
-   */
+     * Get size of the bit array.
+     * @returns The total number of bits in the array
+     */
     size() {
         return this._size;
     }
     /**
-   * Check if all bits are zero
-   */
+     * Check if all bits are zero.
+     * @returns True if no bits are set, false otherwise
+     */
     isEmpty() {
         for (let i = 0; i < this.wordCount; i++) {
             if (this.words[i] !== 0) {
@@ -212,16 +249,18 @@ export class VisitedBitArray {
         return true;
     }
     /**
-   * Set multiple bits from array
-   */
+     * Set multiple bits from an array of indices.
+     * @param indices - Array of bit indices to set
+     */
     setMultiple(indices) {
         for (const index of indices) {
             this.set(index);
         }
     }
     /**
-   * Get indices of all set bits
-   */
+     * Get indices of all set bits.
+     * @returns Array containing the indices of all bits that are set to 1
+     */
     getSetIndices() {
         const indices = [];
         for (let wordIndex = 0; wordIndex < this.wordCount; wordIndex++) {
@@ -248,14 +287,20 @@ export class VisitedBitArray {
  * Still provides 2x memory savings compared to standard 32-bit numbers
  */
 export class CompactDistanceArray {
+    /**
+     * Creates a new CompactDistanceArray with the specified size.
+     * @param size - The number of distance values to store
+     */
     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 distance at the specified index.
+     * @param index - The node index to set the distance for
+     * @param distance - The distance value to set
+     */
     set(index, distance) {
         if (distance >= CompactDistanceArray.INFINITY) {
             throw new Error(`Distance exceeds maximum value (${String(CompactDistanceArray.INFINITY - 1)})`);
@@ -263,27 +308,32 @@ export class CompactDistanceArray {
         this.data[index] = distance;
     }
     /**
-   * Get distance at index
-   */
+     * Get distance at the specified index.
+     * @param index - The node index to get the distance for
+     * @returns The distance value, or INFINITY if not set
+     */
     get(index) {
         const value = this.data[index];
         return value ?? CompactDistanceArray.INFINITY; // Default to unvisited
     }
     /**
-   * Check if node has been visited
-   */
+     * Check if a node has been visited (has a valid distance).
+     * @param index - The node index to check
+     * @returns True if the node has been visited, false otherwise
+     */
     isVisited(index) {
         return this.data[index] !== CompactDistanceArray.INFINITY;
     }
     /**
-   * Reset all distances
-   */
+     * Reset all distances to unvisited state.
+     */
     clear() {
         this.data.fill(CompactDistanceArray.INFINITY);
     }
     /**
-   * Get size
-   */
+     * Get the size of the distance array.
+     * @returns The number of elements in the array
+     */
     size() {
         return this._size;
     }

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

@@ -1 +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"}
+{"version":3,"file":"bit-packed.js","sourceRoot":"","sources":["../../../src/optimized/bit-packed.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAElD;;;;;GAKG;AACH,MAAM,OAAO,WAAW;IAIpB;;;OAGG;IACH,YAAY,QAAiB;QANrB,iBAAY,GAAG,CAAC,CAAC;QAOrB,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;;;OAGG;IACH,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;;;OAGG;IACH,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;;;;OAIG;IACH,GAAG,CAAC,KAAa;QACb,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC;IAED;;OAEG;IACH,KAAK;QACD,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACpB,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,OAAO;QACH,OAAO,IAAI,CAAC,YAAY,KAAK,CAAC,CAAC;IACnC,CAAC;IAED;;;;OAIG;IACH,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;;;OAGG;IACH,IAAI;QACA,OAAO,IAAI,CAAC,YAAY,CAAC;IAC7B,CAAC;IAED;;;OAGG;IACH,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;;;OAGG;IACH,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC;QACd,4CAA4C;QAC5C,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;IACvB,CAAC;IAED;;;OAGG;IACH,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;;;OAGG;IACH,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;;;OAGG;IACH,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;;;OAGG;IACH,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;;;OAGG;IACH,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;;;OAGG;IACH,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;;;;OAIG;IACH,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;;OAEG;IACH,KAAK;QACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED;;;OAGG;IACH,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;;;OAGG;IACH,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;;;;;OAKG;IACK,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;;;OAGG;IACH,IAAI;QACA,OAAO,IAAI,CAAC,KAAK,CAAC;IACtB,CAAC;IAED;;;OAGG;IACH,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;;;OAGG;IACH,WAAW,CAAC,OAAiB;QACzB,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC1B,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;IACL,CAAC;IAED;;;OAGG;IACH,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;;;OAGG;IACH,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;;;;OAIG;IACH,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;;;;OAIG;IACH,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;;;;OAIG;IACH,SAAS,CAAC,KAAa;QACnB,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,oBAAoB,CAAC,QAAQ,CAAC;IAC9D,CAAC;IAED;;OAEG;IACH,KAAK;QACD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,QAAQ,CAAC,CAAC;IAClD,CAAC;IAED;;;OAGG;IACH,IAAI;QACA,OAAO,IAAI,CAAC,KAAK,CAAC;IACtB,CAAC;;AAzDuB,6BAAQ,GAAG,KAAK,CAAC"}

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

@@ -19,59 +19,122 @@ export interface ReadonlyGraph<TNodeId = NodeId> {
  */
 export declare class CSRGraph<TNodeId = NodeId> implements ReadonlyGraph<TNodeId> {
     private data;
+    /**
+     * Creates a new CSRGraph from an adjacency list representation.
+     * @param adjacencyList - Map of node IDs to arrays of neighbor node IDs
+     * @param weights - Optional map of edge weights keyed by "source-target" strings
+     * @param buildReverse - Whether to build reverse edges for bottom-up BFS (default true)
+     */
     constructor(adjacencyList: Map<TNodeId, TNodeId[]>, weights?: Map<string, number>, buildReverse?: boolean);
     /**
-   * Build CSR structure from adjacency list
-   */
+     * Build CSR structure from adjacency list.
+     * @param adjacencyList - Map of node IDs to arrays of neighbor node IDs
+     * @param weights - Optional map of edge weights keyed by "source-target" strings
+     * @param buildReverse - Whether to build reverse edges for bottom-up BFS
+     * @returns The constructed CSR graph data structure
+     */
     private buildCSR;
+    /**
+     * 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 as node IDs
-   */
+     * 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 all nodes
-   */
+     * Get all nodes in the graph.
+     * @returns An iterator over all node IDs
+     */
     nodes(): IterableIterator<TNodeId>;
     /**
-   * Get neighbors as indices (internal use)
-   */
+     * Get neighbors as indices (internal use).
+     * @param nodeIndex - The internal index of the node
+     * @returns Array of neighbor indices
+     */
     getNeighborIndices(nodeIndex: number): number[];
+    /**
+     * 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 out-degree by index (internal use)
-   */
+     * Get out-degree by index (internal use).
+     * @param nodeIndex - The internal index of the node
+     * @returns The number of outgoing edges from the node
+     */
     outDegreeByIndex(nodeIndex: number): number;
     /**
-   * Iterator support for neighbor indices
-   */
+     * Iterator support for neighbor indices.
+     * @param nodeIndex - The internal index of the node
+     * @yields The indices of neighboring nodes
+     */
     iterateNeighborIndices(nodeIndex: number): Generator<number>;
     /**
-   * Iterator support for incoming neighbor indices (for bottom-up BFS)
-   */
+     * Iterator support for incoming neighbor indices (for bottom-up BFS).
+     * @param nodeIndex - The internal index of the node
+     * @yields The indices of nodes with edges pointing to this node
+     */
     iterateIncomingNeighborIndices(nodeIndex: number): Generator<number>;
     /**
-   * Convert node ID to index
-   */
+     * Convert node ID to internal index.
+     * @param nodeId - The node ID to convert
+     * @returns The internal index for the node
+     */
     nodeToIndex(nodeId: TNodeId): number;
     /**
-   * Convert index to node ID
-   */
+     * Convert internal index to node ID.
+     * @param index - The internal index to convert
+     * @returns The node ID for the given index
+     */
     indexToNodeId(index: number): TNodeId;
     /**
-   * Get edge weight
-   */
+     * Get edge weight between two nodes.
+     * @param source - The source node ID
+     * @param target - The target node ID
+     * @returns The edge weight, or undefined if the edge doesn't exist or has no weight
+     */
     getEdgeWeight(source: TNodeId, target: TNodeId): number | undefined;
     /**
-   * Binary search for target in sorted array
-   */
+     * Binary search for target in sorted array.
+     * @param arr - The typed array to search in
+     * @param target - The value to search for
+     * @param start - The starting index (inclusive)
+     * @param end - The ending index (exclusive)
+     * @returns The index of the target, or -1 if not found
+     */
     private binarySearch;
     /**
-   * Create CSR graph from standard Graph
-   */
+     * Create CSR graph from standard Graph interface.
+     * @param graph - The graph object to convert, must implement nodes, neighbors, hasNode, and optionally getEdge
+     * @param graph.nodes - Function that returns an iterator over node objects with id property
+     * @param graph.neighbors - Function that returns an iterator over neighbor node IDs
+     * @param graph.hasNode - Function that checks if a node exists in the graph
+     * @param graph.getEdge - Optional function that returns edge data including weight
+     * @returns A new CSRGraph instance
+     */
     static fromGraph<TNodeId = NodeId>(graph: {
         nodes(): IterableIterator<{
             id: TNodeId;

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

@@ -1 +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"}
+{"version":3,"file":"csr-graph.d.ts","sourceRoot":"","sources":["../../../src/optimized/csr-graph.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAEhD;;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;IAEpC;;;;;OAKG;gBACS,aAAa,EAAE,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,YAAY,UAAO;IAItG;;;;;;OAMG;IACH,OAAO,CAAC,QAAQ;IA8IhB;;;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;IAmBlD;;;;OAIG;IACH,SAAS,CAAC,MAAM,EAAE,OAAO,GAAG,gBAAgB,CAAC,OAAO,CAAC;IA2BrD;;;OAGG;IACH,KAAK,IAAI,gBAAgB,CAAC,OAAO,CAAC;IAIlC;;;;OAIG;IACH,kBAAkB,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,EAAE;IAc/C;;;;OAIG;IACH,SAAS,CAAC,MAAM,EAAE,OAAO,GAAG,MAAM;IASlC;;;;OAIG;IACH,gBAAgB,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM;IAU3C;;;;OAIG;IACF,sBAAsB,CAAC,SAAS,EAAE,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAc7D;;;;OAIG;IACF,8BAA8B,CAAC,SAAS,EAAE,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAkBrE;;;;OAIG;IACH,WAAW,CAAC,MAAM,EAAE,OAAO,GAAG,MAAM;IASpC;;;;OAIG;IACH,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IASrC;;;;;OAKG;IACH,aAAa,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS;IA2BnE;;;;;;;OAOG;IACH,OAAO,CAAC,YAAY;IA0BpB;;;;;;;;OAQG;IACH,MAAM,CAAC,SAAS,CAAC,OAAO,GAAG,MAAM,EAAE,KAAK,EAAE;QACtC,KAAK,IAAI,gBAAgB,CAAC;YAAE,EAAE,EAAE,OAAO,CAAA;SAAE,CAAC,CAAC;QAC3C,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;YAAE,MAAM,CAAC,EAAE,MAAM,CAAA;SAAE,GAAG,SAAS,CAAC;KAC/E,GAAG,QAAQ,CAAC,OAAO,CAAC;CAuBxB"}