@graphty/algorithms 2.1.1 → 2.2.0

package/dist/src/indexed/mst.js

@@ -1,3 +1,5 @@
+import { INVALID_INDEX } from "@graphty/graph-format";
+import { IndexedMinHeap } from "./structures/min-heap.js";
 import { IntUnionFind } from "./structures/union-find.js";
 /**
  * Kruskal's minimum spanning forest over logical edges.
@@ -45,4 +47,64 @@ export function kruskalMST(s, o = {}) {
     }
     return { edges: accepted.subarray(0, taken), totalWeight };
 }
+/**
+ * Prim's minimum spanning tree, grown from a start node by always taking the cheapest arc from the
+ * tree to a node outside it (an indexed heap keyed per node, so of several parallel edges the
+ * cheapest, and of equal ones the lowest-indexed, is the one taken). `edges` lists the logical
+ * edges in the order they joined the tree and `totalWeight` sums them in that order, as legacy
+ * `primMST` does. The start index is checked: one outside the graph throws a RangeError.
+ * @param s - An undirected snapshot
+ * @param o - Per-arc weight override, start node and the spanning-forest switch
+ * @returns The accepted edges, their total weight and the discovery arc per node
+ * @throws Error on a directed snapshot, and on a disconnected one unless `forest` is set
+ * @public
+ */
+export function primMST(s, o = {}) {
+    if (s.directed) {
+        throw new Error("Prim's algorithm requires an undirected graph");
+    }
+    const { nodeCount: n, rowPtr, colIdx } = s;
+    const weights = o.weights ?? s.weights;
+    const key = new Float64Array(n).fill(Infinity);
+    const predArc = new Uint32Array(n).fill(INVALID_INDEX);
+    const inTree = new Uint8Array(n);
+    const heap = new IndexedMinHeap(n);
+    const accepted = new Uint32Array(Math.max(n - 1, 0));
+    let taken = 0;
+    let totalWeight = 0;
+    const grow = (root) => {
+        heap.push(root, 0);
+        while (!heap.isEmpty()) {
+            const u = heap.pop();
+            inTree[u] = 1;
+            if (predArc[u] !== INVALID_INDEX) {
+                accepted[taken++] = s.arcToEdge[predArc[u]];
+                totalWeight += key[u];
+            }
+            for (let a = rowPtr[u]; a < rowPtr[u + 1]; a++) {
+                const v = colIdx[a];
+                const w = weights === null ? 1 : weights[a];
+                if (inTree[v] === 0 && w < key[v]) {
+                    key[v] = w;
+                    predArc[v] = a;
+                    heap.pushOrDecrease(v, w);
+                }
+            }
+        }
+    };
+    if (n > 0) {
+        grow(o.start ?? 0);
+    }
+    if (o.forest === true) {
+        for (let root = 0; root < n; root++) {
+            if (inTree[root] === 0) {
+                grow(root);
+            }
+        }
+    }
+    else if (taken < n - 1) {
+        throw new Error("Graph is not connected");
+    }
+    return { edges: accepted.subarray(0, taken), totalWeight, predArc };
+}
 //# sourceMappingURL=mst.js.map

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

@@ -1 +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"}
+{"version":3,"file":"mst.js","sourceRoot":"","sources":["../../../src/indexed/mst.ts"],"names":[],"mappings":"AAAA,OAAO,EAAsB,aAAa,EAAgC,MAAM,uBAAuB,CAAC;AAExG,OAAO,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAC1D,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;AAmBD;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,OAAO,CAAC,CAAgB,EAAE,IAAiB,EAAE;IACzD,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QACb,MAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAC;IACrE,CAAC;IACD,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;IAC3C,MAAM,OAAO,GAAyB,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,OAAO,CAAC;IAC7D,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC/C,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IACvD,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IACjC,MAAM,IAAI,GAAG,IAAI,cAAc,CAAC,CAAC,CAAC,CAAC;IACnC,MAAM,QAAQ,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACrD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,MAAM,IAAI,GAAG,CAAC,IAAY,EAAQ,EAAE;QAChC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACnB,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC;YACrB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YACrB,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACd,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,aAAa,EAAE,CAAC;gBAC/B,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5C,WAAW,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;YAC1B,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7C,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBACpB,MAAM,CAAC,GAAG,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBAC5C,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAChC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBACX,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBACf,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC9B,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC,CAAC;IACF,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACR,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,IAAI,CAAC,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;QACpB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;YAClC,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACrB,IAAI,CAAC,IAAI,CAAC,CAAC;YACf,CAAC;QACL,CAAC;IACL,CAAC;SAAM,IAAI,KAAK,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC;IAC9C,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC;AACxE,CAAC"}

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

