@graphty/algorithms 1.7.3 → 1.8.0

package/dist/src/indexed/bfs.js

@@ -0,0 +1,39 @@
+import { INVALID_INDEX } from "@graphty/graph-format";
+/**
+ * Breadth-first search over out-neighbours. Takes any `AdjacencyView`, so `s.reverse()` gives an
+ * in-neighbour BFS with no extra code.
+ * @param g - The adjacency to traverse
+ * @param start - The node index to start from
+ * @param options - Traversal options
+ * @returns The visit order, the parent array, the depth array and the visited count
+ * @public
+ */
+export function breadthFirstSearch(g, start, options = {}) {
+    const { nodeCount, rowPtr, colIdx } = g;
+    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;
+    let head = 0;
+    let tail = 0;
+    order[tail++] = start;
+    depth[start] = 0;
+    while (head < tail) {
+        const u = order[head++];
+        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];
+            if (depth[v] === INVALID_INDEX) {
+                depth[v] = d + 1;
+                parent[v] = u;
+                order[tail++] = v;
+            }
+        }
+    }
+    return { order: order.subarray(0, tail), parent, depth, visitedCount: tail };
+}
+//# sourceMappingURL=bfs.js.map

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

@@ -0,0 +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"}

package/dist/src/indexed/common-neighbors.d.ts

@@ -0,0 +1,17 @@
+import type { GraphSnapshot } from "@graphty/graph-format";
+/** Options of the index-based common-neighbour score. @public */
+export interface CommonNeighborsOptions {
+    /** Intersect out(u) with in(v) instead of the two undirected rows. */
+    readonly directed?: boolean | undefined;
+}
+/**
+ * The number of distinct common neighbours of two nodes, by a merge of their sorted rows.
+ * @param s - The snapshot
+ * @param u - A node index
+ * @param v - A node index
+ * @param o - Options
+ * @returns The count of distinct common neighbours
+ * @public
+ */
+export declare function commonNeighborsScore(s: GraphSnapshot, u: number, v: number, o?: CommonNeighborsOptions): number;
+//# sourceMappingURL=common-neighbors.d.ts.map

package/dist/src/indexed/common-neighbors.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"common-neighbors.d.ts","sourceRoot":"","sources":["../../../src/indexed/common-neighbors.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAiB,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAE1E,iEAAiE;AACjE,MAAM,WAAW,sBAAsB;IACnC,sEAAsE;IACtE,QAAQ,CAAC,QAAQ,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC;CAC3C;AAED;;;;;;;;GAQG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,GAAE,sBAA2B,GAAG,MAAM,CA4BnH"}

package/dist/src/indexed/common-neighbors.js

@@ -0,0 +1,41 @@
+/**
+ * The number of distinct common neighbours of two nodes, by a merge of their sorted rows.
+ * @param s - The snapshot
+ * @param u - A node index
+ * @param v - A node index
+ * @param o - Options
+ * @returns The count of distinct common neighbours
+ * @public
+ */
+export function commonNeighborsScore(s, u, v, o = {}) {
+    const fwd = s;
+    const bwd = o.directed === true ? s.reverse() : s;
+    let i = fwd.rowPtr[u];
+    const iEnd = fwd.rowPtr[u + 1];
+    let j = bwd.rowPtr[v];
+    const jEnd = bwd.rowPtr[v + 1];
+    let count = 0;
+    while (i < iEnd && j < jEnd) {
+        const a = fwd.colIdx[i];
+        const b = bwd.colIdx[j];
+        if (a === b) {
+            count++;
+            i++;
+            j++;
+            while (i < iEnd && fwd.colIdx[i] === a) {
+                i++;
+            }
+            while (j < jEnd && bwd.colIdx[j] === b) {
+                j++;
+            }
+        }
+        else if (a < b) {
+            i++;
+        }
+        else {
+            j++;
+        }
+    }
+    return count;
+}
+//# sourceMappingURL=common-neighbors.js.map

