@graphty/algorithms 2.1.1 → 2.2.0

package/dist/src/indexed/hierarchical.js

@@ -0,0 +1,245 @@
+import { INVALID_INDEX } from "@graphty/graph-format";
+/**
+ * Hop distances from every node, over out-arcs: `nodeCount * nodeCount` entries, `INVALID_INDEX`
+ * where no path exists.
+ * @param s - The adjacency
+ * @returns The row-major hop matrix
+ */
+function hopMatrix(s) {
+    const n = s.nodeCount;
+    const hops = new Uint32Array(n * n).fill(INVALID_INDEX);
+    const queue = new Uint32Array(n);
+    for (let start = 0; start < n; start++) {
+        const row = start * n;
+        hops[row + start] = 0;
+        queue[0] = start;
+        let head = 0;
+        let tail = 1;
+        while (head < tail) {
+            const u = queue[head++];
+            const next = hops[row + u] + 1;
+            const end = s.rowPtr[u + 1];
+            for (let a = s.rowPtr[u]; a < end; a++) {
+                const v = s.colIdx[a];
+                if (hops[row + v] === INVALID_INDEX) {
+                    hops[row + v] = next;
+                    queue[tail++] = v;
+                }
+            }
+        }
+    }
+    return hops;
+}
+/**
+ * The rank of every cluster's legacy id string (`leaf-<i>` for a node, `cluster-<k>` for a merge),
+ * in string order. The legacy function breaks distance ties by comparing those strings, so the port
+ * compares these ranks to make the same merges.
+ * @param n - Node count
+ * @returns One rank per possible cluster, `2n - 1` of them
+ */
+function legacyIdRanks(n) {
+    const total = Math.max(0, 2 * n - 1);
+    const names = Array.from({ length: total }, (_, c) => (c < n ? `leaf-${c}` : `cluster-${c}`));
+    // Code-unit order, as the legacy `>=` on strings compares; localeCompare would not.
+    const order = Array.from({ length: total }, (_, c) => c).sort((a, b) => Number(names[a] > names[b]) - Number(names[a] < names[b]));
+    const rank = new Uint32Array(total);
+    order.forEach((c, r) => (rank[c] = r));
+    return rank;
+}
+/**
+ * Agglomerative hierarchical clustering over hop distances, the index-based port of the legacy
+ * `hierarchicalClustering`: every node starts as its own cluster and the closest pair is merged
+ * until one cluster remains or no remaining pair is linked by a path.
+ *
+ * The distance between two nodes is the BFS hop count over out-arcs (weights are ignored, as the
+ * legacy function ignores them); an unreachable pair has none and is left out of every linkage.
+ * The distance between two clusters over the member pairs that have one is their minimum
+ * (`single`), maximum (`complete`), mean (`average`), or mean times `|A| |B| / (|A| + |B|)`
+ * (`ward`). A pair with no connected member pair is never merged. On a directed snapshot the
+ * distance is taken in one direction, and which one follows the legacy function exactly, as do the
+ * tie-breaks: the merges, their order and their distances equal the legacy function's.
+ *
+ * One difference in what the result offers: `cut` descends into every root of a disconnected
+ * snapshot, where the legacy `clusters` map lists all nodes as one cluster at every height (its
+ * forest node has no children, so its cut never splits it).
+ *
+ * O(n^2) memory for the distance aggregates and O(n^3) time for the pair search; the legacy
+ * function is the same order with Map and Set per step.
+ * @param s - Any snapshot or adjacency view
+ * @param options - The linkage
+ * @returns The dendrogram
+ * @public
+ */
+export function hierarchicalClustering(s, options = {}) {
+    const linkage = options.linkage ?? "single";
+    if (!["single", "complete", "average", "ward"].includes(linkage)) {
+        throw new RangeError(`unknown linkage "${linkage}"`);
+    }
+    const n = s.nodeCount;
+    const hops = hopMatrix(s);
+    // Per ordered pair of cluster SLOTS: the min, max, sum and count of the member hop distances
+    // from the first to the second. A merge reuses its first child's slot.
+    const min = new Uint32Array(n * n);
+    const max = new Uint32Array(n * n);
+    const sum = new Float64Array(n * n);
+    const count = new Float64Array(n * n);
+    for (let i = 0; i < n * n; i++) {
+        const h = hops[i];
+        if (h !== INVALID_INDEX) {
+            min[i] = h;
+            max[i] = h;
+            sum[i] = h;
+            count[i] = 1;
+        }
+    }
+    const total = Math.max(0, 2 * n - 1);
+    const rank = legacyIdRanks(n);
+    const slot = new Uint32Array(total);
+    const size = new Float64Array(total);
+    const height = new Uint32Array(total);
+    for (let i = 0; i < n; i++) {
+        slot[i] = i;
+        size[i] = 1;
+    }
+    const left = [];
+    const right = [];
+    const distance = [];
+    /**
+     * The linkage distance from one cluster to another, as the legacy clusterDistance(x, y).
+     * @param x - The cluster the member distances start from
+     * @param y - The cluster they end at
+     * @returns The distance, Infinity when no member of y is reachable from x
+     */
+    const link = (x, y) => {
+        const at = slot[x] * n + slot[y];
+        const c = count[at];
+        if (c === 0) {
+            return Infinity;
+        }
+        switch (linkage) {
+            case "single":
+                return min[at];
+            case "complete":
+                return max[at];
+            case "average":
+                return sum[at] / c;
+            default:
+                return (sum[at] / c) * ((size[x] * size[y]) / (size[x] + size[y]));
+        }
+    };
+    /**
+     * The distance the legacy function stores for a pair: a leaf pair's from the lower node to the
+     * higher, a pair involving a merge from the later-created cluster to the earlier one.
+     * @param x - One cluster
+     * @param y - The other
+     * @returns The stored distance
+     */
+    const pairDistance = (x, y) => {
+        const [early, late] = x < y ? [x, y] : [y, x];
+        return late < n ? link(early, late) : link(late, early);
+    };
+    // Active clusters in the legacy Set's insertion order: the nodes, then each merge appended.
+    let active = Array.from({ length: n }, (_, i) => i);
+    while (active.length > 1) {
+        let best = Infinity;
+        let a = -1;
+        let b = -1;
+        for (const x of active) {
+            for (const y of active) {
+                if (rank[x] >= rank[y]) {
+                    continue;
+                }
+                const d = pairDistance(x, y);
+                if (d < best) {
+                    best = d;
+                    a = x;
+                    b = y;
+                }
+            }
+        }
+        if (a < 0) {
+            break; // no linked pair left: the rest stay separate roots
+        }
+        const created = n + left.length;
+        left.push(a);
+        right.push(b);
+        distance.push(best);
+        height[created] = Math.max(height[a], height[b]) + 1;
+        size[created] = size[a] + size[b];
+        const sa = slot[a];
+        const sb = slot[b];
+        for (const x of active) {
+            if (x === a || x === b) {
+                continue;
+            }
+            const sx = slot[x];
+            for (const [to, from1, from2] of [
+                [sa * n + sx, sa * n + sx, sb * n + sx],
+                [sx * n + sa, sx * n + sa, sx * n + sb],
+            ]) {
+                const c1 = count[from1];
+                const c2 = count[from2];
+                // An empty aggregate's min and max are meaningless: take the other side's.
+                if (c1 === 0 || c2 === 0) {
+                    const from = c1 === 0 ? from2 : from1;
+                    min[to] = min[from];
+                    max[to] = max[from];
+                }
+                else {
+                    min[to] = Math.min(min[from1], min[from2]);
+                    max[to] = Math.max(max[from1], max[from2]);
+                }
+                sum[to] = sum[from1] + sum[from2];
+                count[to] = c1 + c2;
+            }
+        }
+        slot[created] = sa;
+        active = active.filter((x) => x !== a && x !== b);
+        active.push(created);
+    }
+    const merges = left.length;
+    const leftArr = Uint32Array.from(left);
+    const rightArr = Uint32Array.from(right);
+    const members = (cluster) => {
+        if (!(cluster >= 0 && cluster < n + merges)) {
+            throw new RangeError(`cluster ${cluster} is not in [0, ${n + merges})`);
+        }
+        const out = [];
+        const stack = [cluster];
+        while (stack.length > 0) {
+            const c = stack.pop();
+            if (c < n) {
+                out.push(c);
+            }
+            else {
+                stack.push(rightArr[c - n], leftArr[c - n]);
+            }
+        }
+        return Uint32Array.from(out);
+    };
+    const roots = Uint32Array.from(active);
+    return {
+        nodeCount: n,
+        left: leftArr,
+        right: rightArr,
+        distance: Float64Array.from(distance),
+        height: height.slice(0, n + merges),
+        roots,
+        members,
+        cut(h) {
+            const out = [];
+            const visit = (c) => {
+                if (c < n || height[c] <= h) {
+                    out.push(members(c));
+                }
+                else {
+                    visit(leftArr[c - n]);
+                    visit(rightArr[c - n]);
+                }
+            };
+            roots.forEach(visit);
+            return out;
+        },
+    };
+}
+//# sourceMappingURL=hierarchical.js.map

