@graphty/algorithms 1.7.3 → 1.8.0

package/dist/src/indexed/structures/arc-source.js

@@ -0,0 +1,25 @@
+/**
+ * The source node of an arc, by binary search on `rowPtr`. `GraphSnapshot` exposes `arcSource(a)`
+ * (`graph-format/src/snapshot/graph-snapshot.ts:544`), but an `AdjacencyView` -- which is what the
+ * Port 1 and Port 2 signatures take, so that `reverse()` works as an input for free -- does not,
+ * so the predecessor walk carries its own.
+ * @param rowPtr - The view's nodeCount + 1 row offsets
+ * @param arc - An arc index in `[0, arcCount)`
+ * @returns The node index whose row contains the arc
+ * @public
+ */
+export function arcSourceIn(rowPtr, arc) {
+    let lo = 0;
+    let hi = rowPtr.length - 1; // nodeCount
+    while (lo < hi) {
+        const mid = (lo + hi) >> 1;
+        if (rowPtr[mid + 1] <= arc) {
+            lo = mid + 1;
+        }
+        else {
+            hi = mid;
+        }
+    }
+    return lo;
+}
+//# sourceMappingURL=arc-source.js.map

package/dist/src/indexed/structures/arc-source.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"arc-source.js","sourceRoot":"","sources":["../../../../src/indexed/structures/arc-source.ts"],"names":[],"mappings":"AAEA;;;;;;;;;GASG;AACH,MAAM,UAAU,WAAW,CAAC,MAAW,EAAE,GAAW;IAChD,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,YAAY;IACxC,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;QACb,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC;YACzB,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;QACjB,CAAC;aAAM,CAAC;YACJ,EAAE,GAAG,GAAG,CAAC;QACb,CAAC;IACL,CAAC;IACD,OAAO,EAAE,CAAC;AACd,CAAC"}

package/dist/src/indexed/structures/index.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Scratch structures for the index-based ports (graph-format design 14.2, section 14.6's
+ * helper-ownership sentence at `graph-format-design.md:4270`).
+ * @module
+ */
+export { arcSourceIn } from "./arc-source.js";
+export { IndexedMinHeap } from "./min-heap.js";
+export { IntUnionFind } from "./union-find.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/src/indexed/structures/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/indexed/structures/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAC9C,OAAO,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AAC/C,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC"}

package/dist/src/indexed/structures/index.js

@@ -0,0 +1,9 @@
+/**
+ * Scratch structures for the index-based ports (graph-format design 14.2, section 14.6's
+ * helper-ownership sentence at `graph-format-design.md:4270`).
+ * @module
+ */
+export { arcSourceIn } from "./arc-source.js";
+export { IndexedMinHeap } from "./min-heap.js";
+export { IntUnionFind } from "./union-find.js";
+//# sourceMappingURL=index.js.map

package/dist/src/indexed/structures/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/indexed/structures/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAC9C,OAAO,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AAC/C,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC"}

package/dist/src/indexed/structures/min-heap.d.ts

@@ -0,0 +1,44 @@
+/**
+ * A binary min-heap over node indices with O(log n) decrease-key, keyed by `Float64Array` values
+ * (graph-format design 14.2, `graph-format-design.md:3771`). `pushOrDecrease` is the only operation
+ * Dijkstra's inner loop needs: it inserts an absent node and decreases a present one, so the heap
+ * never holds a stale duplicate and `pop()` needs no "is this entry current" check.
+ * @public
+ */
+export declare class IndexedMinHeap {
+    private readonly heap;
+    private readonly slot;
+    private readonly key;
+    private size;
+    /**
+     * Create an empty heap over node indices in `[0, capacity)`.
+     * @param capacity - The number of distinct node indices the heap may hold
+     */
+    constructor(capacity: number);
+    /**
+     * Whether the heap holds no entries.
+     * @returns True when the heap holds no entries
+     */
+    isEmpty(): boolean;
+    /**
+     * Insert a node that is not in the heap.
+     * @param node - The node index
+     * @param key - Its key
+     */
+    push(node: number, key: number): void;
+    /**
+     * Insert the node, or lower its key if it is already present and the new key is smaller.
+     * @param node - The node index
+     * @param key - Its candidate key
+     */
+    pushOrDecrease(node: number, key: number): void;
+    /**
+     * Remove and return the node with the smallest key. Undefined behaviour on an empty heap;
+     * callers guard with `isEmpty()`.
+     * @returns The node index
+     */
+    pop(): number;
+    private siftUp;
+    private siftDown;
+}
+//# sourceMappingURL=min-heap.d.ts.map