package/dist/src/indexed/common-neighbors.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"common-neighbors.js","sourceRoot":"","sources":["../../../src/indexed/common-neighbors.ts"],"names":[],"mappings":"AAQA;;;;;;;;GAQG;AACH,MAAM,UAAU,oBAAoB,CAAC,CAAgB,EAAE,CAAS,EAAE,CAAS,EAAE,IAA4B,EAAE;IACvG,MAAM,GAAG,GAAkB,CAAC,CAAC;IAC7B,MAAM,GAAG,GAAkB,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACtB,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/B,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACtB,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,OAAO,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;QAC1B,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACV,KAAK,EAAE,CAAC;YACR,CAAC,EAAE,CAAC;YACJ,CAAC,EAAE,CAAC;YACJ,OAAO,CAAC,GAAG,IAAI,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBACrC,CAAC,EAAE,CAAC;YACR,CAAC;YACD,OAAO,CAAC,GAAG,IAAI,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBACrC,CAAC,EAAE,CAAC;YACR,CAAC;QACL,CAAC;aAAM,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACf,CAAC,EAAE,CAAC;QACR,CAAC;aAAM,CAAC;YACJ,CAAC,EAAE,CAAC;QACR,CAAC;IACL,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC"}

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

@@ -0,0 +1,28 @@
+import { type GraphSnapshot, type U32 } from "@graphty/graph-format";
+/** A partition of the node set (graph-format design 14.2's result table, line 3738). @public */
+export interface LabelResult {
+    /** Dense label per node index, in first-seen order. */
+    readonly labels: U32;
+    /** Number of distinct labels. */
+    readonly count: number;
+    /**
+     * Node indices grouped by label, computed once and cached.
+     * @returns One array per label
+     */
+    groups(): U32[];
+}
+/**
+ * Connected components of an UNDIRECTED snapshot.
+ * @param s - An undirected snapshot
+ * @returns The partition
+ * @public
+ */
+export declare function connectedComponents(s: GraphSnapshot): LabelResult;
+/**
+ * Weakly connected components: the same union-find pass with the direction check dropped.
+ * @param s - Any snapshot
+ * @returns The partition
+ * @public
+ */
+export declare function weaklyConnectedComponents(s: GraphSnapshot): LabelResult;
+//# sourceMappingURL=components.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"components.d.ts","sourceRoot":"","sources":["../../../src/indexed/components.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,aAAa,EAAE,KAAK,GAAG,EAAE,MAAM,uBAAuB,CAAC;AAIrE,gGAAgG;AAChG,MAAM,WAAW,WAAW;IACxB,uDAAuD;IACvD,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC;IACrB,iCAAiC;IACjC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB;;;OAGG;IACH,MAAM,IAAI,GAAG,EAAE,CAAC;CACnB;AAuCD;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,aAAa,GAAG,WAAW,CAOjE;AAED;;;;;GAKG;AACH,wBAAgB,yBAAyB,CAAC,CAAC,EAAE,aAAa,GAAG,WAAW,CAEvE"}

package/dist/src/indexed/components.js

@@ -0,0 +1,58 @@
+import { IntUnionFind } from "./structures/union-find.js";
+function withGroups(labels, count) {
+    let cached = null;
+    return {
+        labels,
+        count,
+        groups() {
+            if (cached === null) {
+                const sizes = new Uint32Array(count);
+                for (let i = 0; i < labels.length; i++) {
+                    sizes[labels[i]]++;
+                }
+                const out = [];
+                for (let c = 0; c < count; c++) {
+                    out.push(new Uint32Array(sizes[c]));
+                }
+                const fill = new Uint32Array(count);
+                for (let i = 0; i < labels.length; i++) {
+                    const c = labels[i];
+                    out[c][fill[c]++] = i;
+                }
+                cached = out;
+            }
+            return cached;
+        },
+    };
+}
+function unionEdges(s) {
+    const uf = new IntUnionFind(s.nodeCount);
+    const el = s.edgeList();
+    for (let e = 0; e < s.edgeCount; e++) {
+        uf.union(el.src[e], el.dst[e]);
+    }
+    const { labels, count } = uf.toLabels();
+    return withGroups(labels, count);
+}
+/**
+ * Connected components of an UNDIRECTED snapshot.
+ * @param s - An undirected snapshot
+ * @returns The partition
+ * @public
+ */
+export function connectedComponents(s) {
+    if (s.directed) {
+        throw new Error("Connected components requires an undirected graph. Use weaklyConnectedComponents, or pass s.toUndirected().snapshot.");
+    }
+    return unionEdges(s);
+}
+/**
+ * Weakly connected components: the same union-find pass with the direction check dropped.
+ * @param s - Any snapshot
+ * @returns The partition
+ * @public
+ */
+export function weaklyConnectedComponents(s) {
+    return unionEdges(s);
+}
+//# sourceMappingURL=components.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"components.js","sourceRoot":"","sources":["../../../src/indexed/components.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAe1D,SAAS,UAAU,CAAC,MAAW,EAAE,KAAa;IAC1C,IAAI,MAAM,GAAiB,IAAI,CAAC;IAChC,OAAO;QACH,MAAM;QACN,KAAK;QACL,MAAM;YACF,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;gBAClB,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC;gBACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACrC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACvB,CAAC;gBACD,MAAM,GAAG,GAAU,EAAE,CAAC;gBACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC7B,GAAG,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxC,CAAC;gBACD,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC;gBACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACrC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;oBACpB,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;gBAC1B,CAAC;gBACD,MAAM,GAAG,GAAG,CAAC;YACjB,CAAC;YACD,OAAO,MAAM,CAAC;QAClB,CAAC;KACJ,CAAC;AACN,CAAC;AAED,SAAS,UAAU,CAAC,CAAgB;IAChC,MAAM,EAAE,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IACzC,MAAM,EAAE,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC;IACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC;IACD,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC;IACxC,OAAO,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AACrC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAAC,CAAgB;IAChD,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QACb,MAAM,IAAI,KAAK,CACX,sHAAsH,CACzH,CAAC;IACN,CAAC;IACD,OAAO,UAAU,CAAC,CAAC,CAAC,CAAC;AACzB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,yBAAyB,CAAC,CAAgB;IACtD,OAAO,UAAU,CAAC,CAAC,CAAC,CAAC;AACzB,CAAC"}

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