package/dist/src/indexed/hierarchical.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hierarchical.js","sourceRoot":"","sources":["../../../src/indexed/hierarchical.ts"],"names":[],"mappings":"AAAA,OAAO,EAAsB,aAAa,EAAE,MAAM,uBAAuB,CAAC;AA+C1E;;;;;GAKG;AACH,SAAS,SAAS,CAAC,CAAgB;IAC/B,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;IACtB,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IACxD,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IACjC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QACrC,MAAM,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;QACtB,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;QACjB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,OAAO,IAAI,GAAG,IAAI,EAAE,CAAC;YACjB,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;YACxB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YAC/B,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACtB,IAAI,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,aAAa,EAAE,CAAC;oBAClC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;oBACrB,KAAK,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC;gBACtB,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,IAAI,CAAC;AAChB,CAAC;AAED;;;;;;GAMG;AACH,SAAS,aAAa,CAAC,CAAS;IAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACrC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9F,oFAAoF;IACpF,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CACzD,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CACtE,CAAC;IACF,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC;IACpC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACvC,OAAO,IAAI,CAAC;AAChB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,MAAM,UAAU,sBAAsB,CAAC,CAAgB,EAAE,UAA+B,EAAE;IACtF,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,QAAQ,CAAC;IAC5C,IAAI,CAAC,CAAC,QAAQ,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;QAC/D,MAAM,IAAI,UAAU,CAAC,oBAAoB,OAAO,GAAG,CAAC,CAAC;IACzD,CAAC;IACD,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;IACtB,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IAC1B,6FAA6F;IAC7F,uEAAuE;IACvE,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnC,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnC,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACpC,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,KAAK,aAAa,EAAE,CAAC;YACtB,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACX,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACX,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACX,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACjB,CAAC;IACL,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACrC,MAAM,IAAI,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC;IACpC,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC;IACrC,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC;IACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACZ,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAChB,CAAC;IACD,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B;;;;;OAKG;IACH,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE;QAC1C,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;QACpB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACV,OAAO,QAAQ,CAAC;QACpB,CAAC;QACD,QAAQ,OAAO,EAAE,CAAC;YACd,KAAK,QAAQ;gBACT,OAAO,GAAG,CAAC,EAAE,CAAC,CAAC;YACnB,KAAK,UAAU;gBACX,OAAO,GAAG,CAAC,EAAE,CAAC,CAAC;YACnB,KAAK,SAAS;gBACV,OAAO,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;YACvB;gBACI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3E,CAAC;IACL,CAAC,CAAC;IACF;;;;;;OAMG;IACH,MAAM,YAAY,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE;QAClD,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9C,OAAO,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAC5D,CAAC,CAAC;IAEF,4FAA4F;IAC5F,IAAI,MAAM,GAAa,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC9D,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,IAAI,IAAI,GAAG,QAAQ,CAAC;QACpB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACX,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACX,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACrB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;gBACrB,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;oBACrB,SAAS;gBACb,CAAC;gBACD,MAAM,CAAC,GAAG,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC7B,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;oBACX,IAAI,GAAG,CAAC,CAAC;oBACT,CAAC,GAAG,CAAC,CAAC;oBACN,CAAC,GAAG,CAAC,CAAC;gBACV,CAAC;YACL,CAAC;QACL,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACR,MAAM,CAAC,oDAAoD;QAC/D,CAAC;QACD,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACb,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,MAAM,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACrD,IAAI,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACrB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACrB,SAAS;YACb,CAAC;YACD,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACnB,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,IAAI;gBAC7B,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;gBACvC,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;aAC1C,EAAE,CAAC;gBACA,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;gBACxB,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;gBACxB,2EAA2E;gBAC3E,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;oBACvB,MAAM,IAAI,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;oBACtC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;oBACpB,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;gBACxB,CAAC;qBAAM,CAAC;oBACJ,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;oBAC3C,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;gBAC/C,CAAC;gBACD,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;gBAClC,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;YACxB,CAAC;QACL,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;QACnB,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QAClD,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACzB,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;IAC3B,MAAM,OAAO,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzC,MAAM,OAAO,GAAG,CAAC,OAAe,EAAe,EAAE;QAC7C,IAAI,CAAC,CAAC,OAAO,IAAI,CAAC,IAAI,OAAO,GAAG,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC;YAC1C,MAAM,IAAI,UAAU,CAAC,WAAW,OAAO,kBAAkB,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;QAC5E,CAAC;QACD,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,CAAC,OAAO,CAAC,CAAC;QACxB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAY,CAAC;YAChC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBACR,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChB,CAAC;iBAAM,CAAC;gBACJ,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAChD,CAAC;QACL,CAAC;QACD,OAAO,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjC,CAAC,CAAC;IACF,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACvC,OAAO;QACH,SAAS,EAAE,CAAC;QACZ,IAAI,EAAE,OAAO;QACb,KAAK,EAAE,QAAQ;QACf,QAAQ,EAAE,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC;QACrC,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC;QACnC,KAAK;QACL,OAAO;QACP,GAAG,CAAC,CAAS;YACT,MAAM,GAAG,GAAkB,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,CAAC,CAAS,EAAQ,EAAE;gBAC9B,IAAI,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC1B,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzB,CAAC;qBAAM,CAAC;oBACJ,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACtB,KAAK,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC3B,CAAC;YACL,CAAC,CAAC;YACF,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACrB,OAAO,GAAG,CAAC;QACf,CAAC;KACJ,CAAC;AACN,CAAC"}

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