package/dist/src/indexed/structures/min-heap.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"min-heap.d.ts","sourceRoot":"","sources":["../../../../src/indexed/structures/min-heap.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,qBAAa,cAAc;IACvB,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAM;IAC3B,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAM;IAC3B,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAM;IAC1B,OAAO,CAAC,IAAI,CAAK;IAEjB;;;OAGG;gBACS,QAAQ,EAAE,MAAM;IAM5B;;;OAGG;IACH,OAAO,IAAI,OAAO;IAIlB;;;;OAIG;IACH,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI;IAQrC;;;;OAIG;IACH,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI;IAY/C;;;;OAIG;IACH,GAAG,IAAI,MAAM;IAab,OAAO,CAAC,MAAM;IAkBd,OAAO,CAAC,QAAQ;CAsBnB"}

package/dist/src/indexed/structures/min-heap.js

@@ -0,0 +1,112 @@
+import { INVALID_INDEX } from "@graphty/graph-format";
+/**
+ * A binary min-heap over node indices with O(log n) decrease-key, keyed by `Float64Array` values
+ * (graph-format design 14.2, `graph-format-design.md:3771`). `pushOrDecrease` is the only operation
+ * Dijkstra's inner loop needs: it inserts an absent node and decreases a present one, so the heap
+ * never holds a stale duplicate and `pop()` needs no "is this entry current" check.
+ * @public
+ */
+export class IndexedMinHeap {
+    /**
+     * Create an empty heap over node indices in `[0, capacity)`.
+     * @param capacity - The number of distinct node indices the heap may hold
+     */
+    constructor(capacity) {
+        this.size = 0;
+        this.heap = new Uint32Array(capacity);
+        this.slot = new Uint32Array(capacity).fill(INVALID_INDEX);
+        this.key = new Float64Array(capacity);
+    }
+    /**
+     * Whether the heap holds no entries.
+     * @returns True when the heap holds no entries
+     */
+    isEmpty() {
+        return this.size === 0;
+    }
+    /**
+     * Insert a node that is not in the heap.
+     * @param node - The node index
+     * @param key - Its key
+     */
+    push(node, key) {
+        this.key[node] = key;
+        this.heap[this.size] = node;
+        this.slot[node] = this.size;
+        this.size++;
+        this.siftUp(this.size - 1);
+    }
+    /**
+     * Insert the node, or lower its key if it is already present and the new key is smaller.
+     * @param node - The node index
+     * @param key - Its candidate key
+     */
+    pushOrDecrease(node, key) {
+        const at = this.slot[node];
+        if (at === INVALID_INDEX) {
+            this.push(node, key);
+            return;
+        }
+        if (key < this.key[node]) {
+            this.key[node] = key;
+            this.siftUp(at);
+        }
+    }
+    /**
+     * Remove and return the node with the smallest key. Undefined behaviour on an empty heap;
+     * callers guard with `isEmpty()`.
+     * @returns The node index
+     */
+    pop() {
+        const top = this.heap[0];
+        this.slot[top] = INVALID_INDEX;
+        this.size--;
+        if (this.size > 0) {
+            const moved = this.heap[this.size];
+            this.heap[0] = moved;
+            this.slot[moved] = 0;
+            this.siftDown(0);
+        }
+        return top;
+    }
+    siftUp(from) {
+        let at = from;
+        const node = this.heap[at];
+        const key = this.key[node];
+        while (at > 0) {
+            const parent = (at - 1) >> 1;
+            const parentNode = this.heap[parent];
+            if (this.key[parentNode] <= key) {
+                break;
+            }
+            this.heap[at] = parentNode;
+            this.slot[parentNode] = at;
+            at = parent;
+        }
+        this.heap[at] = node;
+        this.slot[node] = at;
+    }
+    siftDown(from) {
+        let at = from;
+        const node = this.heap[at];
+        const key = this.key[node];
+        for (;;) {
+            const left = 2 * at + 1;
+            if (left >= this.size) {
+                break;
+            }
+            const right = left + 1;
+            const child = right < this.size && this.key[this.heap[right]] < this.key[this.heap[left]] ? right : left;
+            const childNode = this.heap[child];
+            if (key <= this.key[childNode]) {
+                break;
+            }
+            this.heap[at] = childNode;
+            this.slot[childNode] = at;
+            at = child;
+        }
+        this.heap[at] = node;
+        this.slot[node] = at;
+    }
+}
+//# sourceMappingURL=min-heap.js.map

