@graphty/algorithms 2.0.6 → 2.1.0

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

@@ -0,0 +1 @@
+{"version":3,"file":"katz.js","sourceRoot":"","sources":["../../../src/indexed/katz.ts"],"names":[],"mappings":"AA4BA;;;;;;;;;;GAUG;AACH,MAAM,UAAU,cAAc,CAAC,CAAgB,EAAE,IAAiB,EAAE;IAChE,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;IACtB,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,GAAG,CAAC;IAC7B,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC;IACzB,MAAM,OAAO,GAAG,CAAC,CAAC,aAAa,IAAI,GAAG,CAAC;IACvC,MAAM,GAAG,GAAG,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC;IAChC,MAAM,GAAG,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC;IACxB,MAAM,OAAO,GAAG,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC;IACzD,IAAI,GAAG,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,IAAI,IAAI,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAC/B,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,SAAS,GAAG,KAAK,CAAC;IACtB,OAAO,EAAE,GAAG,OAAO,IAAI,CAAC,SAAS,EAAE,EAAE,EAAE,EAAE,CAAC;QACtC,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9B,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YACpE,CAAC;YACD,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,GAAG,GAAG,IAAI,CAAC;YAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACxC,IAAI,IAAI,GAAG,OAAO,EAAE,CAAC;gBACjB,OAAO,GAAG,IAAI,CAAC;YACnB,CAAC;QACL,CAAC;QACD,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC1B,SAAS,GAAG,OAAO,GAAG,GAAG,CAAC;IAC9B,CAAC;IACD,IAAI,CAAC,CAAC,UAAU,KAAK,KAAK,EAAE,CAAC;QACzB,IAAI,GAAG,GAAG,QAAQ,CAAC;QACnB,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC;gBACf,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACjB,CAAC;YACD,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC;gBACf,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACjB,CAAC;QACL,CAAC;QACD,MAAM,KAAK,GAAG,GAAG,GAAG,GAAG,CAAC;QACxB,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC;YACpC,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC;AACtD,CAAC"}

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

@@ -0,0 +1,33 @@
+import { type GraphSnapshot } from "@graphty/graph-format";
+import { type LabelResult } from "./components.js";
+/** Options of the index-based Louvain, matching the legacy `louvain`. @public */
+export interface LouvainOptions {
+    /** Resolution gamma: above 1 favours smaller communities; default 1. */
+    readonly resolution?: number | undefined;
+    /** Cap on aggregation levels, and on node visits per node within a level; default 100. */
+    readonly maxIterations?: number | undefined;
+    /** Stop when a level improves modularity by less than this; default 1e-6. */
+    readonly tolerance?: number | undefined;
+}
+/** Result of the index-based Louvain: a partition plus the modularity it reaches. @public */
+export interface LouvainResult extends LabelResult {
+    /** Modularity of the returned partition, at the requested resolution. */
+    readonly modularity: number;
+    /** Aggregation levels that improved the partition. */
+    readonly iterations: number;
+}
+/**
+ * Louvain community detection over a snapshot: local moving to the best modularity gain, then
+ * collapse each community into a node and repeat, until a level stops paying for itself.
+ *
+ * The legacy `louvain` switches implementation at 50 nodes (`useOptimized`) and its small-graph
+ * path has no aggregation phase at all, so this port is not move-for-move identical to either
+ * branch of it -- what it guarantees is a partition whose modularity is at least as high, measured
+ * by the same formula.
+ * @param s - An undirected snapshot
+ * @param o - Algorithm options
+ * @returns The partition, its modularity, and the number of levels that improved it
+ * @public
+ */
+export declare function louvain(s: GraphSnapshot, o?: LouvainOptions): LouvainResult;
+//# sourceMappingURL=louvain.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"louvain.d.ts","sourceRoot":"","sources":["../../../src/indexed/louvain.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,aAAa,EAAqB,MAAM,uBAAuB,CAAC;AAE9E,OAAO,EAAE,KAAK,WAAW,EAAc,MAAM,iBAAiB,CAAC;AAE/D,iFAAiF;AACjF,MAAM,WAAW,cAAc;IAC3B,wEAAwE;IACxE,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACzC,0FAA0F;IAC1F,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC5C,6EAA6E;IAC7E,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CAC3C;AAED,6FAA6F;AAC7F,MAAM,WAAW,aAAc,SAAQ,WAAW;IAC9C,yEAAyE;IACzE,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,sDAAsD;IACtD,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC/B;AAyQD;;;;;;;;;;;;GAYG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,GAAE,cAAmB,GAAG,aAAa,CA8C/E"}