@@ -12,15 +12,41 @@
  *   promises. It is exported flat too.
  * @module
  */
-export { type BfsOptions, type BfsResult, breadthFirstSearch } from "./bfs.js";
+export { allPairsShortestPath, APSP_DEFAULT_MAX_NODES, type ApspOptions, type ApspResult } from "./all-pairs.js";
+export { bellmanFord, type BellmanFordResult } from "./bellman-ford.js";
+export { betweennessCentrality, type BetweennessOptions, edgeBetweennessCentrality, type EdgeBetweennessOptions, type EdgeScoresResult, type ScoresResult, } from "./betweenness.js";
+export { type ArcOrderOption, type BfsOptions, type BfsResult, breadthFirstSearch, directionOptimizedBfs, type DirectionOptimizedBfsOptions, } from "./bfs.js";
+export { type BipartiteOptions, type BipartiteResult, isBipartite } from "./bipartite.js";
+export { closenessCentrality, type ClosenessOptions, nodeClosenessCentrality } from "./closeness.js";
 export { type CommonNeighborsOptions, commonNeighborsScore } from "./common-neighbors.js";
 export { connectedComponents, type LabelResult, weaklyConnectedComponents } from "./components.js";
+export { degreeCentrality, type DegreeCentralityOptions } from "./degree.js";
+export { DeltaPageRank, type DeltaPageRankComputeOptions, type DeltaPageRankEngineOptions, PriorityDeltaPageRank, } from "./delta-pagerank.js";
+export { depthFirstSearch, type DfsOptions, type DfsResult, hasCycle, topologicalSort } from "./dfs.js";
 export { dijkstra, type SsspOptions, type SsspResult, walkPredArcs, walkPredEdges } from "./dijkstra.js";