@@ -1,14 +1,21 @@
-import type { F64, GraphSnapshot } from "@graphty/graph-format";
-/** Options of the index-based PageRank (graph-format design 14.2 Port 3, line 3892). @public */
+import type { F32, F64, GraphSnapshot } from "@graphty/graph-format";
+/** Options of the index-based PageRank (graph-format design 14.2 Port 3). @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. */
+    /** Convergence tolerance on the per-iteration change; default 1e-6. */
     readonly tolerance?: number | undefined;
     /** Use the snapshot's arc weights; default false. */
     readonly weighted?: boolean | undefined;
+    /** Starting rank per node index, normalised to sum 1 (when the sum is positive); default uniform. */
+    readonly initialRanks?: F32 | F64 | undefined;
+    /**
+     * How the per-iteration change is measured against `tolerance`: `"l1"` (default) sums it over
+     * all nodes, `"max"` takes the largest single-node change, the legacy `pageRank` rule.
+     */
+    readonly convergenceNorm?: "l1" | "max" | undefined;
 }
 /** Result of the index-based PageRank. @public */
 export interface PageRankResult {
@@ -16,15 +23,31 @@ export interface PageRankResult {
     readonly scores: F64;
     /** Iterations actually run. */
     readonly iterations: number;
-    /** Whether the L1 delta fell below the tolerance. */
+    /** Whether the change fell below the tolerance. */
     readonly converged: boolean;
 }
 /**
- * PageRank by pull over `reverse()`, with the dangling mass redistributed uniformly.
- * @param s - A DIRECTED snapshot
+ * PageRank by pull over `reverse()`, with the dangling mass redistributed uniformly. On an
+ * undirected snapshot every edge carries rank both ways (a self-loop once), which is PageRank on
+ * the directed graph holding both arcs of every edge.
+ * @param s - The 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;
+/**
+ * Personalized PageRank, as the legacy function computes it: the personalization vector,
+ * normalised to sum 1, replaces the uniform `1 / n` in the teleport, and each node receives
+ * `d * dangling / n` of the dangling mass scaled by its personalization. That keeps only a
+ * `1 / n` share of the dangling mass, so on a graph with a dangling node the scores sum to less
+ * than 1 (networkx spreads all of it). An all-zero vector gives plain PageRank, as the legacy
+ * function does for an empty list of personal nodes.
+ * @param s - The snapshot
+ * @param personalization - One finite, non-negative mass per node index
+ * @param o - Algorithm options
+ * @returns The scores, the iteration count and the convergence flag
+ * @public
+ */
+export declare function personalizedPageRank(s: GraphSnapshot, personalization: F32 | F64, o?: PageRankOptions): PageRankResult;
 //# sourceMappingURL=pagerank.d.ts.map

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

@@ -1 +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"}
+{"version":3,"file":"pagerank.d.ts","sourceRoot":"","sources":["../../../src/indexed/pagerank.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,aAAa,EAAiB,MAAM,uBAAuB,CAAC;AAEpF,qFAAqF;AACrF,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,uEAAuE;IACvE,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACxC,qDAAqD;IACrD,QAAQ,CAAC,QAAQ,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC;IACxC,qGAAqG;IACrG,QAAQ,CAAC,YAAY,CAAC,EAAE,GAAG,GAAG,GAAG,GAAG,SAAS,CAAC;IAC9C;;;OAGG;IACH,QAAQ,CAAC,eAAe,CAAC,EAAE,IAAI,GAAG,KAAK,GAAG,SAAS,CAAC;CACvD;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,mDAAmD;IACnD,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;CAC/B;AAED;;;;;;;;GAQG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,GAAE,eAAoB,GAAG,cAAc,CAElF;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,oBAAoB,CAChC,CAAC,EAAE,aAAa,EAChB,eAAe,EAAE,GAAG,GAAG,GAAG,EAC1B,CAAC,GAAE,eAAoB,GACxB,cAAc,CAEhB"}

package/dist/src/indexed/pagerank.js

@@ -1,22 +1,60 @@
 /**
- * PageRank by pull over `reverse()`, with the dangling mass redistributed uniformly.
- * @param s - A DIRECTED snapshot
+ * PageRank by pull over `reverse()`, with the dangling mass redistributed uniformly. On an
+ * undirected snapshot every edge carries rank both ways (a self-loop once), which is PageRank on
+ * the directed graph holding both arcs of every edge.
+ * @param s - The 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");
-    }
+    return run(s, null, o);
+}
+/**
+ * Personalized PageRank, as the legacy function computes it: the personalization vector,
+ * normalised to sum 1, replaces the uniform `1 / n` in the teleport, and each node receives
+ * `d * dangling / n` of the dangling mass scaled by its personalization. That keeps only a
+ * `1 / n` share of the dangling mass, so on a graph with a dangling node the scores sum to less
+ * than 1 (networkx spreads all of it). An all-zero vector gives plain PageRank, as the legacy
+ * function does for an empty list of personal nodes.
+ * @param s - The snapshot
+ * @param personalization - One finite, non-negative mass per node index
+ * @param o - Algorithm options
+ * @returns The scores, the iteration count and the convergence flag
+ * @public
+ */
+export function personalizedPageRank(s, personalization, o = {}) {
+    return run(s, distribution(personalization, s.nodeCount, "personalization"), o);
+}
+/**
+ * The shared power iteration.
+ * @param s - The snapshot
+ * @param p - The normalised personalization, or null for the uniform teleport
+ * @param o - Algorithm options
+ * @returns The scores, the iteration count and the convergence flag
+ */
+function run(s, p, o) {
     const n = s.nodeCount;
     const d = o.dampingFactor ?? 0.85;
     const maxIter = o.maxIterations ?? 100;
     const tol = o.tolerance ?? 1e-6;
+    const useMax = o.convergenceNorm === "max";
+    if (n === 0) {
+        return { scores: new Float64Array(0), iterations: 0, converged: true };
+    }
     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);
+    // The f64 shadow toSnapshot keeps when a weight is not f32-exact, else the f32 arc weights.
+    const shadow = weighted ? s.edges.byRole("weight") : null;
+    const exact = shadow?.dtype === "f64" ? shadow.data : null;
+    let revW = weighted ? rev.weights : null;
+    let outW = weighted ? s.weightedOutDegree() : s.outDegree();
+    if (exact !== null) {
+        revW = gather(exact, rev.arcToEdge);
+        outW = rowSums(s, gather(exact, s.arcToEdge));
+    }
+    let rank = (o.initialRanks === undefined ? null : distribution(o.initialRanks, n, "initialRanks")) ??
+        new Float64Array(n).fill(o.initialRanks === undefined ? 1 / n : 0);
     let next = new Float64Array(n);
     let it = 0;
     let converged = false;
@@ -27,7 +65,9 @@ export function pageRank(s, o = {}) {
                 dangling += rank[u];
             }
         }
-        const base = (1 - d) / n + (d * dangling) / n;
+        // Teleport (1 - d) spread by p or uniformly; the dangling mass d * dangling spread uniformly,
+        // and with p scaled by p[v] on top of the uniform 1 / n, as the legacy function does.
+        const spread = 1 - d + d * dangling * (p === null ? 1 : 1 / n);
         let delta = 0;
         for (let v = 0; v < n; v++) {
             let acc = 0;
@@ -36,15 +76,71 @@ export function pageRank(s, o = {}) {
                 const u = rev.colIdx[a];
                 const ow = outW[u];
                 if (ow > 0) {
-                    acc += (rank[u] * (weighted && rev.weights !== null ? rev.weights[a] : 1)) / ow;
+                    acc += (rank[u] * (revW === null ? 1 : revW[a])) / ow;
                 }
             }
-            next[v] = base + d * acc;
-            delta += Math.abs(next[v] - rank[v]);
+            next[v] = spread * (p === null ? 1 / n : p[v]) + d * acc;
+            const change = Math.abs(next[v] - rank[v]);
+            delta = useMax ? Math.max(delta, change) : delta + change;
         }
         [rank, next] = [next, rank];
         converged = delta < tol;
     }
     return { scores: rank, iterations: it, converged };
 }