package/dist/src/indexed/structures/min-heap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"min-heap.js","sourceRoot":"","sources":["../../../../src/indexed/structures/min-heap.ts"],"names":[],"mappings":"AAAA,OAAO,EAAY,aAAa,EAAY,MAAM,uBAAuB,CAAC;AAE1E;;;;;;GAMG;AACH,MAAM,OAAO,cAAc;IAMvB;;;OAGG;IACH,YAAY,QAAgB;QANpB,SAAI,GAAG,CAAC,CAAC;QAOb,IAAI,CAAC,IAAI,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC;QACtC,IAAI,CAAC,IAAI,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC1D,IAAI,CAAC,GAAG,GAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC;IAC1C,CAAC;IAED;;;OAGG;IACH,OAAO;QACH,OAAO,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC;IAC3B,CAAC;IAED;;;;OAIG;IACH,IAAI,CAAC,IAAY,EAAE,GAAW;QAC1B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC;QACrB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;QAC5B,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;IAC/B,CAAC;IAED;;;;OAIG;IACH,cAAc,CAAC,IAAY,EAAE,GAAW;QACpC,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,EAAE,KAAK,aAAa,EAAE,CAAC;YACvB,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACrB,OAAO;QACX,CAAC;QACD,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACvB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC;YACrB,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACpB,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,GAAG;QACC,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,aAAa,CAAC;QAC/B,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAChB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YACrB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACrB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,GAAG,CAAC;IACf,CAAC;IAEO,MAAM,CAAC,IAAY;QACvB,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3B,OAAO,EAAE,GAAG,CAAC,EAAE,CAAC;YACZ,MAAM,MAAM,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;YAC7B,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrC,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,GAAG,EAAE,CAAC;gBAC9B,MAAM;YACV,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC;YAC3B,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC;YAC3B,EAAE,GAAG,MAAM,CAAC;QAChB,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;QACrB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;IACzB,CAAC;IAEO,QAAQ,CAAC,IAAY;QACzB,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3B,SAAS,CAAC;YACN,MAAM,IAAI,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;gBACpB,MAAM;YACV,CAAC;YACD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC;YACvB,MAAM,KAAK,GAAG,KAAK,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;YACzG,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnC,IAAI,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC7B,MAAM;YACV,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC;YAC1B,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC;YAC1B,EAAE,GAAG,KAAK,CAAC;QACf,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;QACrB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;IACzB,CAAC;CACJ"}

package/dist/src/indexed/structures/union-find.d.ts

@@ -0,0 +1,39 @@
+import { type U32 } from "@graphty/graph-format";
+/**
+ * Index-keyed union-find over `[0, size)` with union by rank and path halving. The legacy
+ * `UnionFind` (`src/data-structures/union-find.ts`) is NodeId-keyed and stays where it is.
+ * @public
+ */
+export declare class IntUnionFind {
+    private readonly parent;
+    private readonly rank;
+    /**
+     * Create a union-find whose every element is a singleton set.
+     * @param size - The number of elements, each initially its own singleton set
+     */
+    constructor(size: number);
+    /**
+     * Find the representative of an element's set, halving the path on the way up.
+     * @param x - An element index
+     * @returns The representative of x's set
+     */
+    find(x: number): number;
+    /**
+     * Merge the sets of two elements, attaching the shallower tree under the deeper one.
+     * @param a - An element index
+     * @param b - An element index
+     * @returns True when the two sets were distinct and have now been merged
+     */
+    union(a: number, b: number): boolean;
+    /**
+     * Dense labels in FIRST-SEEN order, which is what makes `groups()` identical to the legacy
+     * iteration order and identical to the GPU's after its own `renumberPartition` readback
+     * (design 9.7's connectedComponents row).
+     * @returns The labels and the number of distinct sets
+     */
+    toLabels(): {
+        readonly labels: U32;
+        readonly count: number;
+    };
+}
+//# sourceMappingURL=union-find.d.ts.map