+export { eigenvectorCentrality, type EigenvectorOptions, type EigenvectorResult } from "./eigenvector.js";
+export { type BipartiteFlowNetwork, bipartiteFlowNetwork, maxFlow, type MaxFlowOptions, type MaxFlowResult, type MinCutResult, minSTCut, } from "./flow.js";
+export { girvanNewman, type GirvanNewmanOptions, type GirvanNewmanResult } from "./girvan-newman.js";
+export { grsbm, type GrsbmCluster, type GrsbmOptions, type GrsbmResult, type GrsbmSplit } from "./grsbm.js";
+export { hierarchicalClustering, type HierarchicalOptions, type HierarchicalResult, type Linkage, } from "./hierarchical.js";
 export { hits, type HitsOptions, type HitsResult } from "./hits.js";
+export { findAllIsomorphisms, isGraphIsomorphic, type IsomorphismOptions, type IsomorphismResult, } from "./isomorphism.js";
 export { type CorenessResult, kCoreDecomposition } from "./k-core.js";
 export { katzCentrality, type KatzOptions, type KatzResult } from "./katz.js";
+export { labelPropagation, type LabelPropagationOptions, type LabelPropagationResult, labelPropagationSemiSupervised, labelPropagationSynchronous, type SynchronousLabelPropagationOptions, } from "./label-propagation.js";
+export { leiden, type LeidenOptions, type LeidenResult } from "./leiden.js";
+export { adamicAdarForPairs, adamicAdarPrediction, adamicAdarScore, type CandidateOptions, commonNeighborsForPairs, commonNeighborsPrediction, compareAdamicAdarWithCommonNeighbors, evaluateAdamicAdar, evaluateCommonNeighbors, getTopAdamicAdarCandidatesForNode, getTopCandidatesForNode, type LinkPredictionMetrics, type LinkPredictionOptions, type LinkPredictionResult, type NodePairs, } from "./link-prediction.js";
 export { louvain, type LouvainOptions, type LouvainResult } from "./louvain.js";
-export { kruskalMST, type MstOptions, type MstResult } from "./mst.js";
-export { pageRank, type PageRankOptions, type PageRankResult } from "./pagerank.js";
+export { markovClustering, type MarkovOptions, type MarkovResult } from "./markov.js";
+export { type BipartiteMatchingOptions, type BipartiteMatchingResult, greedyBipartiteMatching, maximumBipartiteMatching, } from "./matching.js";
+export { kargerMinCut, type KargerOptions, stoerWagner, type StoerWagnerOptions } from "./min-cut.js";
+export { modularity, type ModularityOptions } from "./modularity.js";
+export { kruskalMST, type MstOptions, type MstResult, primMST, type PrimOptions, type PrimResult } from "./mst.js";
+export { pageRank, type PageRankOptions, type PageRankResult, personalizedPageRank } from "./pagerank.js";
+export { astar, type AstarResult, bidirectionalDijkstra, type PathOptions, type PathResult } from "./point-to-point.js";
+export { condensation, type CondensationResult, stronglyConnectedComponents } from "./scc.js";
+export { type LaplacianType, spectralClustering, type SpectralOptions, type SpectralResult } from "./spectral.js";
 export { arcSourceIn, IndexedMinHeap, IntUnionFind } from "./structures/index.js";