@@ -0,0 +1,63 @@
+import { type AdjacencyView, type NumericVector, type U32 } from "@graphty/graph-format";
+/**
+ * Single-source shortest paths, index-based (graph-format design 14.2 Port 2, line 3860).
+ * `dist` is a `NumericVector` rather than the design's `F64` because ONE declaration serves both
+ * the CPU port (which produces a `Float64Array`) and the dispatcher's decoration of an
+ * accelerator's f32 result (plan decision PD-3, departure DEP-8A-C).
+ * @public
+ */
+export interface SsspResult {
+    /** Distance per node; +Infinity for unreached nodes. */
+    readonly dist: NumericVector;
+    /** The ARC that relaxed each node; INVALID_INDEX for the source and for unreached nodes. */
+    readonly predArc: U32;
+    /**
+     * Node indices from the source to `target` inclusive; empty when `target` is unreached.
+     * @param target - The node index to walk back from
+     */
+    pathTo(target: number): U32;
+    /**
+     * LOGICAL EDGE indices along that path, one fewer than `pathTo`; this is what graphty-element's
+     * `isInPath` writes through. Empty when `target` is unreached.
+     * @param target - The node index to walk back from
+     */
+    pathEdges(target: number): U32;
+}
+/** Options of the index-based SSSP. @public */
+export interface SsspOptions {
+    /** Stop relaxing beyond this distance. */
+    readonly cutoff?: number | undefined;
+    /** Per-arc weight override, arcCount long -- the facade passes `expandEdges(s, shadow.data)`. */
+    readonly weights?: NumericVector | undefined;
+}
+/**
+ * Walk the predecessor arcs back from `target` and return the node path, source first.
+ * @param g - The adjacency the search ran on
+ * @param predArc - The search's predecessor-arc array
+ * @param source - The search's source node index
+ * @param target - The node to walk back from
+ * @returns Node indices from source to target inclusive, or an empty array when unreached
+ * @public
+ */
+export declare function walkPredArcs(g: AdjacencyView, predArc: U32, source: number, target: number): U32;
+/**
+ * Walk the predecessor arcs back from `target` and return the logical edges on the path.
+ * @param g - The adjacency the search ran on
+ * @param predArc - The search's predecessor-arc array
+ * @param source - The search's source node index
+ * @param target - The node to walk back from
+ * @returns Logical edge indices from source to target, or an empty array when unreached
+ * @public
+ */
+export declare function walkPredEdges(g: AdjacencyView, predArc: U32, source: number, target: number): U32;
+/**
+ * Dijkstra over an adjacency view, with the predecessor recorded as the relaxing ARC so a parallel
+ * edge on the path is identified exactly.
+ * @param g - The adjacency to search
+ * @param source - The node index to start from
+ * @param options - Cutoff and per-arc weight override
+ * @returns The distances, the predecessor arcs, and the two path accessors
+ * @public
+ */
+export declare function dijkstra(g: AdjacencyView, source: number, options?: SsspOptions): SsspResult;
+//# sourceMappingURL=dijkstra.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"dijkstra.d.ts","sourceRoot":"","sources":["../../../src/indexed/dijkstra.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,aAAa,EAAiB,KAAK,aAAa,EAAE,KAAK,GAAG,EAAE,MAAM,uBAAuB,CAAC;AAKxG;;;;;;GAMG;AACH,MAAM,WAAW,UAAU;IACvB,wDAAwD;IACxD,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAC7B,4FAA4F;IAC5F,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC;IACtB;;;OAGG;IACH,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,GAAG,CAAC;IAC5B;;;;OAIG;IACH,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,GAAG,CAAC;CAClC;AAED,+CAA+C;AAC/C,MAAM,WAAW,WAAW;IACxB,0CAA0C;IAC1C,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACrC,iGAAiG;IACjG,QAAQ,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC;CAChD;AAED;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,GAAG,CAkBhG;AAED;;;;;;;;GAQG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,GAAG,CAgBjG;AAED;;;;;;;;GAQG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,GAAE,WAAgB,GAAG,UAAU,CA8BhG"}