package/dist/src/indexed/structures/union-find.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"union-find.d.ts","sourceRoot":"","sources":["../../../../src/indexed/structures/union-find.ts"],"names":[],"mappings":"AAAA,OAAO,EAAqB,KAAK,GAAG,EAAE,MAAM,uBAAuB,CAAC;AAEpE;;;;GAIG;AACH,qBAAa,YAAY;IACrB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAM;IAC7B,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAM;IAE3B;;;OAGG;gBACS,IAAI,EAAE,MAAM;IAQxB;;;;OAIG;IACH,IAAI,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IASvB;;;;;OAKG;IACH,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO;IAiBpC;;;;;OAKG;IACH,QAAQ,IAAI;QAAE,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;KAAE;CAO/D"}

package/dist/src/indexed/structures/union-find.js

@@ -0,0 +1,70 @@
+import { renumberPartition } from "@graphty/graph-format";
+/**
+ * Index-keyed union-find over `[0, size)` with union by rank and path halving. The legacy
+ * `UnionFind` (`src/data-structures/union-find.ts`) is NodeId-keyed and stays where it is.
+ * @public
+ */
+export class IntUnionFind {
+    /**
+     * Create a union-find whose every element is a singleton set.
+     * @param size - The number of elements, each initially its own singleton set
+     */
+    constructor(size) {
+        this.parent = new Uint32Array(size);
+        this.rank = new Uint32Array(size);
+        for (let i = 0; i < size; i++) {
+            this.parent[i] = i;
+        }
+    }
+    /**
+     * Find the representative of an element's set, halving the path on the way up.
+     * @param x - An element index
+     * @returns The representative of x's set
+     */
+    find(x) {
+        let node = x;
+        while (this.parent[node] !== node) {
+            this.parent[node] = this.parent[this.parent[node]]; // path halving
+            node = this.parent[node];
+        }
+        return node;
+    }
+    /**
+     * Merge the sets of two elements, attaching the shallower tree under the deeper one.
+     * @param a - An element index
+     * @param b - An element index
+     * @returns True when the two sets were distinct and have now been merged
+     */
+    union(a, b) {
+        const ra = this.find(a);
+        const rb = this.find(b);
+        if (ra === rb) {
+            return false;
+        }
+        if (this.rank[ra] < this.rank[rb]) {
+            this.parent[ra] = rb;
+        }
+        else if (this.rank[ra] > this.rank[rb]) {
+            this.parent[rb] = ra;
+        }
+        else {
+            this.parent[rb] = ra;
+            this.rank[ra]++;
+        }
+        return true;
+    }
+    /**
+     * Dense labels in FIRST-SEEN order, which is what makes `groups()` identical to the legacy
+     * iteration order and identical to the GPU's after its own `renumberPartition` readback
+     * (design 9.7's connectedComponents row).
+     * @returns The labels and the number of distinct sets
+     */
+    toLabels() {
+        const roots = new Uint32Array(this.parent.length);
+        for (let i = 0; i < roots.length; i++) {
+            roots[i] = this.find(i);
+        }
+        return renumberPartition(roots);
+    }
+}
+//# sourceMappingURL=union-find.js.map