+export { syncClustering, type SyncClusteringOptions, type SyncClusteringResult } from "./sync.js";
+export { teraHAC, type TeraHacOptions, type TeraHacResult } from "./terahac.js";
 //# sourceMappingURL=index.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/indexed/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,KAAK,UAAU,EAAE,KAAK,SAAS,EAAE,kBAAkB,EAAE,MAAM,UAAU,CAAC;AAC/E,OAAO,EAAE,KAAK,sBAAsB,EAAE,oBAAoB,EAAE,MAAM,uBAAuB,CAAC;AAC1F,OAAO,EAAE,mBAAmB,EAAE,KAAK,WAAW,EAAE,yBAAyB,EAAE,MAAM,iBAAiB,CAAC;AACnG,OAAO,EAAE,QAAQ,EAAE,KAAK,WAAW,EAAE,KAAK,UAAU,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AACzG,OAAO,EAAE,IAAI,EAAE,KAAK,WAAW,EAAE,KAAK,UAAU,EAAE,MAAM,WAAW,CAAC;AACpE,OAAO,EAAE,KAAK,cAAc,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC;AACtE,OAAO,EAAE,cAAc,EAAE,KAAK,WAAW,EAAE,KAAK,UAAU,EAAE,MAAM,WAAW,CAAC;AAC9E,OAAO,EAAE,OAAO,EAAE,KAAK,cAAc,EAAE,KAAK,aAAa,EAAE,MAAM,cAAc,CAAC;AAChF,OAAO,EAAE,UAAU,EAAE,KAAK,UAAU,EAAE,KAAK,SAAS,EAAE,MAAM,UAAU,CAAC;AACvE,OAAO,EAAE,QAAQ,EAAE,KAAK,eAAe,EAAE,KAAK,cAAc,EAAE,MAAM,eAAe,CAAC;AACpF,OAAO,EAAE,WAAW,EAAE,cAAc,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/indexed/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,oBAAoB,EAAE,sBAAsB,EAAE,KAAK,WAAW,EAAE,KAAK,UAAU,EAAE,MAAM,gBAAgB,CAAC;AACjH,OAAO,EAAE,WAAW,EAAE,KAAK,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AACxE,OAAO,EACH,qBAAqB,EACrB,KAAK,kBAAkB,EACvB,yBAAyB,EACzB,KAAK,sBAAsB,EAC3B,KAAK,gBAAgB,EACrB,KAAK,YAAY,GACpB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EACH,KAAK,cAAc,EACnB,KAAK,UAAU,EACf,KAAK,SAAS,EACd,kBAAkB,EAClB,qBAAqB,EACrB,KAAK,4BAA4B,GACpC,MAAM,UAAU,CAAC;AAClB,OAAO,EAAE,KAAK,gBAAgB,EAAE,KAAK,eAAe,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC1F,OAAO,EAAE,mBAAmB,EAAE,KAAK,gBAAgB,EAAE,uBAAuB,EAAE,MAAM,gBAAgB,CAAC;AACrG,OAAO,EAAE,KAAK,sBAAsB,EAAE,oBAAoB,EAAE,MAAM,uBAAuB,CAAC;AAC1F,OAAO,EAAE,mBAAmB,EAAE,KAAK,WAAW,EAAE,yBAAyB,EAAE,MAAM,iBAAiB,CAAC;AACnG,OAAO,EAAE,gBAAgB,EAAE,KAAK,uBAAuB,EAAE,MAAM,aAAa,CAAC;AAC7E,OAAO,EACH,aAAa,EACb,KAAK,2BAA2B,EAChC,KAAK,0BAA0B,EAC/B,qBAAqB,GACxB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,gBAAgB,EAAE,KAAK,UAAU,EAAE,KAAK,SAAS,EAAE,QAAQ,EAAE,eAAe,EAAE,MAAM,UAAU,CAAC;AACxG,OAAO,EAAE,QAAQ,EAAE,KAAK,WAAW,EAAE,KAAK,UAAU,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AACzG,OAAO,EAAE,qBAAqB,EAAE,KAAK,kBAAkB,EAAE,KAAK,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AAC1G,OAAO,EACH,KAAK,oBAAoB,EACzB,oBAAoB,EACpB,OAAO,EACP,KAAK,cAAc,EACnB,KAAK,aAAa,EAClB,KAAK,YAAY,EACjB,QAAQ,GACX,MAAM,WAAW,CAAC;AACnB,OAAO,EAAE,YAAY,EAAE,KAAK,mBAAmB,EAAE,KAAK,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AACrG,OAAO,EAAE,KAAK,EAAE,KAAK,YAAY,EAAE,KAAK,YAAY,EAAE,KAAK,WAAW,EAAE,KAAK,UAAU,EAAE,MAAM,YAAY,CAAC;AAC5G,OAAO,EACH,sBAAsB,EACtB,KAAK,mBAAmB,EACxB,KAAK,kBAAkB,EACvB,KAAK,OAAO,GACf,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,IAAI,EAAE,KAAK,WAAW,EAAE,KAAK,UAAU,EAAE,MAAM,WAAW,CAAC;AACpE,OAAO,EACH,mBAAmB,EACnB,iBAAiB,EACjB,KAAK,kBAAkB,EACvB,KAAK,iBAAiB,GACzB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,KAAK,cAAc,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC;AACtE,OAAO,EAAE,cAAc,EAAE,KAAK,WAAW,EAAE,KAAK,UAAU,EAAE,MAAM,WAAW,CAAC;AAC9E,OAAO,EACH,gBAAgB,EAChB,KAAK,uBAAuB,EAC5B,KAAK,sBAAsB,EAC3B,8BAA8B,EAC9B,2BAA2B,EAC3B,KAAK,kCAAkC,GAC1C,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,MAAM,EAAE,KAAK,aAAa,EAAE,KAAK,YAAY,EAAE,MAAM,aAAa,CAAC;AAC5E,OAAO,EACH,kBAAkB,EAClB,oBAAoB,EACpB,eAAe,EACf,KAAK,gBAAgB,EACrB,uBAAuB,EACvB,yBAAyB,EACzB,oCAAoC,EACpC,kBAAkB,EAClB,uBAAuB,EACvB,iCAAiC,EACjC,uBAAuB,EACvB,KAAK,qBAAqB,EAC1B,KAAK,qBAAqB,EAC1B,KAAK,oBAAoB,EACzB,KAAK,SAAS,GACjB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EAAE,OAAO,EAAE,KAAK,cAAc,EAAE,KAAK,aAAa,EAAE,MAAM,cAAc,CAAC;AAChF,OAAO,EAAE,gBAAgB,EAAE,KAAK,aAAa,EAAE,KAAK,YAAY,EAAE,MAAM,aAAa,CAAC;AACtF,OAAO,EACH,KAAK,wBAAwB,EAC7B,KAAK,uBAAuB,EAC5B,uBAAuB,EACvB,wBAAwB,GAC3B,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,YAAY,EAAE,KAAK,aAAa,EAAE,WAAW,EAAE,KAAK,kBAAkB,EAAE,MAAM,cAAc,CAAC;AACtG,OAAO,EAAE,UAAU,EAAE,KAAK,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AACrE,OAAO,EAAE,UAAU,EAAE,KAAK,UAAU,EAAE,KAAK,SAAS,EAAE,OAAO,EAAE,KAAK,WAAW,EAAE,KAAK,UAAU,EAAE,MAAM,UAAU,CAAC;AACnH,OAAO,EAAE,QAAQ,EAAE,KAAK,eAAe,EAAE,KAAK,cAAc,EAAE,oBAAoB,EAAE,MAAM,eAAe,CAAC;AAC1G,OAAO,EAAE,KAAK,EAAE,KAAK,WAAW,EAAE,qBAAqB,EAAE,KAAK,WAAW,EAAE,KAAK,UAAU,EAAE,MAAM,qBAAqB,CAAC;AACxH,OAAO,EAAE,YAAY,EAAE,KAAK,kBAAkB,EAAE,2BAA2B,EAAE,MAAM,UAAU,CAAC;AAC9F,OAAO,EAAE,KAAK,aAAa,EAAE,kBAAkB,EAAE,KAAK,eAAe,EAAE,KAAK,cAAc,EAAE,MAAM,eAAe,CAAC;AAClH,OAAO,EAAE,WAAW,EAAE,cAAc,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAClF,OAAO,EAAE,cAAc,EAAE,KAAK,qBAAqB,EAAE,KAAK,oBAAoB,EAAE,MAAM,WAAW,CAAC;AAClG,OAAO,EAAE,OAAO,EAAE,KAAK,cAAc,EAAE,KAAK,aAAa,EAAE,MAAM,cAAc,CAAC"}

