@graphty/algorithms 2.1.2 → 2.2.0

package/dist/src/indexed/betweenness.js

@@ -0,0 +1,188 @@
+import { maskTest } from "@graphty/graph-format";
+/** The seed of the `k` draw. Any fixed value works: the draw only has to repeat. */
+const SAMPLE_SEED = 0x9e3779b9;
+/**
+ * `k` distinct node indices by a partial Fisher-Yates shuffle over a fixed-seed mulberry32 stream, so the same
+ * `(n, k)` draws the same sources every time.
+ * @param n - The node count
+ * @param k - How many to draw, at most n
+ * @returns The sources
+ */
+function drawSources(n, k) {
+    const pool = Array.from({ length: n }, (_, i) => i);
+    let state = SAMPLE_SEED;
+    for (let i = 0; i < k; i++) {
+        state = (state + 0x6d2b79f5) >>> 0;
+        let t = Math.imul(state ^ (state >>> 15), state | 1);
+        t = (t + Math.imul(t ^ (t >>> 7), t | 61)) ^ t;
+        const unit = ((t ^ (t >>> 14)) >>> 0) / 2 ** 32;
+        const j = i + Math.floor(unit * (n - i));
+        [pool[i], pool[j]] = [pool[j], pool[i]];
+    }
+    return pool.slice(0, k);
+}
+/**
+ * The sources a call runs: `sources` as given, else `k` drawn, else every node.
+ * @param n - The node count
+ * @param sources - The caller's list
+ * @param k - The caller's count
+ * @returns The sources
+ * @throws RangeError for a source outside `[0, n)`, a `k` outside `[0, n]`, or a `k` that disagrees with the list
+ */
+export function resolveSources(n, sources, k) {
+    if (k !== undefined && (!Number.isInteger(k) || k < 0 || k > n)) {
+        throw new RangeError(`betweenness: k must be an integer in [0, ${n}], got ${k}`);
+    }
+    if (sources !== undefined) {
+        for (const v of sources) {
+            if (!Number.isInteger(v) || v < 0 || v >= n) {
+                throw new RangeError(`betweenness: sources must be node indices in [0, ${n}), got ${v}`);
+            }
+        }
+        if (k !== undefined && k !== sources.length) {
+            throw new RangeError(`betweenness: k (${k}) must be absent or equal sources.length (${sources.length})`);
+        }
+        return sources;
+    }
+    return k === undefined ? Array.from({ length: n }, (_, i) => i) : drawSources(n, k);
+}
+/**
+ * Brandes' accumulation from every source, into `node` and/or `edge` (raw sums, before halving or
+ * normalising).
+ *
+ * A pair joined by parallel edges is ONE neighbour relation (graph-format design 3.5, the adjacent-skip idiom),
+ * so path counts are the simple graph's and equal the legacy function's. The pair's share of an edge score goes
+ * to the first alive parallel edge in row order; the others score 0. Removing that edge hands the whole share to
+ * the next parallel, so the scores of a pair's parallels always sum to the simple graph's edge score.
+ * Dependencies are pulled over OUT-arcs from the deepest level up, so no reverse adjacency is built.
+ * @param s - The snapshot
+ * @param sources - Source node indices
+ * @param node - Node sums, or null
+ * @param edge - Edge sums, or null
+ * @param alive - Kept edges, or null for all
+ * @param endpoints - Count path ends on the path (node sums only)
+ */
+function accumulate(s, sources, node, edge, alive, endpoints) {
+    const { nodeCount: n, rowPtr, colIdx, arcToEdge } = s;
+    const depth = new Int32Array(n).fill(-1);
+    const sigma = new Float64Array(n);
+    const delta = new Float64Array(n);
+    const order = new Uint32Array(n);
+    for (const source of sources) {
+        let head = 0;
+        let tail = 0;
+        depth[source] = 0;
+        sigma[source] = 1;
+        order[tail++] = source;
+        while (head < tail) {
+            const v = order[head++];
+            const next = depth[v] + 1;
+            let prev = -1;
+            for (let a = rowPtr[v], end = rowPtr[v + 1]; a < end; a++) {
+                const w = colIdx[a];
+                if (w === prev || (alive !== null && !maskTest(alive, arcToEdge[a]))) {
+                    continue;
+                }
+                prev = w;
+                if (depth[w] < 0) {
+                    depth[w] = next;
+                    order[tail++] = w;
+                }
+                if (depth[w] === next) {
+                    sigma[w] += sigma[v];
+                }
+            }
+        }
+        for (let i = tail - 1; i >= 0; i--) {
+            const v = order[i];
+            const next = depth[v] + 1;
+            let prev = -1;
+            for (let a = rowPtr[v], end = rowPtr[v + 1]; a < end; a++) {
+                const w = colIdx[a];
+                if (w === prev || (alive !== null && !maskTest(alive, arcToEdge[a]))) {
+                    continue;
+                }
+                prev = w;
+                if (depth[w] === next) {
+                    const c = (sigma[v] / sigma[w]) * (1 + delta[w]);
+                    delta[v] += c;
+                    if (edge !== null) {
+                        edge[arcToEdge[a]] += c;
+                    }
+                }
+            }
+            if (node !== null && v !== source) {
+                node[v] += endpoints ? delta[v] + 1 : delta[v];
+            }
+        }
+        if (node !== null && endpoints) {
+            node[source] += tail - 1;
+        }
+        for (let i = 0; i < tail; i++) {
+            const v = order[i];
+            depth[v] = -1;
+            sigma[v] = 0;
+            delta[v] = 0;
+        }
+    }
+}
+/**
+ * Halve on an undirected snapshot (each unordered pair was counted from both ends) and divide by `factor` when
+ * normalising and it is positive.
+ * @param s - The snapshot
+ * @param scores - The raw sums, scaled in place
+ * @param normalized - Whether to normalise
+ * @param factor - The directed pair count to normalise by
+ */
+function scale(s, scores, normalized, factor) {
+    // Undirected: halving and then dividing by half the directed pair count is dividing by the whole count.
+    const halve = s.directed ? 1 : 2;
+    const divisor = normalized === true && factor > 0 ? factor : halve;
+    for (let i = 0; i < scores.length; i++) {
+        scores[i] /= divisor;
+    }
+}
+/**
+ * Node betweenness centrality by Brandes' algorithm: breadth-first, so weights are ignored, as in the legacy
+ * `betweennessCentrality`, whose scores this equals on every graph it can hold. A sampled run (`sources` or `k`)
+ * is the UNSCALED sum over the sources run, as the WebGPU accelerator reports it.
+ * @param s - The snapshot
+ * @param options - Normalisation, endpoints and sampling
+ * @returns One score per node index; `iterations` is the number of sources run
+ * @throws RangeError for a bad `sources` or `k`
+ * @public
+ */
+export function betweennessCentrality(s, options = {}) {
+    const n = s.nodeCount;
+    const sources = resolveSources(n, options.sources, options.k);
+    const scores = new Float64Array(n);
+    const endpoints = options.endpoints === true;
+    accumulate(s, sources, scores, null, null, endpoints);
+    scale(s, scores, options.normalized, endpoints ? n * (n - 1) : (n - 1) * (n - 2));
+    return { scores, iterations: sources.length, converged: true };
+}
+/**
+ * Edge betweenness centrality by Brandes' algorithm, one score per logical edge.
+ *
+ * On a directed snapshot an edge's score equals the legacy `edgeBetweennessCentrality` value keyed
+ * `"source-target"`. On an undirected one it is the number of pairs whose shortest paths cross the edge in
+ * either direction, which is the SUM of the two values the legacy function reports under `"u-v"` and `"v-u"`
+ * (each of those holds half), and is the score the WebGPU accelerator returns.
+ * @param s - The snapshot
+ * @param options - Normalisation, sampling and the alive-edge mask
+ * @returns One score per logical edge
+ * @throws RangeError for a bad `sources` or `k`, or an `alive` mask shorter than the edge count
+ * @public
+ */
+export function edgeBetweennessCentrality(s, options = {}) {
+    const n = s.nodeCount;
+    const alive = options.alive ?? null;
+    if (alive !== null && alive.length < Math.ceil(s.edgeCount / 32)) {
+        throw new RangeError(`edgeBetweennessCentrality: alive covers fewer than ${s.edgeCount} edges`);
+    }
+    const scores = new Float64Array(s.edgeCount);
+    accumulate(s, resolveSources(n, options.sources, options.k), null, scores, alive, false);
+    scale(s, scores, options.normalized, (n - 1) * (n - 2));
+    return { scores };
+}
+//# sourceMappingURL=betweenness.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"betweenness.js","sourceRoot":"","sources":["../../../src/indexed/betweenness.ts"],"names":[],"mappings":"AAAA,OAAO,EAA+C,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAuD9F,oFAAoF;AACpF,MAAM,WAAW,GAAG,UAAU,CAAC;AAE/B;;;;;;GAMG;AACH,SAAS,WAAW,CAAC,CAAS,EAAE,CAAS;IACrC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACpD,IAAI,KAAK,GAAG,WAAW,CAAC;IACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,KAAK,GAAG,CAAC,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,KAAK,KAAK,EAAE,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QACrD,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/C,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QAChD,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC5B,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,cAAc,CAC1B,CAAS,EACT,OAAsC,EACtC,CAAqB;IAErB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QAC9D,MAAM,IAAI,UAAU,CAAC,4CAA4C,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;IACrF,CAAC;IACD,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QACxB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACtB,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC1C,MAAM,IAAI,UAAU,CAAC,oDAAoD,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YAC7F,CAAC;QACL,CAAC;QACD,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC;YAC1C,MAAM,IAAI,UAAU,CAAC,mBAAmB,CAAC,6CAA6C,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QAC7G,CAAC;QACD,OAAO,OAAO,CAAC;IACnB,CAAC;IACD,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACxF,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,SAAS,UAAU,CACf,CAAgB,EAChB,OAA0B,EAC1B,IAAgB,EAChB,IAAgB,EAChB,KAAsB,EACtB,SAAkB;IAElB,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;IACtD,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAClC,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAClC,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IACjC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC3B,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAClB,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAClB,KAAK,CAAC,IAAI,EAAE,CAAC,GAAG,MAAM,CAAC;QACvB,OAAO,IAAI,GAAG,IAAI,EAAE,CAAC;YACjB,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;YACxB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC1B,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC;YACd,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxD,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBACpB,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBACnE,SAAS;gBACb,CAAC;gBACD,IAAI,GAAG,CAAC,CAAC;gBACT,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;oBACf,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;oBAChB,KAAK,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC;gBACtB,CAAC;gBACD,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;oBACpB,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;gBACzB,CAAC;YACL,CAAC;QACL,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC1B,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC;YACd,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxD,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBACpB,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBACnE,SAAS;gBACb,CAAC;gBACD,IAAI,GAAG,CAAC,CAAC;gBACT,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;oBACpB,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACjD,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;oBACd,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;wBAChB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;oBAC5B,CAAC;gBACL,CAAC;YACL,CAAC;YACD,IAAI,IAAI,KAAK,IAAI,IAAI,CAAC,KAAK,MAAM,EAAE,CAAC;gBAChC,IAAI,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACnD,CAAC;QACL,CAAC;QACD,IAAI,IAAI,KAAK,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;QAC7B,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACd,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACb,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACjB,CAAC;IACL,CAAC;AACL,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,KAAK,CAAC,CAAgB,EAAE,MAAW,EAAE,UAA+B,EAAE,MAAc;IACzF,wGAAwG;IACxG,MAAM,KAAK,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjC,MAAM,OAAO,GAAG,UAAU,KAAK,IAAI,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;IACnE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC;IACzB,CAAC;AACL,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,qBAAqB,CAAC,CAAgB,EAAE,UAA8B,EAAE;IACpF,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;IACtB,MAAM,OAAO,GAAG,cAAc,CAAC,CAAC,EAAE,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;IAC9D,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IACnC,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,KAAK,IAAI,CAAC;IAC7C,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;IACtD,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAClF,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,CAAC,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;AACnE,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,yBAAyB,CAAC,CAAgB,EAAE,UAAkC,EAAE;IAC5F,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;IACtB,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,IAAI,CAAC;IACpC,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,GAAG,EAAE,CAAC,EAAE,CAAC;QAC/D,MAAM,IAAI,UAAU,CAAC,sDAAsD,CAAC,CAAC,SAAS,QAAQ,CAAC,CAAC;IACpG,CAAC;IACD,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAC7C,UAAU,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,EAAE,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IACzF,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACxD,OAAO,EAAE,MAAM,EAAE,CAAC;AACtB,CAAC"}

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