package/dist/src/indexed/structures/union-find.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"union-find.js","sourceRoot":"","sources":["../../../../src/indexed/structures/union-find.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAY,MAAM,uBAAuB,CAAC;AAEpE;;;;GAIG;AACH,MAAM,OAAO,YAAY;IAIrB;;;OAGG;IACH,YAAY,IAAY;QACpB,IAAI,CAAC,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACvB,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,IAAI,CAAC,CAAS;QACV,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;YAChC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,eAAe;YACnE,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC7B,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,CAAS,EAAE,CAAS;QACtB,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YACZ,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAChC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;QACzB,CAAC;aAAM,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACvC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;QACzB,CAAC;aAAM,CAAC;YACJ,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;YACrB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;QACpB,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACH,QAAQ;QACJ,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;QACD,OAAO,iBAAiB,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC;CACJ"}

package/dist/src/indexed/to-snapshot.d.ts

@@ -0,0 +1,38 @@
+/**
+ * Conversion from the legacy `Graph` class to a frozen graph-format snapshot
+ * (graph-format design 14.1 rule 4, 14.6 row A1). This is the ONLY bridge between the legacy
+ * Map-of-Maps surface and `indexed.*`; nothing under `src/indexed/` other than this file imports
+ * `../core/graph.js`.
+ * @module
+ */
+import { type GraphSnapshot } from "@graphty/graph-format";
+import type { Graph } from "../core/graph.js";
+/** Options of {@link toSnapshot}. @public */
+export interface ToSnapshotOptions {
+    /**
+     * Record FNV-1a checksums at freeze so a caller can assert `snapshot.validate({ checksum: true })`
+     * (graph-format design 14.2's first port rule: views are shared, so a port that writes into one
+     * has to fail a test rather than corrupt the next call). Default false; the test suites set it.
+     */
+    readonly checksum?: boolean | undefined;
+}
+/**
+ * Freeze a legacy `Graph` into a `GraphSnapshot`, memoised on the graph's `mutationCount`.
+ *
+ * The builder is created with `weightDtype: "f64"` so a legacy graph's double weights survive
+ * exactly: at freeze, graph-format keeps the original values in an f64 edge column with role
+ * `weight` (the "shadow") whenever at least one of them is not f32-exact, and costs nothing when
+ * they all are (graph-format design section 3.7, `graph-format/src/builder/freeze.ts:332-360`).
+ * A weighted `indexed.*` port reproduces legacy f64 results by passing
+ * `expandEdges(s, shadow.data)` as its per-arc `weights` override.
+ *
+ * Every legacy edge carries a weight (`Graph.addEdge` defaults it to 1), so the builder's
+ * `weighted: "auto"` always allocates the arc weight array -- 4 bytes per arc. That is truthful
+ * rather than wasteful: the legacy graph really does store the value.
+ * @param graph - The legacy graph to convert
+ * @param options - Conversion options
+ * @returns A frozen snapshot of the graph's current topology and weights
+ * @public
+ */
+export declare function toSnapshot(graph: Graph, options?: ToSnapshotOptions): GraphSnapshot;
+//# sourceMappingURL=to-snapshot.d.ts.map

package/dist/src/indexed/to-snapshot.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"to-snapshot.d.ts","sourceRoot":"","sources":["../../../src/indexed/to-snapshot.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAgB,KAAK,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAEzE,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAE9C,6CAA6C;AAC7C,MAAM,WAAW,iBAAiB;IAC9B;;;;OAIG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC;CAC3C;AAeD;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,GAAE,iBAAsB,GAAG,aAAa,CAwBvF"}

package/dist/src/indexed/to-snapshot.js