package/dist/src/indexed/index.js

@@ -12,15 +12,41 @@
  *   promises. It is exported flat too.
  * @module
  */
-export { breadthFirstSearch } from "./bfs.js";
+export { allPairsShortestPath, APSP_DEFAULT_MAX_NODES } from "./all-pairs.js";
+export { bellmanFord } from "./bellman-ford.js";
+export { betweennessCentrality, edgeBetweennessCentrality, } from "./betweenness.js";
+export { breadthFirstSearch, directionOptimizedBfs, } from "./bfs.js";
+export { isBipartite } from "./bipartite.js";
+export { closenessCentrality, nodeClosenessCentrality } from "./closeness.js";
 export { commonNeighborsScore } from "./common-neighbors.js";
 export { connectedComponents, weaklyConnectedComponents } from "./components.js";
+export { degreeCentrality } from "./degree.js";
+export { DeltaPageRank, PriorityDeltaPageRank, } from "./delta-pagerank.js";
+export { depthFirstSearch, hasCycle, topologicalSort } from "./dfs.js";
 export { dijkstra, walkPredArcs, walkPredEdges } from "./dijkstra.js";
+export { eigenvectorCentrality } from "./eigenvector.js";
+export { bipartiteFlowNetwork, maxFlow, minSTCut, } from "./flow.js";
+export { girvanNewman } from "./girvan-newman.js";
+export { grsbm } from "./grsbm.js";
+export { hierarchicalClustering, } from "./hierarchical.js";
 export { hits } from "./hits.js";
+export { findAllIsomorphisms, isGraphIsomorphic, } from "./isomorphism.js";
 export { kCoreDecomposition } from "./k-core.js";
 export { katzCentrality } from "./katz.js";
+export { labelPropagation, labelPropagationSemiSupervised, labelPropagationSynchronous, } from "./label-propagation.js";
+export { leiden } from "./leiden.js";
+export { adamicAdarForPairs, adamicAdarPrediction, adamicAdarScore, commonNeighborsForPairs, commonNeighborsPrediction, compareAdamicAdarWithCommonNeighbors, evaluateAdamicAdar, evaluateCommonNeighbors, getTopAdamicAdarCandidatesForNode, getTopCandidatesForNode, } from "./link-prediction.js";
 export { louvain } from "./louvain.js";