+/**
+ * One value per arc, read through the arc's logical edge.
+ * @param perEdge - One value per logical edge
+ * @param arcToEdge - The logical edge of every arc
+ * @returns One value per arc
+ */
+function gather(perEdge, arcToEdge) {
+    const out = new Float64Array(arcToEdge.length);
+    for (let a = 0; a < out.length; a++) {
+        out[a] = perEdge[arcToEdge[a]];
+    }
+    return out;
+}
+/**
+ * The sum of each node's out-arc values.
+ * @param s - The snapshot
+ * @param perArc - One value per forward arc
+ * @returns One sum per node
+ */
+function rowSums(s, perArc) {
+    const out = new Float64Array(s.nodeCount);
+    for (let u = 0; u < s.nodeCount; u++) {
+        for (let a = s.rowPtr[u]; a < s.rowPtr[u + 1]; a++) {
+            out[u] += perArc[a];
+        }
+    }
+    return out;
+}
+/**
+ * Check a per-node mass vector and normalise it to sum 1.
+ * @param v - The caller's vector
+ * @param n - The node count
+ * @param name - The option's name, for the message
+ * @returns A normalised copy, or null when every entry is 0
+ */
+function distribution(v, n, name) {
+    if (v.length !== n) {
+        throw new Error(`PageRank: ${name} has ${String(v.length)} entries for ${String(n)} nodes`);
+    }
+    let total = 0;
+    for (const mass of v) {
+        if (!Number.isFinite(mass) || mass < 0) {
+            throw new Error(`PageRank: ${name} must be finite and non-negative, got ${String(mass)}`);
+        }
+        total += mass;
+    }
+    if (total === 0) {
+        return null;
+    }
+    const out = new Float64Array(n);
+    for (let u = 0; u < n; u++) {
+        out[u] = v[u] / total;
+    }
+    return out;
+}
 //# sourceMappingURL=pagerank.js.map

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