package/dist/src/indexed/louvain.js

@@ -0,0 +1,301 @@
+import { renumberPartition } from "@graphty/graph-format";
+import { withGroups } from "./components.js";
+/**
+ * Level 0: the snapshot's own arcs, with the self-loop arcs moved into `loop`.
+ * @param s - An undirected snapshot
+ * @returns The first level
+ */
+function buildLevel0(s) {
+    const n = s.nodeCount;
+    const rowPtr = new Uint32Array(n + 1);
+    for (let u = 0; u < n; u++) {
+        let kept = 0;
+        const end = s.rowPtr[u + 1];
+        for (let a = s.rowPtr[u]; a < end; a++) {
+            if (s.colIdx[a] !== u) {
+                kept++;
+            }
+        }
+        rowPtr[u + 1] = rowPtr[u] + kept;
+    }
+    const arcs = rowPtr[n];
+    const colIdx = new Uint32Array(arcs);
+    const w = new Float64Array(arcs);
+    const loop = new Float64Array(n);
+    const deg = new Float64Array(n);
+    let k = 0;
+    for (let u = 0; u < n; u++) {
+        let rowWeight = 0;
+        const end = s.rowPtr[u + 1];
+        for (let a = s.rowPtr[u]; a < end; a++) {
+            const v = s.colIdx[a];
+            const weight = s.weights === null ? 1 : s.weights[a];
+            if (v === u) {
+                loop[u] += weight;
+            }
+            else {
+                colIdx[k] = v;
+                w[k] = weight;
+                k++;
+                rowWeight += weight;
+            }
+        }
+        deg[u] = rowWeight + 2 * loop[u];
+    }
+    return { n, rowPtr, colIdx, w, loop, deg };
+}
+/**
+ * Modularity of a partition of one level: `sum_c in_c / 2m - gamma * (tot_c / 2m)^2`, with `in_c`
+ * counting each internal edge twice. This is the same quantity the legacy `calculateModularity`
+ * computes over a `Graph`, written per arc.
+ * @param level - The level the partition is over
+ * @param comm - Community of every node of that level
+ * @param count - Number of communities, so `comm` is within `[0, count)`
+ * @param resolution - Resolution gamma
+ * @param m2 - Twice the total edge weight
+ * @returns The modularity
+ */
+function modularityOf(level, comm, count, resolution, m2) {
+    const inside = new Float64Array(count);
+    const tot = new Float64Array(count);
+    for (let u = 0; u < level.n; u++) {
+        const c = comm[u];
+        tot[c] += level.deg[u];
+        inside[c] += 2 * level.loop[u];
+        const end = level.rowPtr[u + 1];
+        for (let a = level.rowPtr[u]; a < end; a++) {
+            if (comm[level.colIdx[a]] === c) {
+                inside[c] += level.w[a];
+            }
+        }
+    }
+    let q = 0;
+    for (let c = 0; c < count; c++) {
+        const share = tot[c] / m2;
+        q += inside[c] / m2 - resolution * share * share;
+    }
+    return q;
+}
+/**
+ * Phase one: move each node to the neighbouring community with the largest modularity gain, until
+ * no move is left to make.
+ *
+ * Nodes wait in a queue rather than in repeated sweeps over all of them, which is what makes this
+ * affordable on a graph with no community structure: there the last moves are worth a millionth of
+ * a point each and go on for dozens of passes, and a pass costs every node and every arc whether or
+ * not anything can move. A node enters the queue when a neighbour leaves its community, so the tail
+ * of the run costs the handful of nodes that can still move. Same fixed point, and it is the rule
+ * networkx's `louvain_communities` follows.
+ * @param level - The level to optimise
+ * @param comm - Output: community of every node, overwritten with the singleton partition first
+ * @param resolution - Resolution gamma
+ * @param m2 - Twice the total edge weight
+ * @param maxVisitsPerNode - Cap on node visits, as a multiple of the node count
+ * @returns Whether any node moved
+ */
+function localMove(level, comm, resolution, m2, maxVisitsPerNode) {
+    const { n } = level;
+    const tot = new Float64Array(n);
+    for (let u = 0; u < n; u++) {
+        comm[u] = u;
+        tot[u] = level.deg[u];
+    }
+    const acc = new Float64Array(n);
+    // A visit stamp rather than a clear pass: `mark` grows monotonically over the whole run, so a
+    // value left in acc by an earlier visit is never mistaken for this one's.
+    const stamp = new Int32Array(n).fill(-1);
+    const touched = new Uint32Array(n);
+    // A ring of n + 1 slots: `queued` keeps a node out of the queue twice, so n entries is the most
+    // that can be waiting.
+    const capacity = n + 1;
+    const queue = new Uint32Array(capacity);
+    const queued = new Uint8Array(n);
+    let head = 0;
+    let tail = n;
+    for (let u = 0; u < n; u++) {
+        queue[u] = u;
+        queued[u] = 1;
+    }
+    let mark = 0;
+    let visits = 0;
+    const maxVisits = maxVisitsPerNode * n;
+    let movedAny = false;
+    while (head !== tail && visits < maxVisits) {
+        const u = queue[head];
+        head = head + 1 === capacity ? 0 : head + 1;
+        queued[u] = 0;
+        visits++;
+        const cu = comm[u];
+        const ku = level.deg[u];
+        tot[cu] -= ku;
+        mark++;
+        let cnt = 0;
+        const end = level.rowPtr[u + 1];
+        for (let a = level.rowPtr[u]; a < end; a++) {
+            const c = comm[level.colIdx[a]];
+            if (stamp[c] !== mark) {
+                stamp[c] = mark;
+                acc[c] = 0;
+                touched[cnt++] = c;
+            }
+            acc[c] += level.w[a];
+        }
+        let best = cu;
+        let bestGain = (stamp[cu] === mark ? acc[cu] : 0) - (resolution * ku * tot[cu]) / m2;
+        for (let i = 0; i < cnt; i++) {
+            const c = touched[i];
+            if (c === cu) {
+                continue;
+            }
+            const gain = acc[c] - (resolution * ku * tot[c]) / m2;
+            if (gain > bestGain) {
+                bestGain = gain;
+                best = c;
+            }
+        }
+        tot[best] += ku;
+        if (best !== cu) {
+            comm[u] = best;
+            movedAny = true;
+            // Only a neighbour outside the community u just joined can gain from u's move.
+            for (let a = level.rowPtr[u]; a < end; a++) {
+                const v = level.colIdx[a];
+                if (queued[v] === 0 && comm[v] !== best) {
+                    queued[v] = 1;
+                    queue[tail] = v;
+                    tail = tail + 1 === capacity ? 0 : tail + 1;
+                }
+            }
+        }
+    }
+    return movedAny;
+}
+/**
+ * Phase two: every community becomes one node, the edges between two communities merge into one
+ * arc, and the edges inside a community become that node's self-loop. Rows are NOT sorted by
+ * neighbour index; nothing downstream of here needs them to be.
+ * @param level - The level to collapse
+ * @param comm - Dense community of every node of that level
+ * @param count - Number of communities
+ * @returns The next level, with `count` nodes
+ */
+function aggregate(level, comm, count) {
+    const start = new Uint32Array(count + 1);
+    for (let u = 0; u < level.n; u++) {
+        start[comm[u] + 1]++;
+    }
+    for (let c = 0; c < count; c++) {
+        start[c + 1] += start[c];
+    }
+    const members = new Uint32Array(level.n);
+    const fill = start.slice(0, count);
+    for (let u = 0; u < level.n; u++) {
+        members[fill[comm[u]]++] = u;
+    }
+    const rowPtr = new Uint32Array(count + 1);
+    const colIdx = new Uint32Array(level.colIdx.length);
+    const w = new Float64Array(level.colIdx.length);
+    const loop = new Float64Array(count);
+    const deg = new Float64Array(count);
+    const acc = new Float64Array(count);
+    const stamp = new Int32Array(count).fill(-1);
+    const touched = new Uint32Array(count);
+    let k = 0;
+    for (let c = 0; c < count; c++) {
+        rowPtr[c] = k;
+        let internalArcs = 0;
+        let cnt = 0;
+        for (let i = start[c]; i < start[c + 1]; i++) {
+            const u = members[i];
+            loop[c] += level.loop[u];
+            const end = level.rowPtr[u + 1];
+            for (let a = level.rowPtr[u]; a < end; a++) {
+                const other = comm[level.colIdx[a]];
+                if (other === c) {
+                    internalArcs += level.w[a];
+                    continue;
+                }
+                if (stamp[other] !== c) {
+                    stamp[other] = c;
+                    acc[other] = 0;
+                    touched[cnt++] = other;
+                }
+                acc[other] += level.w[a];
+            }
+        }
+        // An edge between two members shows up as two arcs, one from each end.
+        loop[c] += internalArcs / 2;
+        let rowWeight = 0;
+        for (let i = 0; i < cnt; i++) {
+            const other = touched[i];
+            colIdx[k] = other;
+            w[k] = acc[other];
+            rowWeight += acc[other];
+            k++;
+        }
+        deg[c] = rowWeight + 2 * loop[c];
+    }
+    rowPtr[count] = k;
+    return { n: count, rowPtr, colIdx: colIdx.subarray(0, k), w: w.subarray(0, k), loop, deg };
+}
+/**
+ * Louvain community detection over a snapshot: local moving to the best modularity gain, then
+ * collapse each community into a node and repeat, until a level stops paying for itself.
+ *
+ * The legacy `louvain` switches implementation at 50 nodes (`useOptimized`) and its small-graph
+ * path has no aggregation phase at all, so this port is not move-for-move identical to either
+ * branch of it -- what it guarantees is a partition whose modularity is at least as high, measured
+ * by the same formula.
+ * @param s - An undirected snapshot
+ * @param o - Algorithm options
+ * @returns The partition, its modularity, and the number of levels that improved it
+ * @public
+ */
+export function louvain(s, o = {}) {
+    if (s.directed) {
+        throw new Error("Louvain requires an undirected graph. Pass s.toUndirected().snapshot.");
+    }
+    const resolution = o.resolution ?? 1;
+    const maxIterations = o.maxIterations ?? 100;
+    const tolerance = o.tolerance ?? 1e-6;
+    const n0 = s.nodeCount;
+    const labels = new Uint32Array(n0);
+    for (let u = 0; u < n0; u++) {
+        labels[u] = u;
+    }
+    let level = buildLevel0(s);
+    let m2 = 0;
+    for (let u = 0; u < n0; u++) {
+        m2 += level.deg[u];
+    }
+    if (m2 === 0) {
+        // No edge weight to redistribute: every node is its own community and Q is 0 by definition,
+        // which is what the legacy `calculateModularity` also answers.
+        return { ...withGroups(labels, n0), modularity: 0, iterations: 0 };
+    }
+    let q = modularityOf(level, labels, n0, resolution, m2);
+    let iterations = 0;
+    for (let iteration = 0; iteration < maxIterations; iteration++) {
+        const comm = new Uint32Array(level.n);
+        if (!localMove(level, comm, resolution, m2, maxIterations)) {
+            break;
+        }
+        const dense = renumberPartition(comm);
+        const { count } = dense;
+        const packed = dense.labels;
+        const newQ = modularityOf(level, packed, count, resolution, m2);
+        for (let u = 0; u < n0; u++) {
+            labels[u] = packed[labels[u]];
+        }
+        iterations = iteration + 1;
+        const gain = newQ - q;
+        q = newQ;
+        if (gain < tolerance || count === level.n) {
+            break;
+        }
+        level = aggregate(level, packed, count);
+    }
+    const final = renumberPartition(labels);
+    return { ...withGroups(final.labels, final.count), modularity: q, iterations };
+}
+//# sourceMappingURL=louvain.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"louvain.js","sourceRoot":"","sources":["../../../src/indexed/louvain.ts"],"names":[],"mappings":"AAAA,OAAO,EAAsB,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAE9E,OAAO,EAAoB,UAAU,EAAE,MAAM,iBAAiB,CAAC;AA0C/D;;;;GAIG;AACH,SAAS,WAAW,CAAC,CAAgB;IACjC,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;IACtB,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpB,IAAI,EAAE,CAAC;YACX,CAAC;QACL,CAAC;QACD,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACrC,CAAC;IACD,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC;IACrC,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC;IACjC,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IACjC,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAChC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACrD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACV,IAAI,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC;YACtB,CAAC;iBAAM,CAAC;gBACJ,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACd,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;gBACd,CAAC,EAAE,CAAC;gBACJ,SAAS,IAAI,MAAM,CAAC;YACxB,CAAC;QACL,CAAC;QACD,GAAG,CAAC,CAAC,CAAC,GAAG,SAAS,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC;IACD,OAAO,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;AAC/C,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,YAAY,CAAC,KAAY,EAAE,IAAiB,EAAE,KAAa,EAAE,UAAkB,EAAE,EAAU;IAChG,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC;IACvC,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC;IACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC9B,MAAM,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5B,CAAC;QACL,CAAC;IACL,CAAC;IACD,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QAC1B,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,UAAU,GAAG,KAAK,GAAG,KAAK,CAAC;IACrD,CAAC;IACD,OAAO,CAAC,CAAC;AACb,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,SAAS,SAAS,CAAC,KAAY,EAAE,IAAiB,EAAE,UAAkB,EAAE,EAAU,EAAE,gBAAwB;IACxG,MAAM,EAAE,CAAC,EAAE,GAAG,KAAK,CAAC;IACpB,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACZ,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAChC,8FAA8F;IAC9F,0EAA0E;IAC1E,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IACnC,gGAAgG;IAChG,uBAAuB;IACvB,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC;IACvB,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC;IACxC,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IACjC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACb,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAClB,CAAC;IACD,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,MAAM,SAAS,GAAG,gBAAgB,GAAG,CAAC,CAAC;IACvC,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,OAAO,IAAI,KAAK,IAAI,IAAI,MAAM,GAAG,SAAS,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QACtB,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;QAC5C,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACd,MAAM,EAAE,CAAC;QACT,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACxB,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QACd,IAAI,EAAE,CAAC;QACP,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;gBACpB,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;gBAChB,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACX,OAAO,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;YACvB,CAAC;YACD,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzB,CAAC;QACD,IAAI,IAAI,GAAG,EAAE,CAAC;QACd,IAAI,QAAQ,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,GAAG,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC;QACrF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;gBACX,SAAS;YACb,CAAC;YACD,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YACtD,IAAI,IAAI,GAAG,QAAQ,EAAE,CAAC;gBAClB,QAAQ,GAAG,IAAI,CAAC;gBAChB,IAAI,GAAG,CAAC,CAAC;YACb,CAAC;QACL,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAChB,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;YACd,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACf,QAAQ,GAAG,IAAI,CAAC;YAChB,+EAA+E;YAC/E,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC1B,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;oBACtC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBACd,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBAChB,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;gBAChD,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,QAAQ,CAAC;AACpB,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,SAAS,CAAC,KAAY,EAAE,IAAiB,EAAE,KAAa;IAC7D,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;IACzB,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;IACD,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACzC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACjC,CAAC;IACD,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IAC1C,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACpD,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAChD,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC;IACrC,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC;IACpC,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC;IACpC,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7C,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC;IACvC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACd,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpC,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;oBACd,YAAY,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC3B,SAAS;gBACb,CAAC;gBACD,IAAI,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;oBACrB,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;oBACjB,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;oBACf,OAAO,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC;gBAC3B,CAAC;gBACD,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7B,CAAC;QACL,CAAC;QACD,uEAAuE;QACvE,IAAI,CAAC,CAAC,CAAC,IAAI,YAAY,GAAG,CAAC,CAAC;QAC5B,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YAClB,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;YAClB,SAAS,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;YACxB,CAAC,EAAE,CAAC;QACR,CAAC;QACD,GAAG,CAAC,CAAC,CAAC,GAAG,SAAS,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC;IACD,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAClB,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;AAC/F,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,OAAO,CAAC,CAAgB,EAAE,IAAoB,EAAE;IAC5D,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QACb,MAAM,IAAI,KAAK,CAAC,uEAAuE,CAAC,CAAC;IAC7F,CAAC;IACD,MAAM,UAAU,GAAG,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC;IACrC,MAAM,aAAa,GAAG,CAAC,CAAC,aAAa,IAAI,GAAG,CAAC;IAC7C,MAAM,SAAS,GAAG,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC;IACtC,MAAM,EAAE,GAAG,CAAC,CAAC,SAAS,CAAC;IACvB,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,EAAE,CAAC,CAAC;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1B,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAClB,CAAC;IACD,IAAI,KAAK,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1B,EAAE,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QACX,4FAA4F;QAC5F,+DAA+D;QAC/D,OAAO,EAAE,GAAG,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;IACvE,CAAC;IACD,IAAI,CAAC,GAAG,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,CAAC,CAAC;IACxD,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,aAAa,EAAE,SAAS,EAAE,EAAE,CAAC;QAC7D,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACtC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,aAAa,CAAC,EAAE,CAAC;YACzD,MAAM;QACV,CAAC;QACD,MAAM,KAAK,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;QACtC,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC;QACxB,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;QAC5B,MAAM,IAAI,GAAG,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,EAAE,CAAC,CAAC;QAChE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1B,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,CAAC;QACD,UAAU,GAAG,SAAS,GAAG,CAAC,CAAC;QAC3B,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC;QACtB,CAAC,GAAG,IAAI,CAAC;QACT,IAAI,IAAI,GAAG,SAAS,IAAI,KAAK,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;YACxC,MAAM;QACV,CAAC;QACD,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IAC5C,CAAC;IACD,MAAM,KAAK,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC;IACxC,OAAO,EAAE,GAAG,UAAU,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC;AACnF,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@graphty/algorithms",
-  "version": "2.0.6",
+  "version": "2.1.0",
   "description": "Graph algorithms library for browser environments implemented in TypeScript",
   "author": "Adam Powers <apowers@ato.ms>",
   "main": "dist/algorithms.js",