-export { kruskalMST } from "./mst.js";
-export { pageRank } from "./pagerank.js";
+export { markovClustering } from "./markov.js";
+export { greedyBipartiteMatching, maximumBipartiteMatching, } from "./matching.js";
+export { kargerMinCut, stoerWagner } from "./min-cut.js";
+export { modularity } from "./modularity.js";
+export { kruskalMST, primMST } from "./mst.js";
+export { pageRank, personalizedPageRank } from "./pagerank.js";
+export { astar, bidirectionalDijkstra } from "./point-to-point.js";
+export { condensation, stronglyConnectedComponents } from "./scc.js";
+export { spectralClustering } from "./spectral.js";
 export { arcSourceIn, IndexedMinHeap, IntUnionFind } from "./structures/index.js";
+export { syncClustering } from "./sync.js";
+export { teraHAC } from "./terahac.js";
 //# sourceMappingURL=index.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/indexed/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAmC,kBAAkB,EAAE,MAAM,UAAU,CAAC;AAC/E,OAAO,EAA+B,oBAAoB,EAAE,MAAM,uBAAuB,CAAC;AAC1F,OAAO,EAAE,mBAAmB,EAAoB,yBAAyB,EAAE,MAAM,iBAAiB,CAAC;AACnG,OAAO,EAAE,QAAQ,EAAqC,YAAY,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AACzG,OAAO,EAAE,IAAI,EAAqC,MAAM,WAAW,CAAC;AACpE,OAAO,EAAuB,kBAAkB,EAAE,MAAM,aAAa,CAAC;AACtE,OAAO,EAAE,cAAc,EAAqC,MAAM,WAAW,CAAC;AAC9E,OAAO,EAAE,OAAO,EAA2C,MAAM,cAAc,CAAC;AAChF,OAAO,EAAE,UAAU,EAAmC,MAAM,UAAU,CAAC;AACvE,OAAO,EAAE,QAAQ,EAA6C,MAAM,eAAe,CAAC;AACpF,OAAO,EAAE,WAAW,EAAE,cAAc,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/indexed/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,oBAAoB,EAAE,sBAAsB,EAAqC,MAAM,gBAAgB,CAAC;AACjH,OAAO,EAAE,WAAW,EAA0B,MAAM,mBAAmB,CAAC;AACxE,OAAO,EACH,qBAAqB,EAErB,yBAAyB,GAI5B,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAIH,kBAAkB,EAClB,qBAAqB,GAExB,MAAM,UAAU,CAAC;AAClB,OAAO,EAA+C,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC1F,OAAO,EAAE,mBAAmB,EAAyB,uBAAuB,EAAE,MAAM,gBAAgB,CAAC;AACrG,OAAO,EAA+B,oBAAoB,EAAE,MAAM,uBAAuB,CAAC;AAC1F,OAAO,EAAE,mBAAmB,EAAoB,yBAAyB,EAAE,MAAM,iBAAiB,CAAC;AACnG,OAAO,EAAE,gBAAgB,EAAgC,MAAM,aAAa,CAAC;AAC7E,OAAO,EACH,aAAa,EAGb,qBAAqB,GACxB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,gBAAgB,EAAmC,QAAQ,EAAE,eAAe,EAAE,MAAM,UAAU,CAAC;AACxG,OAAO,EAAE,QAAQ,EAAqC,YAAY,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AACzG,OAAO,EAAE,qBAAqB,EAAmD,MAAM,kBAAkB,CAAC;AAC1G,OAAO,EAEH,oBAAoB,EACpB,OAAO,EAIP,QAAQ,GACX,MAAM,WAAW,CAAC;AACnB,OAAO,EAAE,YAAY,EAAqD,MAAM,oBAAoB,CAAC;AACrG,OAAO,EAAE,KAAK,EAA2E,MAAM,YAAY,CAAC;AAC5G,OAAO,EACH,sBAAsB,GAIzB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,IAAI,EAAqC,MAAM,WAAW,CAAC;AACpE,OAAO,EACH,mBAAmB,EACnB,iBAAiB,GAGpB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAuB,kBAAkB,EAAE,MAAM,aAAa,CAAC;AACtE,OAAO,EAAE,cAAc,EAAqC,MAAM,WAAW,CAAC;AAC9E,OAAO,EACH,gBAAgB,EAGhB,8BAA8B,EAC9B,2BAA2B,GAE9B,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,MAAM,EAAyC,MAAM,aAAa,CAAC;AAC5E,OAAO,EACH,kBAAkB,EAClB,oBAAoB,EACpB,eAAe,EAEf,uBAAuB,EACvB,yBAAyB,EACzB,oCAAoC,EACpC,kBAAkB,EAClB,uBAAuB,EACvB,iCAAiC,EACjC,uBAAuB,GAK1B,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EAAE,OAAO,EAA2C,MAAM,cAAc,CAAC;AAChF,OAAO,EAAE,gBAAgB,EAAyC,MAAM,aAAa,CAAC;AACtF,OAAO,EAGH,uBAAuB,EACvB,wBAAwB,GAC3B,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,YAAY,EAAsB,WAAW,EAA2B,MAAM,cAAc,CAAC;AACtG,OAAO,EAAE,UAAU,EAA0B,MAAM,iBAAiB,CAAC;AACrE,OAAO,EAAE,UAAU,EAAmC,OAAO,EAAqC,MAAM,UAAU,CAAC;AACnH,OAAO,EAAE,QAAQ,EAA6C,oBAAoB,EAAE,MAAM,eAAe,CAAC;AAC1G,OAAO,EAAE,KAAK,EAAoB,qBAAqB,EAAqC,MAAM,qBAAqB,CAAC;AACxH,OAAO,EAAE,YAAY,EAA2B,2BAA2B,EAAE,MAAM,UAAU,CAAC;AAC9F,OAAO,EAAsB,kBAAkB,EAA6C,MAAM,eAAe,CAAC;AAClH,OAAO,EAAE,WAAW,EAAE,cAAc,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAClF,OAAO,EAAE,cAAc,EAAyD,MAAM,WAAW,CAAC;AAClG,OAAO,EAAE,OAAO,EAA2C,MAAM,cAAc,CAAC"}