package/dist/src/indexed/dijkstra.js

@@ -0,0 +1,98 @@
+import { INVALID_INDEX } from "@graphty/graph-format";
+import { arcSourceIn } from "./structures/arc-source.js";
+import { IndexedMinHeap } from "./structures/min-heap.js";
+/**
+ * Walk the predecessor arcs back from `target` and return the node path, source first.
+ * @param g - The adjacency the search ran on
+ * @param predArc - The search's predecessor-arc array
+ * @param source - The search's source node index
+ * @param target - The node to walk back from
+ * @returns Node indices from source to target inclusive, or an empty array when unreached
+ * @public
+ */
+export function walkPredArcs(g, predArc, source, target) {
+    if (target === source) {
+        return Uint32Array.of(source);
+    }
+    if (predArc[target] === INVALID_INDEX) {
+        return new Uint32Array(0);
+    }
+    const reversed = [target];
+    let node = target;
+    while (node !== source) {
+        node = arcSourceIn(g.rowPtr, predArc[node]);
+        reversed.push(node);
+    }
+    const out = new Uint32Array(reversed.length);
+    for (let i = 0; i < reversed.length; i++) {
+        out[i] = reversed[reversed.length - 1 - i];
+    }
+    return out;
+}
+/**
+ * Walk the predecessor arcs back from `target` and return the logical edges on the path.
+ * @param g - The adjacency the search ran on
+ * @param predArc - The search's predecessor-arc array
+ * @param source - The search's source node index
+ * @param target - The node to walk back from
+ * @returns Logical edge indices from source to target, or an empty array when unreached
+ * @public
+ */
+export function walkPredEdges(g, predArc, source, target) {
+    if (target === source || predArc[target] === INVALID_INDEX) {
+        return new Uint32Array(0);
+    }
+    const reversed = [];
+    let node = target;
+    while (node !== source) {
+        const arc = predArc[node];
+        reversed.push(g.arcToEdge[arc]); // the EXACT parallel edge, not a (u, v) lookup
+        node = arcSourceIn(g.rowPtr, arc);
+    }
+    const out = new Uint32Array(reversed.length);
+    for (let i = 0; i < reversed.length; i++) {
+        out[i] = reversed[reversed.length - 1 - i];
+    }
+    return out;
+}
+/**
+ * Dijkstra over an adjacency view, with the predecessor recorded as the relaxing ARC so a parallel
+ * edge on the path is identified exactly.
+ * @param g - The adjacency to search
+ * @param source - The node index to start from
+ * @param options - Cutoff and per-arc weight override
+ * @returns The distances, the predecessor arcs, and the two path accessors
+ * @public
+ */
+export function dijkstra(g, source, options = {}) {
+    const { nodeCount, rowPtr, colIdx } = g;
+    const weights = options.weights ?? g.weights;
+    const dist = new Float64Array(nodeCount).fill(Infinity);
+    const predArc = new Uint32Array(nodeCount).fill(INVALID_INDEX);
+    const heap = new IndexedMinHeap(nodeCount);
+    const cutoff = options.cutoff ?? Infinity;
+    dist[source] = 0;
+    heap.push(source, 0);
+    while (!heap.isEmpty()) {
+        const u = heap.pop();
+        const du = dist[u];
+        const end = rowPtr[u + 1];
+        for (let a = rowPtr[u]; a < end; a++) {
+            const w = weights === null ? 1 : weights[a];
+            const v = colIdx[a];
+            const dv = du + w;
+            if (dv < dist[v] && dv <= cutoff) {
+                dist[v] = dv;
+                predArc[v] = a;
+                heap.pushOrDecrease(v, dv);
+            }
+        }
+    }
+    return {
+        dist,
+        predArc,
+        pathTo: (target) => walkPredArcs(g, predArc, source, target),
+        pathEdges: (target) => walkPredEdges(g, predArc, source, target),
+    };
+}
+//# sourceMappingURL=dijkstra.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"dijkstra.js","sourceRoot":"","sources":["../../../src/indexed/dijkstra.ts"],"names":[],"mappings":"AAAA,OAAO,EAAsB,aAAa,EAAgC,MAAM,uBAAuB,CAAC;AAExG,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AACzD,OAAO,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAmC1D;;;;;;;;GAQG;AACH,MAAM,UAAU,YAAY,CAAC,CAAgB,EAAE,OAAY,EAAE,MAAc,EAAE,MAAc;IACvF,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;QACpB,OAAO,WAAW,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;IAClC,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,CAAC,KAAK,aAAa,EAAE,CAAC;QACpC,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC;IACD,MAAM,QAAQ,GAAa,CAAC,MAAM,CAAC,CAAC;IACpC,IAAI,IAAI,GAAG,MAAM,CAAC;IAClB,OAAO,IAAI,KAAK,MAAM,EAAE,CAAC;QACrB,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;QAC5C,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/C,CAAC;IACD,OAAO,GAAG,CAAC;AACf,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,aAAa,CAAC,CAAgB,EAAE,OAAY,EAAE,MAAc,EAAE,MAAc;IACxF,IAAI,MAAM,KAAK,MAAM,IAAI,OAAO,CAAC,MAAM,CAAC,KAAK,aAAa,EAAE,CAAC;QACzD,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC;IACD,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,IAAI,IAAI,GAAG,MAAM,CAAC;IAClB,OAAO,IAAI,KAAK,MAAM,EAAE,CAAC;QACrB,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;QAC1B,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,+CAA+C;QAChF,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IACtC,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/C,CAAC;IACD,OAAO,GAAG,CAAC;AACf,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,QAAQ,CAAC,CAAgB,EAAE,MAAc,EAAE,UAAuB,EAAE;IAChF,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;IACxC,MAAM,OAAO,GAAyB,OAAO,CAAC,OAAO,IAAI,CAAC,CAAC,OAAO,CAAC;IACnE,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACxD,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IAC/D,MAAM,IAAI,GAAG,IAAI,cAAc,CAAC,SAAS,CAAC,CAAC;IAC3C,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,QAAQ,CAAC;IAC1C,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACjB,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACrB,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC;QACrB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACrB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,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,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACpB,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YAClB,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,MAAM,EAAE,CAAC;gBAC/B,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;gBACb,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACf,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC/B,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO;QACH,IAAI;QACJ,OAAO;QACP,MAAM,EAAE,CAAC,MAAc,EAAO,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC;QACzE,SAAS,EAAE,CAAC,MAAc,EAAO,EAAE,CAAC,aAAa,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC;KAChF,CAAC;AACN,CAAC"}

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