@@ -1 +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"}
+{"version":3,"file":"pagerank.js","sourceRoot":"","sources":["../../../src/indexed/pagerank.ts"],"names":[],"mappings":"AA+BA;;;;;;;;GAQG;AACH,MAAM,UAAU,QAAQ,CAAC,CAAgB,EAAE,IAAqB,EAAE;IAC9D,OAAO,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;AAC3B,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,oBAAoB,CAChC,CAAgB,EAChB,eAA0B,EAC1B,IAAqB,EAAE;IAEvB,OAAO,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,eAAe,EAAE,CAAC,CAAC,SAAS,EAAE,iBAAiB,CAAC,EAAE,CAAC,CAAC,CAAC;AACpF,CAAC;AAED;;;;;;GAMG;AACH,SAAS,GAAG,CAAC,CAAgB,EAAE,CAAa,EAAE,CAAkB;IAC5D,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,MAAM,GAAG,CAAC,CAAC,eAAe,KAAK,KAAK,CAAC;IAC3C,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACV,OAAO,EAAE,MAAM,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;IAC3E,CAAC;IACD,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,4FAA4F;IAC5F,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC1D,MAAM,KAAK,GAAG,MAAM,EAAE,KAAK,KAAK,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IAC3D,IAAI,IAAI,GAAyB,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC;IAC/D,IAAI,IAAI,GAAkB,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;IAC3E,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QACjB,IAAI,GAAG,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;QACpC,IAAI,GAAG,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAClD,CAAC;IACD,IAAI,IAAI,GACJ,CAAC,CAAC,CAAC,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;QACvF,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,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,8FAA8F;QAC9F,sFAAsF;QACtF,MAAM,MAAM,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,QAAQ,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/D,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,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;gBAC1D,CAAC;YACL,CAAC;YACD,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;YACzD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3C,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,MAAM,CAAC;QAC9D,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;AAED;;;;;GAKG;AACH,SAAS,MAAM,CAAC,OAAY,EAAE,SAAsB;IAChD,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,GAAG,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC;IACD,OAAO,GAAG,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,SAAS,OAAO,CAAC,CAAgB,EAAE,MAAW;IAC1C,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACjD,GAAG,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC;IACL,CAAC;IACD,OAAO,GAAG,CAAC;AACf,CAAC;AAED;;;;;;GAMG;AACH,SAAS,YAAY,CAAC,CAAY,EAAE,CAAS,EAAE,IAAY;IACvD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACjB,MAAM,IAAI,KAAK,CAAC,aAAa,IAAI,QAAQ,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,gBAAgB,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IAChG,CAAC;IACD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC;QACnB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACrC,MAAM,IAAI,KAAK,CAAC,aAAa,IAAI,yCAAyC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC9F,CAAC;QACD,KAAK,IAAI,IAAI,CAAC;IAClB,CAAC;IACD,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QACd,OAAO,IAAI,CAAC;IAChB,CAAC;IACD,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,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;IAC1B,CAAC;IACD,OAAO,GAAG,CAAC;AACf,CAAC"}

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