@@ -0,0 +1,58 @@
+/**
+ * Conversion from the legacy `Graph` class to a frozen graph-format snapshot
+ * (graph-format design 14.1 rule 4, 14.6 row A1). This is the ONLY bridge between the legacy
+ * Map-of-Maps surface and `indexed.*`; nothing under `src/indexed/` other than this file imports
+ * `../core/graph.js`.
+ * @module
+ */
+import { GraphBuilder } from "@graphty/graph-format";
+/**
+ * One entry per graph, REPLACED rather than appended to on a mutation. The entry holds the
+ * mutationCount it was built at, which is what makes a stale hit impossible -- the bug the old
+ * `WeakMap<Graph, CSRGraph>` cache had (graph-format design 14.1 rule 4).
+ */
+const SNAPSHOT_CACHE = new WeakMap();
+/**
+ * Freeze a legacy `Graph` into a `GraphSnapshot`, memoised on the graph's `mutationCount`.
+ *
+ * The builder is created with `weightDtype: "f64"` so a legacy graph's double weights survive
+ * exactly: at freeze, graph-format keeps the original values in an f64 edge column with role
+ * `weight` (the "shadow") whenever at least one of them is not f32-exact, and costs nothing when
+ * they all are (graph-format design section 3.7, `graph-format/src/builder/freeze.ts:332-360`).
+ * A weighted `indexed.*` port reproduces legacy f64 results by passing
+ * `expandEdges(s, shadow.data)` as its per-arc `weights` override.
+ *
+ * Every legacy edge carries a weight (`Graph.addEdge` defaults it to 1), so the builder's
+ * `weighted: "auto"` always allocates the arc weight array -- 4 bytes per arc. That is truthful
+ * rather than wasteful: the legacy graph really does store the value.
+ * @param graph - The legacy graph to convert
+ * @param options - Conversion options
+ * @returns A frozen snapshot of the graph's current topology and weights
+ * @public
+ */
+export function toSnapshot(graph, options = {}) {
+    const checksum = options.checksum === true;
+    const cached = SNAPSHOT_CACHE.get(graph);
+    // A checksummed snapshot answers a plain request; a plain one cannot answer a checksummed
+    // request -- validate({ checksum: true }) throws E_INVALID_SNAPSHOT ("no-checksum") when none
+    // were recorded (graph-format/src/types/snapshot.ts:401-405).
+    if (cached !== undefined && cached.mutationCount === graph.mutationCount && (cached.checksum || !checksum)) {
+        return cached.snapshot;
+    }
+    const builder = new GraphBuilder({
+        directed: graph.isDirected,
+        weightDtype: "f64",
+        expectedNodes: graph.nodeCount,
+        expectedEdges: graph.totalEdgeCount,
+    });
+    for (const node of graph.nodes()) {
+        builder.addNode(node.id);
+    }
+    for (const edge of graph.edges()) {
+        builder.addEdge(edge.source, edge.target, edge.weight);
+    }
+    const snapshot = builder.freeze({ label: "algorithms.toSnapshot", checksum });
+    SNAPSHOT_CACHE.set(graph, { mutationCount: graph.mutationCount, checksum, snapshot });
+    return snapshot;
+}
+//# sourceMappingURL=to-snapshot.js.map

package/dist/src/indexed/to-snapshot.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"to-snapshot.js","sourceRoot":"","sources":["../../../src/indexed/to-snapshot.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,YAAY,EAAsB,MAAM,uBAAuB,CAAC;AAoBzE;;;;GAIG;AACH,MAAM,cAAc,GAAG,IAAI,OAAO,EAAqB,CAAC;AAExD;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,UAAU,CAAC,KAAY,EAAE,UAA6B,EAAE;IACpE,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,KAAK,IAAI,CAAC;IAC3C,MAAM,MAAM,GAAG,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACzC,0FAA0F;IAC1F,8FAA8F;IAC9F,8DAA8D;IAC9D,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,aAAa,KAAK,KAAK,CAAC,aAAa,IAAI,CAAC,MAAM,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;QACzG,OAAO,MAAM,CAAC,QAAQ,CAAC;IAC3B,CAAC;IACD,MAAM,OAAO,GAAG,IAAI,YAAY,CAAC;QAC7B,QAAQ,EAAE,KAAK,CAAC,UAAU;QAC1B,WAAW,EAAE,KAAK;QAClB,aAAa,EAAE,KAAK,CAAC,SAAS;QAC9B,aAAa,EAAE,KAAK,CAAC,cAAc;KACtC,CAAC,CAAC;IACH,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC/B,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC/B,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IAC3D,CAAC;IACD,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,uBAAuB,EAAE,QAAQ,EAAE,CAAC,CAAC;IAC9E,cAAc,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,aAAa,EAAE,KAAK,CAAC,aAAa,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC;IACtF,OAAO,QAAQ,CAAC;AACpB,CAAC"}