@@ -68,13 +68,14 @@
     "@storybook/html-vite": "^9.0.11",
     "@storybook/test": "^8.6.14",
     "@types/benchmark": "^2.1.5",
+    "@vitest/browser-playwright": "4.1.11",
     "benchmark": "^2.1.4",
     "chromatic": "^11.0.0",
     "eslint": "^9.29.0",
     "eslint-plugin-simple-import-sort": "^12.1.1",
     "gh-pages": "^6.3.0",
     "globals": "^15.12.0",
-    "happy-dom": "^18.0.1",
+    "happy-dom": "^20.8.9",
     "knip": "^5.61.3",
     "playwright": "^1.53.0",
     "semantic-release": "^25.0.2",
@@ -88,11 +89,11 @@
     "typescript-eslint": "^8.34.1",
     "vite": "^7.0.5",
     "vitepress": "^1.6.3",
-    "vitest": "^3.2.4"
+    "vitest": "4.1.11"
   },
   "dependencies": {
     "typedfastbitset": "^0.6.1",
-    "@graphty/graph-format": "^1.0.7"
+    "@graphty/graph-format": "^1.1.0"
   },
   "peerDependencies": {
     "@graphty/graph-format": "^1.0.0"
@@ -135,7 +136,6 @@
     "examples:run": "node examples/run-all-examples.js",
     "examples:html": "npm run build:bundle && vite --port ${PORT:?start it through servherd, which sets PORT} --strictPort",
     "serve": "npm run build:bundle && vite --port ${PORT:?start it through servherd, which sets PORT} --strictPort",
-    "commit": "cz",
     "ready:commit": "npm run build && npm run lint && npm run test:all",
     "watch": "tsc --watch",
     "docs:api": "typedoc && node ../tools/sanitize-api-docs.js docs/api/generated",

package/src/algorithms/centrality/betweenness.ts

@@ -102,7 +102,7 @@ function accumulateBetweenness(
     // Process nodes in reverse BFS order
     for (let i = stack.length - 1; i >= 0; i--) {
         const w = stack[i];
-        if (!w) {
+        if (w === undefined) {
             continue;
         }
 
@@ -162,7 +162,7 @@ function accumulateEdgeBetweenness(
     // Process nodes in reverse BFS order
     for (let i = stack.length - 1; i >= 0; i--) {
         const w = stack[i];
-        if (!w) {
+        if (w === undefined) {
             continue;
         }
 

package/src/algorithms/community/girvan-newman.ts

@@ -226,7 +226,7 @@ function findAllShortestPaths(
     let queueIndex = 0;
     while (queueIndex < queue.length) {
         const current = queue[queueIndex++];
-        if (!current) {
+        if (current === undefined) {
             continue;
         }
 

package/src/algorithms/matching/isomorphism.ts

@@ -163,7 +163,7 @@ function getCandidatePairs(
     }
 
     // If not found, pick from in1
-    if (!node1) {
+    if (node1 === null) {
         for (const [n] of state.in1) {
             if (!state.core1.has(n)) {
                 node1 = n;
@@ -173,7 +173,7 @@ function getCandidatePairs(
     }
 
     // If still not found, pick any unmapped node
-    if (!node1) {
+    if (node1 === null) {
         for (const n of nodes1) {
             if (!state.core1.has(n)) {
                 node1 = n;
@@ -182,7 +182,7 @@ function getCandidatePairs(
         }
     }
 
-    if (!node1) {
+    if (node1 === null) {
         return pairs;
     }
 

package/src/algorithms/mst/prim.ts

@@ -26,7 +26,7 @@ export function primMST(graph: Graph, startNode?: NodeId): MSTResult {
     }
 
     const start = startNode ?? nodes[0]?.id;
-    if (!start) {
+    if (start === undefined) {
         return {
             edges: [],
             totalWeight: 0,

package/src/algorithms/shortest-path/bellman-ford.ts

@@ -109,7 +109,7 @@ export function bellmanFord(graph: Graph, source: NodeId, options: BellmanFordOp
         for (const arc of arcs) {
             const u = arc.from;
             const v = arc.to;
-            const {weight} = arc;
+            const { weight } = arc;
 
             const distanceU = distances.get(u);
             const distanceV = distances.get(v);
@@ -123,7 +123,7 @@ export function bellmanFord(graph: Graph, source: NodeId, options: BellmanFordOp
                     updated = true;
 
                     // Early termination if target reached
-                    if (options.target && v === options.target) {
+                    if (options.target !== undefined && v === options.target) {
                         break;
                     }
                 }
@@ -143,7 +143,7 @@ export function bellmanFord(graph: Graph, source: NodeId, options: BellmanFordOp
     for (const arc of arcs) {
         const u = arc.from;
         const v = arc.to;
-        const {weight} = arc;
+        const { weight } = arc;
 
         const distanceU = distances.get(u);
         const distanceV = distances.get(v);

package/src/algorithms/shortest-path/bidirectional-dijkstra.ts

@@ -200,7 +200,7 @@ export class BidirectionalDijkstra {
     }
 
     private reconstructPath(): NodeId[] {
-        if (!this.meetingNode) {
+        if (this.meetingNode === null) {
             return [];
         }
 

package/src/algorithms/shortest-path/dijkstra.ts

@@ -55,7 +55,7 @@ export function dijkstra(graph: Graph, source: NodeId, options: DijkstraOptions
         visited.add(currentNode);
 
         // Early termination if target reached
-        if (options.target && currentNode === options.target) {
+        if (options.target !== undefined && currentNode === options.target) {
             break;
         }
 

package/src/algorithms/traversal/bfs-unified.ts

@@ -89,7 +89,7 @@ function breadthFirstSearchStandard(graph: Graph, startNode: NodeId, options: Tr
         }
 
         // Early termination if target found
-        if (options.targetNode && current.node === options.targetNode) {
+        if (options.targetNode !== undefined && current.node === options.targetNode) {
             break;
         }
 
@@ -409,7 +409,7 @@ export function isBipartite(graph: Graph): boolean {
 
             while (queue.length > 0) {
                 const current = queue.shift();
-                if (!current) {
+                if (current === undefined) {
                     break;
                 }
 

package/src/algorithms/traversal/dfs.ts

@@ -86,7 +86,7 @@ function dfsIterative(
             }
 
             // Early termination if target found
-            if (options.targetNode && current.node === options.targetNode) {
+            if (options.targetNode !== undefined && current.node === options.targetNode) {
                 break;
             }
 
@@ -135,7 +135,7 @@ function dfsRecursive(
         }
 
         // Early termination if target found
-        if (options.targetNode && node === options.targetNode) {
+        if (options.targetNode !== undefined && node === options.targetNode) {
             return;
         }
     }

package/src/clustering/spectral.ts

@@ -102,7 +102,7 @@ export function spectralClustering(graph: Graph, options: SpectralClusteringOpti
     for (let i = 0; i < nodeIds.length; i++) {
         const clusterId = kmeans.assignments[i] ?? 0;
         const nodeId = nodeIds[i];
-        if (!nodeId) {
+        if (nodeId === undefined) {
             continue;
         }
 
@@ -151,7 +151,7 @@ function buildAdjacencyMatrix(graph: Graph, nodeIds: NodeId[]): number[][] {
 
     for (let i = 0; i < n; i++) {
         const nodeId = nodeIds[i];
-        if (!nodeId) {
+        if (nodeId === undefined) {
             continue;
         }
 

package/src/index.ts

@@ -85,6 +85,16 @@ export type { BfsOptions, BfsResult } from "./indexed/bfs.js";
 export type { CommonNeighborsOptions } from "./indexed/common-neighbors.js";
 export type { LabelResult } from "./indexed/components.js";
 export type { SsspOptions, SsspResult } from "./indexed/dijkstra.js";
+// The `Indexed` prefix, as on the PageRank pair below: the flat names HITSOptions / HITSResult,
+// KatzCentralityOptions and LouvainOptions already belong to the legacy functions above, and two
+// option types one capital letter apart in the same barrel is a trap, not a convenience.
+export type { HitsOptions as IndexedHitsOptions, HitsResult as IndexedHitsResult } from "./indexed/hits.js";
+export type { CorenessResult } from "./indexed/k-core.js";
+export type { KatzOptions as IndexedKatzOptions, KatzResult as IndexedKatzResult } from "./indexed/katz.js";
+export type {
+    LouvainOptions as IndexedLouvainOptions,
+    LouvainResult as IndexedLouvainResult,
+} from "./indexed/louvain.js";
 export type { MstOptions, MstResult } from "./indexed/mst.js";
 // Aliased: the flat names are taken twice over (types/index.ts:96 and centrality/pagerank.ts:15).
 export type {

package/src/indexed/accelerator.ts

@@ -15,7 +15,10 @@ import type { F32, F64, GraphSnapshot, NumericVector, U32 } from "@graphty/graph
 
 import type { BfsOptions } from "./bfs.js";
 import { type SsspOptions, type SsspResult, walkPredArcs, walkPredEdges } from "./dijkstra.js";
+import type { HitsOptions } from "./hits.js";
 import * as indexed from "./index.js";
+import type { KatzOptions } from "./katz.js";
+import type { LouvainOptions } from "./louvain.js";
 import type { MstOptions } from "./mst.js";
 import type { PageRankOptions } from "./pagerank.js";
 
@@ -157,8 +160,13 @@ export interface BetweennessAcceleratorOptions {
  * accelerator when it has the method and runs the CPU port otherwise, wrapped in `Promise.resolve`
  * so both paths are async and graphty-element's `async run()` adapters treat them alike.
  *
- * The list GROWS with the A2 ports -- each port PR adds its method. Today it carries the six whose
- * ports exist (plan departure DEP-8A-E).
+ * The list GROWS with the A2 ports -- each port PR adds its method (plan departure DEP-8A-E).
+ *
+ * The four newest methods take their port's own option type, which is WIDER than the
+ * `HitsOptionsLike` the accelerator side still declares: an accelerator therefore never sees Katz's
+ * `alpha` / `beta` or Louvain's `resolution`, and one that is handed them would answer a different
+ * question than the CPU port. Narrowing `AlgorithmAccelerator` is a change to the interface the GPU
+ * package implements, so it belongs to the pull request that lands a GPU Louvain or Katz.
  * @public
  */
 export interface AcceleratedAlgorithms {
@@ -169,6 +177,10 @@ export interface AcceleratedAlgorithms {
     connectedComponents(s: GraphSnapshot): Promise<LabelResultLike>;
     weaklyConnectedComponents(s: GraphSnapshot): Promise<LabelResultLike>;
     minimumSpanningTree(s: GraphSnapshot, options?: MstOptions): Promise<MstResultLike>;
+    kCoreDecomposition(s: GraphSnapshot): Promise<CorenessResultLike>;
+    katzCentrality(s: GraphSnapshot, options?: KatzOptions): Promise<ScoresResultLike>;
+    hits(s: GraphSnapshot, options?: HitsOptions): Promise<HitsResultLike>;
+    louvain(s: GraphSnapshot, options?: LouvainOptions): Promise<CommunityResultLike>;
 }
 
 /**
@@ -221,5 +233,17 @@ export function accelerated(acc: AlgorithmAccelerator | null | undefined): Accel
             acc?.minimumSpanningTree !== undefined
                 ? acc.minimumSpanningTree(s, options)
                 : Promise.resolve(indexed.kruskalMST(s, options)),
+        kCoreDecomposition: (s) =>
+            acc?.kCoreDecomposition !== undefined
+                ? acc.kCoreDecomposition(s)
+                : Promise.resolve(indexed.kCoreDecomposition(s)),
+        katzCentrality: (s, options) =>
+            acc?.katzCentrality !== undefined
+                ? acc.katzCentrality(s, options)
+                : Promise.resolve(indexed.katzCentrality(s, options)),
+        hits: (s, options) =>
+            acc?.hits !== undefined ? acc.hits(s, options) : Promise.resolve(indexed.hits(s, options)),
+        louvain: (s, options) =>
+            acc?.louvain !== undefined ? acc.louvain(s, options) : Promise.resolve(indexed.louvain(s, options)),
     };
 }