@@ -0,0 +1,53 @@
+import { type AdjacencyView, type F64, type GraphSnapshot, type NumericVector, type U32 } from "@graphty/graph-format";
+/** Options of the point-to-point searches. @public */
+export interface PathOptions {
+    /** Per-arc weight override, arcCount long -- the facade passes `expandEdges(s, shadow.data)`. */
+    readonly weights?: NumericVector | undefined;
+}
+/** One shortest path between two nodes. @public */
+export interface PathResult {
+    /** Sum of the path's weights, added from the source; Infinity when the target is unreachable. */
+    readonly distance: number;
+    /** Node indices from the source to the target inclusive; empty when unreachable. */
+    readonly path: U32;
+    /** Logical edge indices along the path, one fewer than `path`: the exact parallel edge taken. */
+    readonly edges: U32;
+}
+/** A* result: the path plus the search state the legacy `astarWithDetails` reports. @public */
+export interface AstarResult extends PathResult {
+    /** Best known cost from the source per node; Infinity for a node the search never reached. */
+    readonly gScore: F64;
+    /** `gScore` plus the heuristic, per node; Infinity for a node the search never reached. */
+    readonly fScore: F64;
+    /** Nodes expanded, in expansion order; the target is not expanded, so it is not listed. */
+    readonly visited: U32;
+}
+/**
+ * Bidirectional Dijkstra between two nodes: one search forward from the source, one backward from
+ * the target over `reverse()`, each step taken by the side whose next key is smaller, stopping once
+ * the two next keys sum to at least the best path found. That is the point-to-point query legacy
+ * `dijkstraPath` answers. The path is recorded as ARCS, so a parallel edge on it is the exact edge.
+ * @param s - The snapshot to search
+ * @param source - The node index to start from
+ * @param target - The node index to reach
+ * @param options - Per-arc weight override
+ * @returns The distance, the node path and the logical edges on it
+ * @throws Error when any weight is negative
+ * @public
+ */
+export declare function bidirectionalDijkstra(s: GraphSnapshot, source: number, target: number, options?: PathOptions): PathResult;
+/**
+ * A* between two nodes: Dijkstra keyed by cost so far plus `heuristic(node, target)`, stopping when
+ * the target is taken from the queue. An expanded node is never reopened, as in legacy `astar`, so
+ * the path is shortest when the heuristic is consistent. The predecessor is the relaxing ARC, so a
+ * parallel edge on the path is the exact edge.
+ * @param g - The adjacency to search
+ * @param source - The node index to start from
+ * @param target - The node index to reach
+ * @param heuristic - Estimated remaining cost from a node index to the target index
+ * @param options - Per-arc weight override
+ * @returns The path, plus the per-node scores and the expansion order
+ * @public
+ */
+export declare function astar(g: AdjacencyView, source: number, target: number, heuristic: (node: number, target: number) => number, options?: PathOptions): AstarResult;
+//# sourceMappingURL=point-to-point.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"point-to-point.d.ts","sourceRoot":"","sources":["../../../src/indexed/point-to-point.ts"],"names":[],"mappings":"AAAA,OAAO,EACH,KAAK,aAAa,EAClB,KAAK,GAAG,EACR,KAAK,aAAa,EAElB,KAAK,aAAa,EAClB,KAAK,GAAG,EACX,MAAM,uBAAuB,CAAC;AAK/B,sDAAsD;AACtD,MAAM,WAAW,WAAW;IACxB,iGAAiG;IACjG,QAAQ,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC;CAChD;AAED,mDAAmD;AACnD,MAAM,WAAW,UAAU;IACvB,iGAAiG;IACjG,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,oFAAoF;IACpF,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC;IACnB,iGAAiG;IACjG,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC;CACvB;AAED,+FAA+F;AAC/F,MAAM,WAAW,WAAY,SAAQ,UAAU;IAC3C,8FAA8F;IAC9F,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC;IACrB,2FAA2F;IAC3F,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC;IACrB,2FAA2F;IAC3F,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC;CACzB;AAID;;;;;;;;;;;;GAYG;AACH,wBAAgB,qBAAqB,CACjC,CAAC,EAAE,aAAa,EAChB,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,OAAO,GAAE,WAAgB,GAC1B,UAAU,CAkGZ;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,KAAK,CACjB,CAAC,EAAE,aAAa,EAChB,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,KAAK,MAAM,EACnD,OAAO,GAAE,WAAgB,GAC1B,WAAW,CA0Cb"}

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