@@ -1,4 +1,4 @@
-import { type AdjacencyView, type U32 } from "@graphty/graph-format";
+import { type AdjacencyView, type GraphSnapshot, type U32 } from "@graphty/graph-format";
 /** Result of the index-based BFS (graph-format design 14.2 Port 1). @public */
 export interface BfsResult {
     /** Visit order, one entry per visited node; a subarray of length `visitedCount`. */
@@ -10,11 +10,53 @@ export interface BfsResult {
     /** How many nodes were visited. */
     readonly visitedCount: number;
 }
+/** The neighbour-order option the order-sensitive traversals share. @public */
+export interface ArcOrderOption {
+    /**
+     * A permutation of the arc indices, `arcCount` long, whose slice `[rowPtr[u], rowPtr[u + 1])`
+     * lists node `u`'s arcs in the order to try them. The default is row order (ascending neighbour
+     * index). A caller that must reproduce a traversal over another neighbour order -- a legacy
+     * `Graph` hands out neighbours in insertion order -- passes that order here.
+     */
+    readonly arcOrder?: U32 | undefined;
+}
 /** Options of the index-based BFS. @public */
-export interface BfsOptions {
+export interface BfsOptions extends ArcOrderOption {
     /** Stop expanding at this depth; unbounded when omitted. */
     readonly maxDepth?: number | undefined;
+    /**
+     * Stop when this node index is taken off the queue, before its neighbours are expanded. Every
+     * node discovered by then stays in `order`; the target's own position in `order` ends the
+     * prefix of nodes that were expanded.
+     * @throws RangeError when it is not a node index
+     */
+    readonly target?: number | undefined;
 }
+/**
+ * Check a start (or target) node index.
+ * @param g - The adjacency
+ * @param start - The node index
+ * @param what - What the index is, for the error message
+ * @throws RangeError when `start` is not a node index of `g`
+ */
+export declare function checkStart(g: AdjacencyView, start: number, what?: string): void;
+/**
+ * Check an optional target node index.
+ * @param g - The adjacency
+ * @param target - The option, or undefined
+ * @returns The target, or INVALID_INDEX for none
+ * @throws RangeError when `target` is set and is not a node index of `g`
+ */
+export declare function checkTarget(g: AdjacencyView, target: number | undefined): number;
+/**
+ * Check an `arcOrder` option: `arcCount` entries, and every row's slice a permutation of that row's
+ * arcs.
+ * @param g - The adjacency
+ * @param arcOrder - The option, or undefined
+ * @returns The order, or null for row order
+ * @throws RangeError when the order does not fit the adjacency
+ */
+export declare function checkArcOrder(g: AdjacencyView, arcOrder: U32 | undefined): U32 | null;
 /**
  * Breadth-first search over out-neighbours. Takes any `AdjacencyView`, so `s.reverse()` gives an
  * in-neighbour BFS with no extra code.
@@ -25,4 +67,29 @@ export interface BfsOptions {
  * @public
  */
 export declare function breadthFirstSearch(g: AdjacencyView, start: number, options?: BfsOptions): BfsResult;
+/** Options of {@link directionOptimizedBfs}. @public */
+export interface DirectionOptimizedBfsOptions {
+    /**
+     * Switch from top-down to bottom-up once the frontier's out-arcs exceed the unvisited nodes'
+     * out-arcs divided by `alpha`. Default 15.
+     */
+    readonly alpha?: number | undefined;
+    /** Switch back to top-down once the frontier shrinks below `nodeCount / beta` nodes. Default 18. */
+    readonly beta?: number | undefined;
+}
+/**
+ * Direction-optimising breadth-first search (Beamer, Asanovic and Patterson, SC'12): a top-down
+ * step expands the frontier's out-arcs, a bottom-up step has every unvisited node look for a
+ * frontier node among its in-neighbours over `s.reverse()` (fetched only when a bottom-up step
+ * runs), and the search switches between the two
+ * by frontier size. Both steps give a node the LOWEST-index frontier node that reaches it as its
+ * parent, so the result does not depend on which steps ran: `depth` equals `breadthFirstSearch`'s,
+ * and `order` lists the visited nodes level by level, ascending within a level.
+ * @param s - The snapshot to traverse
+ * @param source - The node index to start from
+ * @param options - The switching thresholds
+ * @returns The visit order, the parent array, the depth array and the visited count
+ * @public
+ */
+export declare function directionOptimizedBfs(s: GraphSnapshot, source: number, options?: DirectionOptimizedBfsOptions): BfsResult;
 //# sourceMappingURL=bfs.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"bfs.d.ts","sourceRoot":"","sources":["../../../src/indexed/bfs.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,aAAa,EAAiB,KAAK,GAAG,EAAE,MAAM,uBAAuB,CAAC;AAEpF,+EAA+E;AAC/E,MAAM,WAAW,SAAS;IACtB,oFAAoF;IACpF,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC;IACpB,sFAAsF;IACtF,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC;IACrB,kEAAkE;IAClE,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC;IACpB,mCAAmC;IACnC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;CACjC;AAED,8CAA8C;AAC9C,MAAM,WAAW,UAAU;IACvB,4DAA4D;IAC5D,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CAC1C;AAED;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,UAAe,GAAG,SAAS,CA2BvG"}
+{"version":3,"file":"bfs.d.ts","sourceRoot":"","sources":["../../../src/indexed/bfs.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,aAAa,EAAE,KAAK,aAAa,EAAiB,KAAK,GAAG,EAAE,MAAM,uBAAuB,CAAC;AAExG,+EAA+E;AAC/E,MAAM,WAAW,SAAS;IACtB,oFAAoF;IACpF,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC;IACpB,sFAAsF;IACtF,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC;IACrB,kEAAkE;IAClE,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC;IACpB,mCAAmC;IACnC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;CACjC;AAED,+EAA+E;AAC/E,MAAM,WAAW,cAAc;IAC3B;;;;;OAKG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,GAAG,GAAG,SAAS,CAAC;CACvC;AAED,8CAA8C;AAC9C,MAAM,WAAW,UAAW,SAAQ,cAAc;IAC9C,4DAA4D;IAC5D,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACvC;;;;;OAKG;IACH,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CACxC;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,SAAU,GAAG,IAAI,CAIhF;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,GAAG,SAAS,GAAG,MAAM,CAMhF;AAED;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,aAAa,EAAE,QAAQ,EAAE,GAAG,GAAG,SAAS,GAAG,GAAG,GAAG,IAAI,CA2BrF;AAED;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,UAAe,GAAG,SAAS,CAiCvG;AAED,wDAAwD;AACxD,MAAM,WAAW,4BAA4B;IACzC;;;OAGG;IACH,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACpC,oGAAoG;IACpG,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CACtC;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,qBAAqB,CACjC,CAAC,EAAE,aAAa,EAChB,MAAM,EAAE,MAAM,EACd,OAAO,GAAE,4BAAiC,GAC3C,SAAS,CAkEX"}

package/dist/src/indexed/bfs.js

@@ -1,4 +1,62 @@
 import { INVALID_INDEX } from "@graphty/graph-format";
+/**
+ * Check a start (or target) node index.
+ * @param g - The adjacency
+ * @param start - The node index
+ * @param what - What the index is, for the error message
+ * @throws RangeError when `start` is not a node index of `g`
+ */
+export function checkStart(g, start, what = "start") {
+    if (!Number.isInteger(start) || start < 0 || start >= g.nodeCount) {
+        throw new RangeError(`${what} node index ${String(start)} is out of range for ${String(g.nodeCount)} nodes`);
+    }
+}
+/**
+ * Check an optional target node index.
+ * @param g - The adjacency
+ * @param target - The option, or undefined
+ * @returns The target, or INVALID_INDEX for none
+ * @throws RangeError when `target` is set and is not a node index of `g`
+ */
+export function checkTarget(g, target) {
+    if (target === undefined) {
+        return INVALID_INDEX;
+    }
+    checkStart(g, target, "target");
+    return target;
+}
+/**
+ * Check an `arcOrder` option: `arcCount` entries, and every row's slice a permutation of that row's
+ * arcs.
+ * @param g - The adjacency
+ * @param arcOrder - The option, or undefined
+ * @returns The order, or null for row order
+ * @throws RangeError when the order does not fit the adjacency
+ */
+export function checkArcOrder(g, arcOrder) {
+    if (arcOrder === undefined) {
+        return null;
+    }
+    const { rowPtr, nodeCount } = g;
+    if (arcOrder.length !== g.arcCount) {
+        throw new RangeError(`arcOrder has ${String(arcOrder.length)} entries, expected ${String(g.arcCount)}`);
+    }
+    const seen = new Uint8Array(arcOrder.length);
+    for (let u = 0; u < nodeCount; u++) {
+        const begin = rowPtr[u];
+        const end = rowPtr[u + 1];
+        for (let a = begin; a < end; a++) {
+            if (arcOrder[a] < begin || arcOrder[a] >= end) {
+                throw new RangeError(`arcOrder[${String(a)}] = ${String(arcOrder[a])} is not an arc of node ${String(u)}`);
+            }
+            if (seen[arcOrder[a]] === 1) {
+                throw new RangeError(`arcOrder[${String(a)}] = ${String(arcOrder[a])} repeats an arc of node ${String(u)}`);
+            }
+            seen[arcOrder[a]] = 1;
+        }
+    }
+    return arcOrder;
+}
 /**
  * Breadth-first search over out-neighbours. Takes any `AdjacencyView`, so `s.reverse()` gives an
  * in-neighbour BFS with no extra code.
@@ -9,24 +67,30 @@ import { INVALID_INDEX } from "@graphty/graph-format";
  * @public
  */
 export function breadthFirstSearch(g, start, options = {}) {
+    checkStart(g, start);
     const { nodeCount, rowPtr, colIdx } = g;
+    const arcOrder = checkArcOrder(g, options.arcOrder);
     const parent = new Uint32Array(nodeCount).fill(INVALID_INDEX);
     const depth = new Uint32Array(nodeCount).fill(INVALID_INDEX);
     const order = new Uint32Array(nodeCount);
     const maxDepth = options.maxDepth ?? INVALID_INDEX;
+    const target = checkTarget(g, options.target);
     let head = 0;
     let tail = 0;
     order[tail++] = start;
     depth[start] = 0;
     while (head < tail) {
         const u = order[head++];
+        if (u === target) {
+            break;
+        }
         const d = depth[u];
         if (d >= maxDepth) {
             continue;
         }
         const end = rowPtr[u + 1];
         for (let a = rowPtr[u]; a < end; a++) {
-            const v = colIdx[a];
+            const v = colIdx[arcOrder === null ? a : arcOrder[a]];
             if (depth[v] === INVALID_INDEX) {
                 depth[v] = d + 1;
                 parent[v] = u;
@@ -36,4 +100,87 @@ export function breadthFirstSearch(g, start, options = {}) {
     }
     return { order: order.subarray(0, tail), parent, depth, visitedCount: tail };
 }
+/**
+ * Direction-optimising breadth-first search (Beamer, Asanovic and Patterson, SC'12): a top-down
+ * step expands the frontier's out-arcs, a bottom-up step has every unvisited node look for a
+ * frontier node among its in-neighbours over `s.reverse()` (fetched only when a bottom-up step
+ * runs), and the search switches between the two
+ * by frontier size. Both steps give a node the LOWEST-index frontier node that reaches it as its
+ * parent, so the result does not depend on which steps ran: `depth` equals `breadthFirstSearch`'s,
+ * and `order` lists the visited nodes level by level, ascending within a level.
+ * @param s - The snapshot to traverse
+ * @param source - The node index to start from
+ * @param options - The switching thresholds
+ * @returns The visit order, the parent array, the depth array and the visited count
+ * @public
+ */
+export function directionOptimizedBfs(s, source, options = {}) {
+    checkStart(s, source);
+    const { nodeCount, rowPtr, colIdx } = s;
+    const alpha = options.alpha ?? 15;
+    const beta = options.beta ?? 18;
+    let reverse = null;
+    const parent = new Uint32Array(nodeCount).fill(INVALID_INDEX);
+    const depth = new Uint32Array(nodeCount).fill(INVALID_INDEX);
+    // order[levelStart, tail) is the current frontier, sorted ascending.
+    const order = new Uint32Array(nodeCount);
+    order[0] = source;
+    depth[source] = 0;
+    let levelStart = 0;
+    let tail = 1;
+    let unexploredArcs = s.arcCount - (rowPtr[source + 1] - rowPtr[source]);
+    let bottomUp = false;
+    for (let d = 0; levelStart < tail; d++) {
+        const frontierSize = tail - levelStart;
+        if (bottomUp) {
+            bottomUp = frontierSize >= nodeCount / beta;
+        }
+        else {
+            let frontierArcs = 0;
+            for (let i = levelStart; i < tail; i++) {
+                frontierArcs += rowPtr[order[i] + 1] - rowPtr[order[i]];
+            }
+            bottomUp = frontierArcs > unexploredArcs / alpha;
+        }
+        const levelEnd = tail;
+        if (bottomUp) {
+            reverse ?? (reverse = s.reverse());
+            for (let v = 0; v < nodeCount; v++) {
+                if (depth[v] !== INVALID_INDEX) {
+                    continue;
+                }
+                const end = reverse.rowPtr[v + 1];
+                for (let a = reverse.rowPtr[v]; a < end; a++) {
+                    const u = reverse.colIdx[a];
+                    if (depth[u] === d) {
+                        parent[v] = u;
+                        depth[v] = d + 1;
+                        order[tail++] = v;
+                        break;
+                    }
+                }
+            }
+        }
+        else {
+            for (let i = levelStart; i < levelEnd; i++) {
+                const u = order[i];
+                const end = rowPtr[u + 1];
+                for (let a = rowPtr[u]; a < end; a++) {
+                    const v = colIdx[a];
+                    if (depth[v] === INVALID_INDEX) {
+                        parent[v] = u;
+                        depth[v] = d + 1;
+                        order[tail++] = v;
+                    }
+                }
+            }
+            order.subarray(levelEnd, tail).sort();
+        }
+        for (let i = levelEnd; i < tail; i++) {
+            unexploredArcs -= rowPtr[order[i] + 1] - rowPtr[order[i]];
+        }
+        levelStart = levelEnd;
+    }
+    return { order: order.subarray(0, tail), parent, depth, visitedCount: tail };
+}
 //# sourceMappingURL=bfs.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"bfs.js","sourceRoot":"","sources":["../../../src/indexed/bfs.ts"],"names":[],"mappings":"AAAA,OAAO,EAAsB,aAAa,EAAY,MAAM,uBAAuB,CAAC;AAoBpF;;;;;;;;GAQG;AACH,MAAM,UAAU,kBAAkB,CAAC,CAAgB,EAAE,KAAa,EAAE,UAAsB,EAAE;IACxF,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;IACxC,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IAC9D,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IAC7D,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC;IACzC,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,aAAa,CAAC;IACnD,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,CAAC,IAAI,EAAE,CAAC,GAAG,KAAK,CAAC;IACtB,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACjB,OAAO,IAAI,GAAG,IAAI,EAAE,CAAC;QACjB,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,CAAC,IAAI,QAAQ,EAAE,CAAC;YAChB,SAAS;QACb,CAAC;QACD,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACpB,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,aAAa,EAAE,CAAC;gBAC7B,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACjB,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACd,KAAK,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC;YACtB,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC;AACjF,CAAC"}
+{"version":3,"file":"bfs.js","sourceRoot":"","sources":["../../../src/indexed/bfs.ts"],"names":[],"mappings":"AAAA,OAAO,EAA0C,aAAa,EAAY,MAAM,uBAAuB,CAAC;AAsCxG;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CAAC,CAAgB,EAAE,KAAa,EAAE,IAAI,GAAG,OAAO;IACtE,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;QAChE,MAAM,IAAI,UAAU,CAAC,GAAG,IAAI,eAAe,MAAM,CAAC,KAAK,CAAC,wBAAwB,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IACjH,CAAC;AACL,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CAAC,CAAgB,EAAE,MAA0B;IACpE,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACvB,OAAO,aAAa,CAAC;IACzB,CAAC;IACD,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;IAChC,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAAC,CAAgB,EAAE,QAAyB;IACrE,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QACzB,OAAO,IAAI,CAAC;IAChB,CAAC;IACD,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;IAChC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;QACjC,MAAM,IAAI,UAAU,CAAC,gBAAgB,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,sBAAsB,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IAC5G,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG,KAAK,IAAI,QAAQ,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC;gBAC5C,MAAM,IAAI,UAAU,CAChB,YAAY,MAAM,CAAC,CAAC,CAAC,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,0BAA0B,MAAM,CAAC,CAAC,CAAC,EAAE,CACvF,CAAC;YACN,CAAC;YACD,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC1B,MAAM,IAAI,UAAU,CAChB,YAAY,MAAM,CAAC,CAAC,CAAC,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,2BAA2B,MAAM,CAAC,CAAC,CAAC,EAAE,CACxF,CAAC;YACN,CAAC;YACD,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1B,CAAC;IACL,CAAC;IACD,OAAO,QAAQ,CAAC;AACpB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,kBAAkB,CAAC,CAAgB,EAAE,KAAa,EAAE,UAAsB,EAAE;IACxF,UAAU,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACrB,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;IACxC,MAAM,QAAQ,GAAG,aAAa,CAAC,CAAC,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC;IACpD,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IAC9D,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IAC7D,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC;IACzC,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,aAAa,CAAC;IACnD,MAAM,MAAM,GAAG,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;IAC9C,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,CAAC,IAAI,EAAE,CAAC,GAAG,KAAK,CAAC;IACtB,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACjB,OAAO,IAAI,GAAG,IAAI,EAAE,CAAC;QACjB,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;QACxB,IAAI,CAAC,KAAK,MAAM,EAAE,CAAC;YACf,MAAM;QACV,CAAC;QACD,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,CAAC,IAAI,QAAQ,EAAE,CAAC;YAChB,SAAS;QACb,CAAC;QACD,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACtD,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,aAAa,EAAE,CAAC;gBAC7B,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACjB,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACd,KAAK,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC;YACtB,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC;AACjF,CAAC;AAaD;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,qBAAqB,CACjC,CAAgB,EAChB,MAAc,EACd,UAAwC,EAAE;IAE1C,UAAU,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACtB,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;IACxC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC;IAClC,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,IAAI,EAAE,CAAC;IAChC,IAAI,OAAO,GAAyB,IAAI,CAAC;IACzC,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IAC9D,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IAC7D,qEAAqE;IACrE,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC;IACzC,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;IAClB,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAClB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,cAAc,GAAG,CAAC,CAAC,QAAQ,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IACxE,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,UAAU,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,YAAY,GAAG,IAAI,GAAG,UAAU,CAAC;QACvC,IAAI,QAAQ,EAAE,CAAC;YACX,QAAQ,GAAG,YAAY,IAAI,SAAS,GAAG,IAAI,CAAC;QAChD,CAAC;aAAM,CAAC;YACJ,IAAI,YAAY,GAAG,CAAC,CAAC;YACrB,KAAK,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,YAAY,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5D,CAAC;YACD,QAAQ,GAAG,YAAY,GAAG,cAAc,GAAG,KAAK,CAAC;QACrD,CAAC;QACD,MAAM,QAAQ,GAAG,IAAI,CAAC;QACtB,IAAI,QAAQ,EAAE,CAAC;YACX,OAAO,KAAP,OAAO,GAAK,CAAC,CAAC,OAAO,EAAE,EAAC;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,aAAa,EAAE,CAAC;oBAC7B,SAAS;gBACb,CAAC;gBACD,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAClC,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3C,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBAC5B,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;wBACjB,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;wBACd,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;wBACjB,KAAK,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC;wBAClB,MAAM;oBACV,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;aAAM,CAAC;YACJ,KAAK,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACnB,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC1B,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;oBACnC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;oBACpB,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,aAAa,EAAE,CAAC;wBAC7B,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;wBACd,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;wBACjB,KAAK,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC;oBACtB,CAAC;gBACL,CAAC;YACL,CAAC;YACD,KAAK,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;QAC1C,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,cAAc,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9D,CAAC;QACD,UAAU,GAAG,QAAQ,CAAC;IAC1B,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC;AACjF,CAAC"}

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

@@ -0,0 +1,37 @@
+import { type GraphSnapshot, type NodeMask } from "@graphty/graph-format";
+/** Result of the index-based bipartiteness test. @public */
+export interface BipartiteResult {
+    /** Whether the nodes split into two sides with no arc inside a side. */
+    readonly bipartite: boolean;
+    /**
+     * The two sides as one mask: a set bit puts the node on the second side, a clear bit on the
+     * first. The lowest-index node of every component is on the first side. Null when not bipartite.
+     */
+    readonly sides: NodeMask | null;
+}
+/** Options of {@link isBipartite}. @public */
+export interface BipartiteOptions {
+    /**
+     * Which arcs of a directed snapshot to colour along. "both" (default) follows out- and in-arcs,
+     * which answers for the graph with direction ignored. "out" follows out-arcs only, as the legacy
+     * `bipartitePartition` does: roots are taken in index order and a node first reached through an
+     * in-arc is coloured as a new root, so the answer depends on node order. Ignored on an undirected
+     * snapshot.
+     */
+    readonly arcs?: "both" | "out" | undefined;
+}
+/**
+ * Two-colour the graph by BFS, one BFS per component in index order. A self-loop makes a graph
+ * non-bipartite; parallel arcs change nothing. Arc direction plays no part in bipartiteness, so on
+ * a directed snapshot every node is coloured against its in-neighbours (over `s.reverse()`) as well
+ * as its out-neighbours. Following out-arcs only -- as the legacy `bipartitePartition` does -- makes
+ * the answer depend on node order: with the single arc `a -> b`, a walk that starts at `b` never
+ * meets `a`, colours it as a new root and then finds the arc inside one side. `options.arcs: "out"`
+ * gives that legacy answer.
+ * @param s - The snapshot to test
+ * @param options - Which arcs to follow on a directed snapshot
+ * @returns Whether the graph is bipartite and, when it is, its two sides
+ * @public
+ */
+export declare function isBipartite(s: GraphSnapshot, options?: BipartiteOptions): BipartiteResult;
+//# sourceMappingURL=bipartite.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"bipartite.d.ts","sourceRoot":"","sources":["../../../src/indexed/bipartite.ts"],"names":[],"mappings":"AAAA,OAAO,EAAsB,KAAK,aAAa,EAAqB,KAAK,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAEjH,4DAA4D;AAC5D,MAAM,WAAW,eAAe;IAC5B,wEAAwE;IACxE,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B;;;OAGG;IACH,QAAQ,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC;CACnC;AAED,8CAA8C;AAC9C,MAAM,WAAW,gBAAgB;IAC7B;;;;;;OAMG;IACH,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,KAAK,GAAG,SAAS,CAAC;CAC9C;AAID;;;;;;;;;;;;GAYG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,GAAE,gBAAqB,GAAG,eAAe,CAoC7F"}

package/dist/src/indexed/bipartite.js

@@ -0,0 +1,54 @@
+import { makeMask, maskSet } from "@graphty/graph-format";
+const UNSEEN = 2;
+/**
+ * Two-colour the graph by BFS, one BFS per component in index order. A self-loop makes a graph
+ * non-bipartite; parallel arcs change nothing. Arc direction plays no part in bipartiteness, so on
+ * a directed snapshot every node is coloured against its in-neighbours (over `s.reverse()`) as well
+ * as its out-neighbours. Following out-arcs only -- as the legacy `bipartitePartition` does -- makes
+ * the answer depend on node order: with the single arc `a -> b`, a walk that starts at `b` never
+ * meets `a`, colours it as a new root and then finds the arc inside one side. `options.arcs: "out"`
+ * gives that legacy answer.
+ * @param s - The snapshot to test
+ * @param options - Which arcs to follow on a directed snapshot
+ * @returns Whether the graph is bipartite and, when it is, its two sides
+ * @public
+ */
+export function isBipartite(s, options = {}) {
+    const { nodeCount } = s;
+    const views = s.directed && options.arcs !== "out" ? [s, s.reverse()] : [s];
+    const side = new Uint8Array(nodeCount).fill(UNSEEN);
+    const queue = new Uint32Array(nodeCount);
+    for (let r = 0; r < nodeCount; r++) {
+        if (side[r] !== UNSEEN) {
+            continue;
+        }
+        side[r] = 0;
+        let head = 0;
+        let tail = 0;
+        queue[tail++] = r;
+        while (head < tail) {
+            const u = queue[head++];
+            for (const { rowPtr, colIdx } of views) {
+                const end = rowPtr[u + 1];
+                for (let a = rowPtr[u]; a < end; a++) {
+                    const v = colIdx[a];
+                    if (side[v] === UNSEEN) {
+                        side[v] = side[u] ^ 1;
+                        queue[tail++] = v;
+                    }
+                    else if (side[v] === side[u]) {
+                        return { bipartite: false, sides: null };
+                    }
+                }
+            }
+        }
+    }
+    const sides = makeMask(nodeCount);
+    for (let i = 0; i < nodeCount; i++) {
+        if (side[i] === 1) {
+            maskSet(sides, i, true);
+        }
+    }
+    return { bipartite: true, sides };
+}
+//# sourceMappingURL=bipartite.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"bipartite.js","sourceRoot":"","sources":["../../../src/indexed/bipartite.ts"],"names":[],"mappings":"AAAA,OAAO,EAA0C,QAAQ,EAAE,OAAO,EAAiB,MAAM,uBAAuB,CAAC;AAyBjH,MAAM,MAAM,GAAG,CAAC,CAAC;AAEjB;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,WAAW,CAAC,CAAgB,EAAE,UAA4B,EAAE;IACxE,MAAM,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;IACxB,MAAM,KAAK,GAAoB,CAAC,CAAC,QAAQ,IAAI,OAAO,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7F,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACpD,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,MAAM,EAAE,CAAC;YACrB,SAAS;QACb,CAAC;QACD,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACZ,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC;QAClB,OAAO,IAAI,GAAG,IAAI,EAAE,CAAC;YACjB,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;YACxB,KAAK,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;gBACrC,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC1B,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;oBACnC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;oBACpB,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,MAAM,EAAE,CAAC;wBACrB,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;wBACtB,KAAK,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC;oBACtB,CAAC;yBAAM,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;wBAC7B,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;oBAC7C,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IACD,MAAM,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YAChB,OAAO,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QAC5B,CAAC;IACL,CAAC;IACD,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AACtC,CAAC"}

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

@@ -0,0 +1,49 @@
+import type { GraphSnapshot, NumericVector } from "@graphty/graph-format";
+import type { ScoresResult } from "./betweenness.js";
+/** Options of the index-based closeness centrality, matching the legacy `closenessCentrality`. @public */
+export interface ClosenessOptions {
+    /**
+     * Scale by the fraction of other nodes reached (Wasserman and Faust), or with `harmonic` divide by
+     * `n - 1`. Default false.
+     */
+    readonly normalized?: boolean | undefined;
+    /** Sum `1 / distance` instead of taking `1 / sum(distance)`; better on disconnected graphs. Default false. */
+    readonly harmonic?: boolean | undefined;
+    /**
+     * Stop searching from nodes this far away or farther. A node past the cutoff is still counted when an edge
+     * reaches it from a node closer than the cutoff, as in the legacy functions. Default: every reachable node.
+     */
+    readonly cutoff?: number | undefined;
+    /**
+     * Measure distance by edge weight (Dijkstra) rather than by hops, as the legacy
+     * `weightedClosenessCentrality` does. Default false: weights are ignored, as the legacy
+     * `closenessCentrality` ignores them.
+     */
+    readonly weighted?: boolean | undefined;
+    /** Per-arc weight override, arcCount long, read when `weighted`; a facade passes the exact f64 weights. */
+    readonly weights?: NumericVector | undefined;
+}
+/**
+ * Closeness centrality of every node: `1 / sum(distance to each reached node)` by default, the legacy
+ * `closenessCentrality` (hops) and `weightedClosenessCentrality` (`weighted: true`) numbers. The weighted
+ * route reads the snapshot's f32 arc weights, so it matches legacy to f32 rounding; pass the f64 weights as
+ * `weights` for the exact legacy sums. As in legacy, a node's distance is final once it is searched from, so a
+ * negative weight gives the legacy (not the true shortest) distance and never loops. An unreached node adds
+ * nothing, and a node that reaches nothing scores 0.
+ * @param s - The snapshot
+ * @param options - Normalisation, harmonic form, cutoff and weights
+ * @returns One score per node index; `iterations` is the number of searches run
+ * @public
+ */
+export declare function closenessCentrality(s: GraphSnapshot, options?: ClosenessOptions): ScoresResult;
+/**
+ * Closeness centrality of one node, with one search rather than n.
+ * @param s - The snapshot
+ * @param node - The node index
+ * @param options - As {@link closenessCentrality}
+ * @returns The node's score
+ * @throws RangeError for a node index outside `[0, nodeCount)`
+ * @public
+ */
+export declare function nodeClosenessCentrality(s: GraphSnapshot, node: number, options?: ClosenessOptions): number;
+//# sourceMappingURL=closeness.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"closeness.d.ts","sourceRoot":"","sources":["../../../src/indexed/closeness.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAE1E,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAGrD,0GAA0G;AAC1G,MAAM,WAAW,gBAAgB;IAC7B;;;OAGG;IACH,QAAQ,CAAC,UAAU,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC;IAC1C,8GAA8G;IAC9G,QAAQ,CAAC,QAAQ,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC;IACxC;;;OAGG;IACH,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACrC;;;;OAIG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC;IACxC,2GAA2G;IAC3G,QAAQ,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC;CAChD;AAiGD;;;;;;;;;;;GAWG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,GAAE,gBAAqB,GAAG,YAAY,CAOlG;AAED;;;;;;;;GAQG;AACH,wBAAgB,uBAAuB,CAAC,CAAC,EAAE,aAAa,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,GAAE,gBAAqB,GAAG,MAAM,CAK9G"}