package/dist/src/indexed/isomorphism.d.ts

@@ -0,0 +1,42 @@
+import { type GraphSnapshot, type U32 } from "@graphty/graph-format";
+/** Options of {@link isGraphIsomorphic} and {@link findAllIsomorphisms}. @public */
+export interface IsomorphismOptions {
+    /** Whether node `i1` of `s1` may map to node `i2` of `s2`. */
+    readonly nodeMatch?: ((i1: number, i2: number, s1: GraphSnapshot, s2: GraphSnapshot) => boolean) | undefined;
+    /**
+     * Whether logical edge `e1` of `s1` may map to logical edge `e2` of `s2`. Called once for every
+     * pair of adjacent nodes, when the second of them is mapped, and once for a self-loop, when its
+     * node is mapped; between parallel edges it sees the lowest edge index. On a directed snapshot
+     * it sees every arc, whichever end is mapped last.
+     */
+    readonly edgeMatch?: ((e1: number, e2: number, s1: GraphSnapshot, s2: GraphSnapshot) => boolean) | undefined;
+}
+/** Result of {@link isGraphIsomorphic}. @public */
+export interface IsomorphismResult {
+    /** Whether the two graphs are isomorphic. */
+    readonly isomorphic: boolean;
+    /** The image in `s2` of every node of `s1`; null when not isomorphic. */
+    readonly mapping: U32 | null;
+}
+/**
+ * Whether two snapshots are isomorphic, by a VF2-style search. Neighbourhoods are simple-graph:
+ * parallel arcs count once and a self-loop maps only to a self-loop. On a directed snapshot both
+ * arc directions are preserved.
+ * @param s1 - The first graph
+ * @param s2 - The second graph
+ * @param options - Node and edge match predicates
+ * @returns Whether an isomorphism exists and, when it does, the first one found
+ * @public
+ */
+export declare function isGraphIsomorphic(s1: GraphSnapshot, s2: GraphSnapshot, options?: IsomorphismOptions): IsomorphismResult;
+/**
+ * Every isomorphism from `s1` to `s2`, with the neighbourhood rules of {@link isGraphIsomorphic}.
+ * Two empty graphs have one, the empty mapping.
+ * @param s1 - The first graph
+ * @param s2 - The second graph
+ * @param options - Node and edge match predicates
+ * @returns One array per isomorphism: the image in `s2` of every node of `s1`
+ * @public
+ */
+export declare function findAllIsomorphisms(s1: GraphSnapshot, s2: GraphSnapshot, options?: IsomorphismOptions): U32[];
+//# sourceMappingURL=isomorphism.d.ts.map

package/dist/src/indexed/isomorphism.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"isomorphism.d.ts","sourceRoot":"","sources":["../../../src/indexed/isomorphism.ts"],"names":[],"mappings":"AAAA,OAAO,EAAsB,KAAK,aAAa,EAAiB,KAAK,GAAG,EAAE,MAAM,uBAAuB,CAAC;AAExG,oFAAoF;AACpF,MAAM,WAAW,kBAAkB;IAC/B,8DAA8D;IAC9D,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,aAAa,EAAE,EAAE,EAAE,aAAa,KAAK,OAAO,CAAC,GAAG,SAAS,CAAC;IAC7G;;;;;OAKG;IACH,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,aAAa,EAAE,EAAE,EAAE,aAAa,KAAK,OAAO,CAAC,GAAG,SAAS,CAAC;CAChH;AAED,mDAAmD;AACnD,MAAM,WAAW,iBAAiB;IAC9B,6CAA6C;IAC7C,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;IAC7B,yEAAyE;IACzE,QAAQ,CAAC,OAAO,EAAE,GAAG,GAAG,IAAI,CAAC;CAChC;AAoPD;;;;;;;;;GASG;AACH,wBAAgB,iBAAiB,CAC7B,EAAE,EAAE,aAAa,EACjB,EAAE,EAAE,aAAa,EACjB,OAAO,GAAE,kBAAuB,GACjC,iBAAiB,CAOnB;AAED;;;;;;;;GAQG;AACH,wBAAgB,mBAAmB,CAAC,EAAE,EAAE,aAAa,EAAE,EAAE,EAAE,aAAa,EAAE,OAAO,GAAE,kBAAuB,GAAG,GAAG,EAAE,CAOjH"}