@@ -0,0 +1,173 @@
+import { INVALID_INDEX, } from "@graphty/graph-format";
+import { walkPredArcs, walkPredEdges } from "./dijkstra.js";
+import { IndexedMinHeap } from "./structures/min-heap.js";
+const NO_PATH = { distance: Infinity, path: new Uint32Array(0), edges: new Uint32Array(0) };
+/**
+ * Bidirectional Dijkstra between two nodes: one search forward from the source, one backward from
+ * the target over `reverse()`, each step taken by the side whose next key is smaller, stopping once
+ * the two next keys sum to at least the best path found. That is the point-to-point query legacy
+ * `dijkstraPath` answers. The path is recorded as ARCS, so a parallel edge on it is the exact edge.
+ * @param s - The snapshot to search
+ * @param source - The node index to start from
+ * @param target - The node index to reach
+ * @param options - Per-arc weight override
+ * @returns The distance, the node path and the logical edges on it
+ * @throws Error when any weight is negative
+ * @public
+ */
+export function bidirectionalDijkstra(s, source, target, options = {}) {
+    if (source === target) {
+        return { distance: 0, path: Uint32Array.of(source), edges: new Uint32Array(0) };
+    }
+    const n = s.nodeCount;
+    const weights = options.weights ?? s.weights;
+    // Checked up front, not per relaxed arc: the search stops early, so a per-arc check would miss
+    // a negative edge beyond the meeting point that legacy (which runs both searches out) refuses.
+    if (weights?.some((w) => w < 0) === true) {
+        throw new Error("Bidirectional Dijkstra does not support negative edge weights");
+    }
+    const rev = s.reverse();
+    const weightOf = (arc) => (weights === null ? 1 : weights[arc]);
+    const distF = new Float64Array(n).fill(Infinity);
+    const distB = new Float64Array(n).fill(Infinity);
+    // Forward: the arc into each node. Backward: the reverse-view arc that reached each node from
+    // its successor toward the target -- on an undirected snapshot that arc points the other way,
+    // so the successor node is kept too rather than read off the arc.
+    const predArc = new Uint32Array(n).fill(INVALID_INDEX);
+    const succRevArc = new Uint32Array(n).fill(INVALID_INDEX);
+    const succNode = new Uint32Array(n).fill(INVALID_INDEX);
+    const heapF = new IndexedMinHeap(n);
+    const heapB = new IndexedMinHeap(n);
+    distF[source] = 0;
+    distB[target] = 0;
+    heapF.push(source, 0);
+    heapB.push(target, 0);
+    let best = Infinity;
+    // The step joining the two searches: meetFrom -> meetTo over logical edge meetEdge.
+    let meetFrom = INVALID_INDEX;
+    let meetTo = INVALID_INDEX;
+    let meetEdge = INVALID_INDEX;
+    let meetWeight = 0;
+    while (heapF.peekKey() + heapB.peekKey() < best) {
+        if (heapF.peekKey() <= heapB.peekKey()) {
+            const u = heapF.pop();
+            for (let a = s.rowPtr[u]; a < s.rowPtr[u + 1]; a++) {
+                const v = s.colIdx[a];
+                const w = weightOf(a);
+                const dv = distF[u] + w;
+                if (dv < distF[v]) {
+                    distF[v] = dv;
+                    predArc[v] = a;
+                    heapF.pushOrDecrease(v, dv);
+                }
+                if (dv + distB[v] < best) {
+                    best = dv + distB[v];
+                    [meetFrom, meetTo, meetEdge, meetWeight] = [u, v, s.arcToEdge[a], w];
+                }
+            }
+        }
+        else {
+            const v = heapB.pop();
+            for (let k = rev.rowPtr[v]; k < rev.rowPtr[v + 1]; k++) {
+                const u = rev.colIdx[k];
+                const w = weightOf(rev.fwdArc[k]);
+                const du = distB[v] + w;
+                if (du < distB[u]) {
+                    distB[u] = du;
+                    succRevArc[u] = k;
+                    succNode[u] = v;
+                    heapB.pushOrDecrease(u, du);
+                }
+                if (distF[u] + du < best) {
+                    best = distF[u] + du;
+                    [meetFrom, meetTo, meetEdge, meetWeight] = [u, v, rev.arcToEdge[k], w];
+                }
+            }
+        }
+    }
+    if (meetFrom === INVALID_INDEX) {
+        return NO_PATH;
+    }
+    const nodes = [];
+    const edges = [];
+    const steps = []; // the weight of each edge, source end first
+    for (let node = meetFrom; node !== source; node = s.arcSource(predArc[node])) {
+        nodes.push(node);
+        edges.push(s.arcToEdge[predArc[node]]);
+        steps.push(weightOf(predArc[node]));
+    }
+    nodes.push(source);
+    nodes.reverse();
+    edges.reverse();
+    steps.reverse();
+    edges.push(meetEdge);
+    steps.push(meetWeight);
+    nodes.push(meetTo);
+    for (let node = meetTo; node !== target; node = succNode[node]) {
+        edges.push(rev.arcToEdge[succRevArc[node]]);
+        steps.push(weightOf(rev.fwdArc[succRevArc[node]]));
+        nodes.push(succNode[node]);
+    }
+    let distance = 0;
+    for (const w of steps) {
+        distance += w;
+    }
+    return { distance, path: Uint32Array.from(nodes), edges: Uint32Array.from(edges) };
+}
+/**
+ * A* between two nodes: Dijkstra keyed by cost so far plus `heuristic(node, target)`, stopping when
+ * the target is taken from the queue. An expanded node is never reopened, as in legacy `astar`, so
+ * the path is shortest when the heuristic is consistent. The predecessor is the relaxing ARC, so a
+ * parallel edge on the path is the exact edge.
+ * @param g - The adjacency to search
+ * @param source - The node index to start from
+ * @param target - The node index to reach
+ * @param heuristic - Estimated remaining cost from a node index to the target index
+ * @param options - Per-arc weight override
+ * @returns The path, plus the per-node scores and the expansion order
+ * @public
+ */
+export function astar(g, source, target, heuristic, options = {}) {
+    const n = g.nodeCount;
+    if (!(target >= 0 && target < n)) {
+        throw new RangeError(`Target index ${String(target)} is outside the graph's ${String(n)} nodes`);
+    }
+    const weights = options.weights ?? g.weights;
+    const gScore = new Float64Array(n).fill(Infinity);
+    const fScore = new Float64Array(n).fill(Infinity);
+    const predArc = new Uint32Array(n).fill(INVALID_INDEX);
+    const closed = new Uint8Array(n);
+    const visited = [];
+    const heap = new IndexedMinHeap(n);
+    gScore[source] = 0;
+    fScore[source] = heuristic(source, target);
+    heap.push(source, fScore[source]);
+    while (!heap.isEmpty()) {
+        const u = heap.pop();
+        if (u === target) {
+            break;
+        }
+        closed[u] = 1;
+        visited.push(u);
+        for (let a = g.rowPtr[u]; a < g.rowPtr[u + 1]; a++) {
+            const v = g.colIdx[a];
+            if (closed[v] === 1) {
+                continue;
+            }
+            const tentative = gScore[u] + (weights === null ? 1 : weights[a]);
+            if (tentative < gScore[v]) {
+                gScore[v] = tentative;
+                fScore[v] = tentative + heuristic(v, target);
+                predArc[v] = a;
+                heap.pushOrDecrease(v, fScore[v]);
+            }
+        }
+    }
+    const state = { gScore, fScore, visited: Uint32Array.from(visited) };
+    if (gScore[target] === Infinity) {
+        return { ...NO_PATH, ...state };
+    }
+    const path = walkPredArcs(g, predArc, source, target);
+    return { distance: gScore[target], path, edges: walkPredEdges(g, predArc, source, target), ...state };
+}
+//# sourceMappingURL=point-to-point.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"point-to-point.js","sourceRoot":"","sources":["../../../src/indexed/point-to-point.ts"],"names":[],"mappings":"AAAA,OAAO,EAIH,aAAa,GAGhB,MAAM,uBAAuB,CAAC;AAE/B,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AAC5D,OAAO,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAC;AA4B1D,MAAM,OAAO,GAAe,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,WAAW,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;AAExG;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,qBAAqB,CACjC,CAAgB,EAChB,MAAc,EACd,MAAc,EACd,UAAuB,EAAE;IAEzB,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;QACpB,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,IAAI,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;IACpF,CAAC;IACD,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;IACtB,MAAM,OAAO,GAAyB,OAAO,CAAC,OAAO,IAAI,CAAC,CAAC,OAAO,CAAC;IACnE,+FAA+F;IAC/F,+FAA+F;IAC/F,IAAI,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QACvC,MAAM,IAAI,KAAK,CAAC,+DAA+D,CAAC,CAAC;IACrF,CAAC;IACD,MAAM,GAAG,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC;IACxB,MAAM,QAAQ,GAAG,CAAC,GAAW,EAAU,EAAE,CAAC,CAAC,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;IAChF,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACjD,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACjD,8FAA8F;IAC9F,8FAA8F;IAC9F,kEAAkE;IAClE,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IACvD,MAAM,UAAU,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IAC1D,MAAM,QAAQ,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IACxD,MAAM,KAAK,GAAG,IAAI,cAAc,CAAC,CAAC,CAAC,CAAC;IACpC,MAAM,KAAK,GAAG,IAAI,cAAc,CAAC,CAAC,CAAC,CAAC;IACpC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAClB,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAClB,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACtB,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACtB,IAAI,IAAI,GAAG,QAAQ,CAAC;IACpB,oFAAoF;IACpF,IAAI,QAAQ,GAAG,aAAa,CAAC;IAC7B,IAAI,MAAM,GAAG,aAAa,CAAC;IAC3B,IAAI,QAAQ,GAAG,aAAa,CAAC;IAC7B,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,OAAO,KAAK,CAAC,OAAO,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,GAAG,IAAI,EAAE,CAAC;QAC9C,IAAI,KAAK,CAAC,OAAO,EAAE,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YACrC,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;YACtB,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjD,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACtB,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACtB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACxB,IAAI,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;oBAChB,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;oBACd,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBACf,KAAK,CAAC,cAAc,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAChC,CAAC;gBACD,IAAI,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC;oBACvB,IAAI,GAAG,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;oBACrB,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACzE,CAAC;YACL,CAAC;QACL,CAAC;aAAM,CAAC;YACJ,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;YACtB,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrD,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxB,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACxB,IAAI,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;oBAChB,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;oBACd,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBAClB,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBAChB,KAAK,CAAC,cAAc,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAChC,CAAC;gBACD,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,IAAI,EAAE,CAAC;oBACvB,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;oBACrB,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC3E,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IACD,IAAI,QAAQ,KAAK,aAAa,EAAE,CAAC;QAC7B,OAAO,OAAO,CAAC;IACnB,CAAC;IACD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,KAAK,GAAa,EAAE,CAAC,CAAC,4CAA4C;IACxE,KAAK,IAAI,IAAI,GAAG,QAAQ,EAAE,IAAI,KAAK,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;QAC3E,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACnB,KAAK,CAAC,OAAO,EAAE,CAAC;IAChB,KAAK,CAAC,OAAO,EAAE,CAAC;IAChB,KAAK,CAAC,OAAO,EAAE,CAAC;IAChB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACrB,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACvB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACnB,KAAK,IAAI,IAAI,GAAG,MAAM,EAAE,IAAI,KAAK,MAAM,EAAE,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QAC7D,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5C,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACnD,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;IAC/B,CAAC;IACD,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACpB,QAAQ,IAAI,CAAC,CAAC;IAClB,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;AACvF,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,KAAK,CACjB,CAAgB,EAChB,MAAc,EACd,MAAc,EACd,SAAmD,EACnD,UAAuB,EAAE;IAEzB,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;IACtB,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC;QAC/B,MAAM,IAAI,UAAU,CAAC,gBAAgB,MAAM,CAAC,MAAM,CAAC,2BAA2B,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACrG,CAAC;IACD,MAAM,OAAO,GAAyB,OAAO,CAAC,OAAO,IAAI,CAAC,CAAC,OAAO,CAAC;IACnE,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAClD,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAClD,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IACvD,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IACjC,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,IAAI,GAAG,IAAI,cAAc,CAAC,CAAC,CAAC,CAAC;IACnC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACnB,MAAM,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC3C,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAClC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC;QACrB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACrB,IAAI,CAAC,KAAK,MAAM,EAAE,CAAC;YACf,MAAM;QACV,CAAC;QACD,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACd,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACjD,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBAClB,SAAS;YACb,CAAC;YACD,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAClE,IAAI,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;gBACxB,MAAM,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;gBACtB,MAAM,CAAC,CAAC,CAAC,GAAG,SAAS,GAAG,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;gBAC7C,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACf,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC;QACL,CAAC;IACL,CAAC;IACD,MAAM,KAAK,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;IACrE,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,QAAQ,EAAE,CAAC;QAC9B,OAAO,EAAE,GAAG,OAAO,EAAE,GAAG,KAAK,EAAE,CAAC;IACpC,CAAC;IACD,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IACtD,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,GAAG,KAAK,EAAE,CAAC;AAC1G,CAAC"}

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