@@ -0,0 +1,22 @@
+/**
+ * Index-based implementations over `@graphty/graph-format` snapshots (graph-format design 14.1
+ * rule 2): every function takes a `GraphSnapshot` or an `AdjacencyView` first and an options object
+ * last, and returns typed arrays plus scalars. Reached as the `indexed` namespace of
+ * `@graphty/algorithms`.
+ *
+ * NOT re-exported here, deliberately (plan decision PD-9):
+ * - `./accelerator.js`, which imports this barrel -- re-exporting it would make a cycle, and its
+ *   symbols are exported FLAT from the package barrel because the GPU package must write
+ *   `import type { AlgorithmAccelerator } from "@graphty/algorithms"`.
+ * - `./to-snapshot.js`, whose parameter is a legacy `Graph`, which is not what this namespace
+ *   promises. It is exported flat too.
+ * @module
+ */
+export { type BfsOptions, type BfsResult, breadthFirstSearch } from "./bfs.js";
+export { type CommonNeighborsOptions, commonNeighborsScore } from "./common-neighbors.js";
+export { connectedComponents, type LabelResult, weaklyConnectedComponents } from "./components.js";
+export { dijkstra, type SsspOptions, type SsspResult, walkPredArcs, walkPredEdges, } from "./dijkstra.js";
+export { kruskalMST, type MstOptions, type MstResult } from "./mst.js";
+export { pageRank, type PageRankOptions, type PageRankResult } from "./pagerank.js";
+export { arcSourceIn, IndexedMinHeap, IntUnionFind } from "./structures/index.js";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +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,EACH,QAAQ,EACR,KAAK,WAAW,EAChB,KAAK,UAAU,EACf,YAAY,EACZ,aAAa,GAChB,MAAM,eAAe,CAAC;AACvB,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"}

package/dist/src/indexed/index.js

@@ -0,0 +1,22 @@
+/**
+ * Index-based implementations over `@graphty/graph-format` snapshots (graph-format design 14.1
+ * rule 2): every function takes a `GraphSnapshot` or an `AdjacencyView` first and an options object
+ * last, and returns typed arrays plus scalars. Reached as the `indexed` namespace of
+ * `@graphty/algorithms`.
+ *
+ * NOT re-exported here, deliberately (plan decision PD-9):
+ * - `./accelerator.js`, which imports this barrel -- re-exporting it would make a cycle, and its
+ *   symbols are exported FLAT from the package barrel because the GPU package must write
+ *   `import type { AlgorithmAccelerator } from "@graphty/algorithms"`.
+ * - `./to-snapshot.js`, whose parameter is a legacy `Graph`, which is not what this namespace
+ *   promises. It is exported flat too.
+ * @module
+ */
+export { breadthFirstSearch } from "./bfs.js";
+export { commonNeighborsScore } from "./common-neighbors.js";
+export { connectedComponents, weaklyConnectedComponents } from "./components.js";
+export { dijkstra, walkPredArcs, walkPredEdges, } from "./dijkstra.js";
+export { kruskalMST } from "./mst.js";
+export { pageRank } from "./pagerank.js";
+export { arcSourceIn, IndexedMinHeap, IntUnionFind } from "./structures/index.js";
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +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,EACH,QAAQ,EAGR,YAAY,EACZ,aAAa,GAChB,MAAM,eAAe,CAAC;AACvB,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"}

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

@@ -0,0 +1,26 @@
+import type { GraphSnapshot, NumericVector, U32 } from "@graphty/graph-format";
+/** Options of the index-based MST. @public */
+export interface MstOptions {
+    /** Per-arc weight override, arcCount long; gathered back to per-edge through `edgeToArc`. */
+    readonly weights?: NumericVector | undefined;
+}
+/** Result of the index-based MST (graph-format design 14.2's result table, line 3745). @public */
+export interface MstResult {
+    /** Logical edge indices of the spanning forest, in the order they were accepted. */
+    readonly edges: U32;
+    /** Sum of the accepted edges' weights. */
+    readonly totalWeight: number;
+}
+/**
+ * Kruskal's minimum spanning forest over logical edges.
+ *
+ * The sort is a comparator over an f64 key array, tie-broken by edge index, rather than the
+ * design's radix sort on the f32 bit pattern (plan departure DEP-8A-D): the tie-break makes it
+ * stable by construction and it has to serve both the f32 arc array and an f64 override.
+ * @param s - The snapshot
+ * @param o - The optional per-arc weight override
+ * @returns The accepted edge indices and their total weight
+ * @public
+ */
+export declare function kruskalMST(s: GraphSnapshot, o?: MstOptions): MstResult;
+//# sourceMappingURL=mst.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"mst.d.ts","sourceRoot":"","sources":["../../../src/indexed/mst.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,aAAa,EAAE,GAAG,EAAE,MAAM,uBAAuB,CAAC;AAI/E,8CAA8C;AAC9C,MAAM,WAAW,UAAU;IACvB,6FAA6F;IAC7F,QAAQ,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC;CAChD;AAED,kGAAkG;AAClG,MAAM,WAAW,SAAS;IACtB,oFAAoF;IACpF,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC;IACpB,0CAA0C;IAC1C,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;CAChC;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,GAAE,UAAe,GAAG,SAAS,CAgC1E"}

package/dist/src/indexed/mst.js