@@ -0,0 +1,53 @@
+import { type AdjacencyView, type DerivedGraph, type GraphSnapshot, type U32 } from "@graphty/graph-format";
+import { type ArcOrderOption } from "./bfs.js";
+import { type LabelResult } from "./components.js";
+/** Result of {@link condensation}. @public */
+export interface CondensationResult {
+    /** The strongly connected components, labelled in Tarjan completion order. */
+    readonly components: LabelResult;
+    /**
+     * The condensed DAG from `contract(components.labels)`: node `c` is component `c`, one edge per
+     * connected ordered pair of components, no self-loops. Its weights are those of the first source
+     * edge of each pair; its `nodeRemap` equals `components.labels`.
+     */
+    readonly condensed: DerivedGraph;
+}
+/**
+ * Strongly connected components by an iterative Tarjan: roots in index order, neighbours in row
+ * order unless `options.arcOrder` gives another, and component `c` is the `c`-th to complete -- the numbering the legacy
+ * `stronglyConnectedComponents` gives its result array. Completion order is a reverse topological
+ * order of the condensation.
+ * @param g - A directed adjacency
+ * @param options - The neighbour order
+ * @returns The partition, labels in completion order
+ * @throws Error when the graph is undirected
+ * @public
+ */
+export declare function stronglyConnectedComponents(g: AdjacencyView, options?: ArcOrderOption): LabelResult;
+/**
+ * The Tarjan walk behind {@link stronglyConnectedComponents}, also returning every node in the
+ * order it left the component stack. Each component leaves as one run, in label order, its members
+ * in reverse discovery order -- the order the legacy `stronglyConnectedComponents` lists them in.
+ * @param g - A directed adjacency
+ * @param options - The neighbour order
+ * @returns The labels, their count and the pop order
+ * @throws Error when the graph is undirected
+ */
+export declare function tarjan(g: AdjacencyView, options?: ArcOrderOption): {
+    labels: U32;
+    count: number;
+    popped: U32;
+};
+/**
+ * The condensation of a directed graph: its strongly connected components, and the DAG with one
+ * node per component that `contract()` builds from their labels. The labels already run `0..k-1`,
+ * so contract keeps them as block indices and the condensed node numbering is the component
+ * numbering.
+ * @param s - A directed snapshot
+ * @param options - The neighbour order Tarjan tries arcs in, which fixes the component numbering
+ * @returns The components and the condensed graph
+ * @throws Error when the snapshot is undirected
+ * @public
+ */
+export declare function condensation(s: GraphSnapshot, options?: ArcOrderOption): CondensationResult;
+//# sourceMappingURL=scc.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"scc.d.ts","sourceRoot":"","sources":["../../../src/indexed/scc.ts"],"names":[],"mappings":"AAAA,OAAO,EACH,KAAK,aAAa,EAClB,KAAK,YAAY,EACjB,KAAK,aAAa,EAElB,KAAK,GAAG,EACX,MAAM,uBAAuB,CAAC;AAE/B,OAAO,EAAE,KAAK,cAAc,EAAiB,MAAM,UAAU,CAAC;AAC9D,OAAO,EAAE,KAAK,WAAW,EAAc,MAAM,iBAAiB,CAAC;AAE/D,8CAA8C;AAC9C,MAAM,WAAW,kBAAkB;IAC/B,8EAA8E;IAC9E,QAAQ,CAAC,UAAU,EAAE,WAAW,CAAC;IACjC;;;;OAIG;IACH,QAAQ,CAAC,SAAS,EAAE,YAAY,CAAC;CACpC;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,2BAA2B,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,GAAE,cAAmB,GAAG,WAAW,CAGvG;AAED;;;;;;;;GAQG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,GAAE,cAAmB,GAAG;IAAE,MAAM,EAAE,GAAG,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,GAAG,CAAA;CAAE,CAkElH;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,GAAE,cAAmB,GAAG,kBAAkB,CAI/F"}