@@ -0,0 +1,48 @@
+import { IntUnionFind } from "./structures/union-find.js";
+/**
+ * Kruskal's minimum spanning forest over logical edges.
+ *
+ * The sort is a comparator over an f64 key array, tie-broken by edge index, rather than the
+ * design's radix sort on the f32 bit pattern (plan departure DEP-8A-D): the tie-break makes it
+ * stable by construction and it has to serve both the f32 arc array and an f64 override.
+ * @param s - The snapshot
+ * @param o - The optional per-arc weight override
+ * @returns The accepted edge indices and their total weight
+ * @public
+ */
+export function kruskalMST(s, o = {}) {
+    const el = s.edgeList();
+    const m = s.edgeCount;
+    const keys = new Float64Array(m);
+    if (o.weights !== undefined) {
+        // The override is per ARC; edgeList().arc holds the arc of each edge's declared orientation.
+        for (let e = 0; e < m; e++) {
+            keys[e] = o.weights[el.arc[e]];
+        }
+    }
+    else if (el.weights !== null) {
+        for (let e = 0; e < m; e++) {
+            keys[e] = el.weights[e];
+        }
+    }
+    else {
+        keys.fill(1);
+    }
+    const order = new Array(m);
+    for (let e = 0; e < m; e++) {
+        order[e] = e;
+    }
+    order.sort((a, b) => keys[a] - keys[b] || a - b);
+    const uf = new IntUnionFind(s.nodeCount);
+    const accepted = new Uint32Array(Math.max(s.nodeCount - 1, 0));
+    let taken = 0;
+    let totalWeight = 0;
+    for (const e of order) {
+        if (uf.union(el.src[e], el.dst[e])) {
+            accepted[taken++] = e;
+            totalWeight += keys[e];
+        }
+    }
+    return { edges: accepted.subarray(0, taken), totalWeight };
+}
+//# sourceMappingURL=mst.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"mst.js","sourceRoot":"","sources":["../../../src/indexed/mst.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAgB1D;;;;;;;;;;GAUG;AACH,MAAM,UAAU,UAAU,CAAC,CAAgB,EAAE,IAAgB,EAAE;IAC3D,MAAM,EAAE,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC;IACxB,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;IACtB,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IACjC,IAAI,CAAC,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;QAC1B,6FAA6F;QAC7F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC;IACL,CAAC;SAAM,IAAI,EAAE,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;IACL,CAAC;SAAM,CAAC;QACJ,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjB,CAAC;IACD,MAAM,KAAK,GAAa,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;IAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACjB,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACjD,MAAM,EAAE,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IACzC,MAAM,QAAQ,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC/D,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACpB,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACjC,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC;YACtB,WAAW,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,CAAC;IACL,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,WAAW,EAAE,CAAC;AAC/D,CAAC"}

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

@@ -0,0 +1,30 @@
+import type { F64, GraphSnapshot } from "@graphty/graph-format";
+/** Options of the index-based PageRank (graph-format design 14.2 Port 3, line 3892). @public */
+export interface PageRankOptions {
+    /** Probability of following a link; default 0.85. */
+    readonly dampingFactor?: number | undefined;
+    /** Iteration cap; default 100. */
+    readonly maxIterations?: number | undefined;
+    /** L1 convergence tolerance; default 1e-6. */
+    readonly tolerance?: number | undefined;
+    /** Use the snapshot's arc weights; default false. */
+    readonly weighted?: boolean | undefined;
+}
+/** Result of the index-based PageRank. @public */
+export interface PageRankResult {
+    /** Score per node index. */
+    readonly scores: F64;
+    /** Iterations actually run. */
+    readonly iterations: number;
+    /** Whether the L1 delta fell below the tolerance. */
+    readonly converged: boolean;
+}
+/**
+ * PageRank by pull over `reverse()`, with the dangling mass redistributed uniformly.
+ * @param s - A DIRECTED snapshot
+ * @param o - Algorithm options
+ * @returns The scores, the iteration count and the convergence flag
+ * @public
+ */
+export declare function pageRank(s: GraphSnapshot, o?: PageRankOptions): PageRankResult;
+//# sourceMappingURL=pagerank.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"pagerank.d.ts","sourceRoot":"","sources":["../../../src/indexed/pagerank.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,GAAG,EAAE,aAAa,EAAiB,MAAM,uBAAuB,CAAC;AAE/E,gGAAgG;AAChG,MAAM,WAAW,eAAe;IAC5B,qDAAqD;IACrD,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC5C,kCAAkC;IAClC,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC5C,8CAA8C;IAC9C,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACxC,qDAAqD;IACrD,QAAQ,CAAC,QAAQ,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC;CAC3C;AAED,kDAAkD;AAClD,MAAM,WAAW,cAAc;IAC3B,4BAA4B;IAC5B,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC;IACrB,+BAA+B;IAC/B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,qDAAqD;IACrD,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;CAC/B;AAED;;;;;;GAMG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,GAAE,eAAoB,GAAG,cAAc,CAyClF"}

package/dist/src/indexed/pagerank.js

@@ -0,0 +1,50 @@
+/**
+ * PageRank by pull over `reverse()`, with the dangling mass redistributed uniformly.
+ * @param s - A DIRECTED snapshot
+ * @param o - Algorithm options
+ * @returns The scores, the iteration count and the convergence flag
+ * @public
+ */
+export function pageRank(s, o = {}) {
+    if (!s.directed) {
+        throw new Error("PageRank requires a directed graph");
+    }
+    const n = s.nodeCount;
+    const d = o.dampingFactor ?? 0.85;
+    const maxIter = o.maxIterations ?? 100;
+    const tol = o.tolerance ?? 1e-6;
+    const rev = s.reverse();
+    const weighted = o.weighted === true && rev.weights !== null;
+    const outW = weighted ? s.weightedOutDegree() : s.outDegree();
+    let rank = new Float64Array(n).fill(1 / n);
+    let next = new Float64Array(n);
+    let it = 0;
+    let converged = false;
+    for (; it < maxIter && !converged; it++) {
+        let dangling = 0;
+        for (let u = 0; u < n; u++) {
+            if (outW[u] === 0) {
+                dangling += rank[u];
+            }
+        }
+        const base = (1 - d) / n + (d * dangling) / n;
+        let delta = 0;
+        for (let v = 0; v < n; v++) {
+            let acc = 0;
+            const end = rev.rowPtr[v + 1];
+            for (let a = rev.rowPtr[v]; a < end; a++) {
+                const u = rev.colIdx[a];
+                const ow = outW[u];
+                if (ow > 0) {
+                    acc += (rank[u] * (weighted && rev.weights !== null ? rev.weights[a] : 1)) / ow;
+                }
+            }
+            next[v] = base + d * acc;
+            delta += Math.abs(next[v] - rank[v]);
+        }
+        [rank, next] = [next, rank];
+        converged = delta < tol;
+    }
+    return { scores: rank, iterations: it, converged };
+}
+//# sourceMappingURL=pagerank.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"pagerank.js","sourceRoot":"","sources":["../../../src/indexed/pagerank.ts"],"names":[],"mappings":"AAwBA;;;;;;GAMG;AACH,MAAM,UAAU,QAAQ,CAAC,CAAgB,EAAE,IAAqB,EAAE;IAC9D,IAAI,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;QACd,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;IAC1D,CAAC;IACD,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;IACtB,MAAM,CAAC,GAAG,CAAC,CAAC,aAAa,IAAI,IAAI,CAAC;IAClC,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,QAAQ,GAAG,CAAC,CAAC,QAAQ,KAAK,IAAI,IAAI,GAAG,CAAC,OAAO,KAAK,IAAI,CAAC;IAC7D,MAAM,IAAI,GAAkB,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;IAC7E,IAAI,IAAI,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC3C,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,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBAChB,QAAQ,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC;QACL,CAAC;QACD,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;QAC9C,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,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,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBACnB,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;oBACT,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,IAAI,GAAG,CAAC,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;gBACpF,CAAC;YACL,CAAC;YACD,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC;YACzB,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC;QACD,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC5B,SAAS,GAAG,KAAK,GAAG,GAAG,CAAC;IAC5B,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC;AACvD,CAAC"}

package/dist/src/indexed/structures/arc-source.d.ts

@@ -0,0 +1,13 @@
+import type { U32 } from "@graphty/graph-format";
+/**
+ * The source node of an arc, by binary search on `rowPtr`. `GraphSnapshot` exposes `arcSource(a)`
+ * (`graph-format/src/snapshot/graph-snapshot.ts:544`), but an `AdjacencyView` -- which is what the
+ * Port 1 and Port 2 signatures take, so that `reverse()` works as an input for free -- does not,
+ * so the predecessor walk carries its own.
+ * @param rowPtr - The view's nodeCount + 1 row offsets
+ * @param arc - An arc index in `[0, arcCount)`
+ * @returns The node index whose row contains the arc
+ * @public
+ */
+export declare function arcSourceIn(rowPtr: U32, arc: number): number;
+//# sourceMappingURL=arc-source.d.ts.map

package/dist/src/indexed/structures/arc-source.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"arc-source.d.ts","sourceRoot":"","sources":["../../../../src/indexed/structures/arc-source.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,uBAAuB,CAAC;AAEjD;;;;;;;;;GASG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAY5D"}