graphwise 1.9.1 → 1.11.0

package/dist/expansion/types.d.ts

@@ -1,3 +1,5 @@
+import { ComputeBackend } from '../gpu/types';
+import { GraphwiseGPURoot } from '../gpu/root';
 import { NodeId, NodeData, EdgeData, ReadableGraph } from '../graph';
 /**
  * Role of a seed node in expansion.
@@ -38,6 +40,30 @@ export interface PriorityContext<N extends NodeData = NodeData, E extends EdgeDa
  * Lower values = higher priority (expanded first).
  */
 export type PriorityFunction<N extends NodeData = NodeData, E extends EdgeData = EdgeData> = (nodeId: NodeId, context: PriorityContext<N, E>) => number;
+/**
+ * Context provided to batch priority functions for batch processing.
+ */
+export interface BatchPriorityContext<N extends NodeData = NodeData, E extends EdgeData = EdgeData> {
+    /** The source graph */
+    readonly graph: ReadableGraph<N, E>;
+    /** Set of all visited nodes */
+    readonly visited: ReadonlySet<NodeId>;
+    /** Map of node ID to frontier index that visited it */
+    readonly visitedByFrontier: ReadonlyMap<NodeId, number>;
+    /** Frontier ID for the current batch */
+    readonly frontierId: number;
+    /** Paths discovered so far (for REACH-style algorithms) */
+    readonly discoveredPaths: readonly ExpansionPath[];
+    /** Optional GPU backend selection */
+    readonly backend?: ComputeBackend;
+    /** Optional TypeGPU root for GPU acceleration */
+    readonly root?: GraphwiseGPURoot;
+}
+/**
+ * Function that computes priorities for multiple nodes at once.
+ * Returns a Map of node ID to priority (lower values = higher priority).
+ */
+export type BatchPriorityFunction<N extends NodeData = NodeData, E extends EdgeData = EdgeData> = (candidates: readonly NodeId[], context: BatchPriorityContext<N, E>) => ReadonlyMap<NodeId, number>;
 /**
  * A path discovered by bidirectional expansion.
  */
@@ -97,6 +123,10 @@ export interface ExpansionConfig<N extends NodeData = NodeData, E extends EdgeDa
     readonly maxPaths?: number;
     /** Custom priority function */
     readonly priority?: PriorityFunction<N, E>;
+    /** Custom batch priority function for batch processing */
+    readonly batchPriority?: BatchPriorityFunction<N, E>;
+    /** Batch priority function for GPU acceleration */
+    readonly batchPriorityGPU?: BatchPriorityFunction<N, E>;
     /** Random seed for reproducibility */
     readonly seed?: number;
     /** Enable debug logging */

package/dist/expansion/types.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/expansion/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AAE1E;;GAEG;AACH,MAAM,MAAM,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG,eAAe,CAAC;AAE7D;;GAEG;AACH,MAAM,WAAW,IAAI;IACpB,sBAAsB;IACtB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,iDAAiD;IACjD,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC;CACzB;AAED;;GAEG;AACH,MAAM,WAAW,eAAe,CAC/B,CAAC,SAAS,QAAQ,GAAG,QAAQ,EAC7B,CAAC,SAAS,QAAQ,GAAG,QAAQ;IAE7B,uBAAuB;IACvB,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpC,2CAA2C;IAC3C,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,iDAAiD;IACjD,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,uDAAuD;IACvD,QAAQ,CAAC,iBAAiB,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACxD,+BAA+B;IAC/B,QAAQ,CAAC,UAAU,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IACzC,8BAA8B;IAC9B,QAAQ,CAAC,eAAe,EAAE,SAAS,aAAa,EAAE,CAAC;IACnD,+BAA+B;IAC/B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,4CAA4C;IAC5C,QAAQ,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC;CACrB;AAED;;;GAGG;AACH,MAAM,MAAM,gBAAgB,CAC3B,CAAC,SAAS,QAAQ,GAAG,QAAQ,EAC7B,CAAC,SAAS,QAAQ,GAAG,QAAQ,IAC1B,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC;AAE/D;;GAEG;AACH,MAAM,WAAW,aAAa;IAC7B,kBAAkB;IAClB,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC;IACxB,kBAAkB;IAClB,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC;IACtB,iDAAiD;IACjD,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,8BAA8B;IAC9B,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;CAC3B;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC9B,uBAAuB;IACvB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,0BAA0B;IAC1B,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,4BAA4B;IAC5B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,uBAAuB;IACvB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,yCAAyC;IACzC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,qBAAqB;IACrB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,yBAAyB;IACzB,QAAQ,CAAC,WAAW,EAAE,WAAW,GAAG,OAAO,GAAG,WAAW,GAAG,OAAO,CAAC;CACpE;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC/B,2BAA2B;IAC3B,QAAQ,CAAC,KAAK,EAAE,SAAS,aAAa,EAAE,CAAC;IACzC,qCAAqC;IACrC,QAAQ,CAAC,YAAY,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IAC3C,qCAAqC;IACrC,QAAQ,CAAC,YAAY,EAAE,WAAW,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC9D,iCAAiC;IACjC,QAAQ,CAAC,kBAAkB,EAAE,SAAS,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC;IAC5D,2BAA2B;IAC3B,QAAQ,CAAC,KAAK,EAAE,cAAc,CAAC;CAC/B;AAED;;GAEG;AACH,MAAM,WAAW,eAAe,CAC/B,CAAC,SAAS,QAAQ,GAAG,QAAQ,EAC7B,CAAC,SAAS,QAAQ,GAAG,QAAQ;IAE7B,uDAAuD;IACvD,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAC3B,mDAAmD;IACnD,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;IAChC,gEAAgE;IAChE,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAC3B,+BAA+B;IAC/B,QAAQ,CAAC,QAAQ,CAAC,EAAE,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3C,sCAAsC;IACtC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IACvB,2BAA2B;IAC3B,QAAQ,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC;CACzB"}
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/expansion/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AACnD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AACpD,OAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AAE1E;;GAEG;AACH,MAAM,MAAM,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG,eAAe,CAAC;AAE7D;;GAEG;AACH,MAAM,WAAW,IAAI;IACpB,sBAAsB;IACtB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,iDAAiD;IACjD,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC;CACzB;AAED;;GAEG;AACH,MAAM,WAAW,eAAe,CAC/B,CAAC,SAAS,QAAQ,GAAG,QAAQ,EAC7B,CAAC,SAAS,QAAQ,GAAG,QAAQ;IAE7B,uBAAuB;IACvB,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpC,2CAA2C;IAC3C,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,iDAAiD;IACjD,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,uDAAuD;IACvD,QAAQ,CAAC,iBAAiB,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACxD,+BAA+B;IAC/B,QAAQ,CAAC,UAAU,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IACzC,8BAA8B;IAC9B,QAAQ,CAAC,eAAe,EAAE,SAAS,aAAa,EAAE,CAAC;IACnD,+BAA+B;IAC/B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,4CAA4C;IAC5C,QAAQ,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC;CACrB;AAED;;;GAGG;AACH,MAAM,MAAM,gBAAgB,CAC3B,CAAC,SAAS,QAAQ,GAAG,QAAQ,EAC7B,CAAC,SAAS,QAAQ,GAAG,QAAQ,IAC1B,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC;AAE/D;;GAEG;AACH,MAAM,WAAW,oBAAoB,CACpC,CAAC,SAAS,QAAQ,GAAG,QAAQ,EAC7B,CAAC,SAAS,QAAQ,GAAG,QAAQ;IAE7B,uBAAuB;IACvB,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpC,+BAA+B;IAC/B,QAAQ,CAAC,OAAO,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IACtC,uDAAuD;IACvD,QAAQ,CAAC,iBAAiB,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACxD,wCAAwC;IACxC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,2DAA2D;IAC3D,QAAQ,CAAC,eAAe,EAAE,SAAS,aAAa,EAAE,CAAC;IACnD,qCAAqC;IACrC,QAAQ,CAAC,OAAO,CAAC,EAAE,cAAc,CAAC;IAClC,iDAAiD;IACjD,QAAQ,CAAC,IAAI,CAAC,EAAE,gBAAgB,CAAC;CACjC;AAED;;;GAGG;AACH,MAAM,MAAM,qBAAqB,CAChC,CAAC,SAAS,QAAQ,GAAG,QAAQ,EAC7B,CAAC,SAAS,QAAQ,GAAG,QAAQ,IAC1B,CACH,UAAU,EAAE,SAAS,MAAM,EAAE,EAC7B,OAAO,EAAE,oBAAoB,CAAC,CAAC,EAAE,CAAC,CAAC,KAC/B,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAEjC;;GAEG;AACH,MAAM,WAAW,aAAa;IAC7B,kBAAkB;IAClB,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC;IACxB,kBAAkB;IAClB,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC;IACtB,iDAAiD;IACjD,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,8BAA8B;IAC9B,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;CAC3B;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC9B,uBAAuB;IACvB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,0BAA0B;IAC1B,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,4BAA4B;IAC5B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,uBAAuB;IACvB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,yCAAyC;IACzC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,qBAAqB;IACrB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,yBAAyB;IACzB,QAAQ,CAAC,WAAW,EAAE,WAAW,GAAG,OAAO,GAAG,WAAW,GAAG,OAAO,CAAC;CACpE;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC/B,2BAA2B;IAC3B,QAAQ,CAAC,KAAK,EAAE,SAAS,aAAa,EAAE,CAAC;IACzC,qCAAqC;IACrC,QAAQ,CAAC,YAAY,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IAC3C,qCAAqC;IACrC,QAAQ,CAAC,YAAY,EAAE,WAAW,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC9D,iCAAiC;IACjC,QAAQ,CAAC,kBAAkB,EAAE,SAAS,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC;IAC5D,2BAA2B;IAC3B,QAAQ,CAAC,KAAK,EAAE,cAAc,CAAC;CAC/B;AAED;;GAEG;AACH,MAAM,WAAW,eAAe,CAC/B,CAAC,SAAS,QAAQ,GAAG,QAAQ,EAC7B,CAAC,SAAS,QAAQ,GAAG,QAAQ;IAE7B,uDAAuD;IACvD,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAC3B,mDAAmD;IACnD,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;IAChC,gEAAgE;IAChE,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAC3B,+BAA+B;IAC/B,QAAQ,CAAC,QAAQ,CAAC,EAAE,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3C,0DAA0D;IAC1D,QAAQ,CAAC,aAAa,CAAC,EAAE,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrD,mDAAmD;IACnD,QAAQ,CAAC,gBAAgB,CAAC,EAAE,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACxD,sCAAsC;IACtC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IACvB,2BAA2B;IAC3B,QAAQ,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC;CACzB"}

package/dist/{expansion-DaTroIyv.cjs → expansion--UuRowv-.cjs}

@@ -1,7 +1,8 @@
 const require_priority_queue = require("./priority-queue-BIiD1L0k.cjs");
-const require_ops = require("./ops-djAsQQSh.cjs");
+const require_ops = require("./ops-paa1Nvlf.cjs");
+const require_logic = require("./logic-Dbyfb_-7.cjs");
 const require_utils = require("./utils/index.cjs");
-const require_jaccard = require("./jaccard-Bys9_dGW.cjs");
+const require_jaccard = require("./jaccard-Bdw4B0i4.cjs");
 //#region src/expansion/base-helpers.ts
 /**
 * Check whether expansion should continue given current progress.
@@ -130,7 +131,7 @@ function degreePriority(_nodeId, context) {
 */
 function* baseCore(graphMeta, seeds, config, graphRef) {
 	const startTime = performance.now();
-	const { maxNodes = 0, maxIterations = 0, maxPaths = 0, priority = degreePriority, debug = false } = config ?? {};
+	const { maxNodes = 0, maxIterations = 0, maxPaths = 0, priority = degreePriority, batchPriority, debug = false } = config ?? {};
 	if (seeds.length === 0) return emptyResult$2("base", startTime);
 	const numFrontiers = seeds.length;
 	const allVisited = /* @__PURE__ */ new Set();
@@ -225,8 +226,30 @@ function* baseCore(graphMeta, seeds, config, graphRef) {
 				sampledEdgeMap.set(s, targets);
 			}
 			targets.add(t);
+		}
+		const unvisitedNeighbours = [];
+		for (const neighbour of neighbours) {
 			const fv = visitedByFrontier[activeFrontier];
 			if (fv === void 0 || fv.has(neighbour)) continue;
+			unvisitedNeighbours.push(neighbour);
+		}
+		if (unvisitedNeighbours.length > 0) if (batchPriority) {
+			const priorities = batchPriority(unvisitedNeighbours, {
+				graph: graphRef ?? makeNoGraphSentinel(),
+				visited: allVisited,
+				visitedByFrontier: combinedVisited,
+				frontierId: activeFrontier,
+				discoveredPaths
+			});
+			for (const neighbour of unvisitedNeighbours) {
+				const priority = priorities.get(neighbour);
+				if (priority !== void 0) queue.push({
+					nodeId: neighbour,
+					frontierIndex: activeFrontier,
+					predecessor: nodeId
+				}, priority);
+			}
+		} else for (const neighbour of unvisitedNeighbours) {
 			const neighbourDegree = yield* require_ops.opDegree(neighbour);
 			const neighbourPriority = priority(neighbour, buildPriorityContext(neighbour, activeFrontier, combinedVisited, allVisited, discoveredPaths, iterations + 1, neighbourDegree, graphRef));
 			queue.push({
@@ -585,6 +608,73 @@ async function pipeAsync(graph, seeds, config) {
 //#endregion
 //#region src/expansion/priority-helpers.ts
 /**
+* Compute average MI between each candidate and a set of reference nodes.
+*
+* Uses batch intersection computation for efficiency. Returns a Map of
+* candidate ID to average MI score.
+*
+* @param graph - Source graph
+* @param candidates - Candidate node IDs to compute priorities for
+* @param referenceNodes - Reference nodes to compute MI against
+* @returns Map of candidate ID to average MI score
+*/
+function batchAvgMI(graph, candidates, referenceNodes) {
+	const result = /* @__PURE__ */ new Map();
+	if (candidates.length === 0 || referenceNodes.size === 0) {
+		for (const candidate of candidates) result.set(candidate, 0);
+		return result;
+	}
+	const { csr, indexMap } = require_logic.graphToCSR(graph);
+	const { nodeToIndex } = indexMap;
+	const pairs = [];
+	const pairToCandidate = /* @__PURE__ */ new Map();
+	const referenceArray = Array.from(referenceNodes);
+	for (const candidate of candidates) {
+		const candIdx = nodeToIndex.get(candidate);
+		if (candIdx === void 0) {
+			result.set(candidate, 0);
+			continue;
+		}
+		const startIdx = pairs.length;
+		for (const refNode of referenceArray) {
+			const refIdx = nodeToIndex.get(refNode);
+			if (refIdx !== void 0 && refIdx !== candIdx) pairs.push([candIdx, refIdx]);
+		}
+		const endIdx = pairs.length;
+		for (let i = startIdx; i < endIdx; i++) pairToCandidate.set(i, candidate);
+	}
+	if (pairs.length === 0) {
+		for (const candidate of candidates) if (!result.has(candidate)) result.set(candidate, 0);
+		return result;
+	}
+	const { intersections, sizeUs, sizeVs } = require_logic.intersectionBatch(csr.rowOffsets, csr.colIndices, pairs);
+	const candidateScores = /* @__PURE__ */ new Map();
+	for (let i = 0; i < pairs.length; i++) {
+		const candidate = pairToCandidate.get(i);
+		if (candidate === void 0) continue;
+		const mi = require_logic.jaccardFromIntersection({
+			intersection: intersections[i] ?? 0,
+			sizeU: sizeUs[i] ?? 0,
+			sizeV: sizeVs[i] ?? 0
+		});
+		const existing = candidateScores.get(candidate);
+		if (existing === void 0) candidateScores.set(candidate, {
+			total: mi,
+			count: 1
+		});
+		else {
+			existing.total += mi;
+			existing.count++;
+		}
+	}
+	for (const candidate of candidates) {
+		const scores = candidateScores.get(candidate);
+		if (scores === void 0 || scores.count === 0) result.set(candidate, 0);
+		else result.set(candidate, scores.total / scores.count);
+	}
+	return result;
+}
+/**
 * Compute the average mutual information between a node and all visited
 * nodes in the same frontier.
 *
@@ -608,6 +698,17 @@ function avgFrontierMI(graph, nodeId, context, mi) {
 	return count > 0 ? total / count : 0;
 }
 /**
+* Get nodes visited by the same frontier (for batch MI computation).
+*
+* @param context - Batch priority context
+* @returns Set of node IDs visited by the same frontier
+*/
+function getSameFrontierVisited(context) {
+	const result = /* @__PURE__ */ new Set();
+	for (const [nodeId, frontierIdx] of context.visitedByFrontier) if (frontierIdx === context.frontierId) result.add(nodeId);
+	return result;
+}
+/**
 * Count the number of a node's neighbours that have been visited by
 * frontiers other than the node's own frontier.
 *
@@ -983,6 +1084,39 @@ async function laceAsync(graph, seeds, config) {
 		priority
 	});
 }
+/**
+* Batch priority function for LACE expansion.
+*
+* Computes average MI between each candidate and all nodes visited by the
+* same frontier in a single batch operation. More efficient than computing
+* MI per-candidate when there are many candidates and visited nodes.
+*
+* @param candidates - Candidate node IDs to prioritise
+* @param context - Batch priority context
+* @returns Map of node ID to priority (lower = higher priority)
+*/
+function laceBatchPriority(candidates, context) {
+	const sameFrontierVisited = getSameFrontierVisited(context);
+	const avgMIScores = batchAvgMI(context.graph, candidates, sameFrontierVisited);
+	const priorities = /* @__PURE__ */ new Map();
+	for (const candidate of candidates) {
+		const avgMI = avgMIScores.get(candidate) ?? 0;
+		priorities.set(candidate, 1 - avgMI);
+	}
+	return priorities;
+}
+/**
+* Create a LACE config with batch priority enabled.
+*
+* @param config - Base LACE configuration
+* @returns Configuration with batchPriority set
+*/
+function laceWithBatchPriority(config) {
+	return {
+		...config,
+		batchPriority: laceBatchPriority
+	};
+}
 //#endregion
 //#region src/expansion/warp.ts
 /**
@@ -1087,6 +1221,46 @@ async function fuseAsync(graph, seeds, config) {
 		priority
 	});
 }
+/**
+* Create a batch priority function for FUSE with configurable weight.
+*
+* Combines degree with average frontier MI:
+* Priority = (1 - w) * degree + w * (1 - avgMI)
+*
+* @param salienceWeight - Weight for MI component (0-1, default: 0.5)
+* @returns Batch priority function
+*/
+function createFuseBatchPriority(salienceWeight = .5) {
+	return (candidates, context) => {
+		const sameFrontierVisited = getSameFrontierVisited(context);
+		const avgMIScores = batchAvgMI(context.graph, candidates, sameFrontierVisited);
+		const priorities = /* @__PURE__ */ new Map();
+		for (const candidate of candidates) {
+			const avgMI = avgMIScores.get(candidate) ?? 0;
+			const degree = context.graph.degree(candidate);
+			const degreeComponent = (1 - salienceWeight) * degree;
+			const salienceComponent = salienceWeight * (1 - avgMI);
+			priorities.set(candidate, degreeComponent + salienceComponent);
+		}
+		return priorities;
+	};
+}
+/**
+* Default FUSE batch priority function with salienceWeight = 0.5.
+*/
+var fuseBatchPriority = createFuseBatchPriority(.5);
+/**
+* Create a FUSE config with batch priority enabled.
+*
+* @param config - Base FUSE configuration
+* @returns Configuration with batchPriority set
+*/
+function fuseWithBatchPriority(config) {
+	return {
+		...config,
+		batchPriority: createFuseBatchPriority(config?.salienceWeight ?? .5)
+	};
+}
 //#endregion
 //#region src/expansion/sift.ts
 /**
@@ -1140,6 +1314,47 @@ async function siftAsync(graph, seeds, config) {
 		priority
 	});
 }
+/**
+* Create a batch priority function for SIFT with configurable threshold.
+*
+* Nodes with average MI above the threshold get high priority (low value).
+* Nodes below the threshold are deferred with degree-based penalty.
+*
+* @param miThreshold - MI threshold for phase transition (default: 0.25)
+* @returns Batch priority function
+*/
+function createSiftBatchPriority(miThreshold = .25) {
+	return (candidates, context) => {
+		const sameFrontierVisited = getSameFrontierVisited(context);
+		const avgMIScores = batchAvgMI(context.graph, candidates, sameFrontierVisited);
+		const priorities = /* @__PURE__ */ new Map();
+		for (const candidate of candidates) {
+			const avgMI = avgMIScores.get(candidate) ?? 0;
+			if (avgMI >= miThreshold) priorities.set(candidate, 1 - avgMI);
+			else {
+				const degree = context.graph.degree(candidate);
+				priorities.set(candidate, degree + 100);
+			}
+		}
+		return priorities;
+	};
+}
+/**
+* Default SIFT batch priority function with miThreshold = 0.25.
+*/
+var siftBatchPriority = createSiftBatchPriority(.25);
+/**
+* Create a SIFT config with batch priority enabled.
+*
+* @param config - Base SIFT configuration
+* @returns Configuration with batchPriority set
+*/
+function siftWithBatchPriority(config) {
+	return {
+		...config,
+		batchPriority: createSiftBatchPriority(config?.miThreshold ?? .25)
+	};
+}
 //#endregion
 //#region src/expansion/flux.ts
 /**
@@ -1711,6 +1926,18 @@ Object.defineProperty(exports, "baseAsync", {
 		return baseAsync;
 	}
 });
+Object.defineProperty(exports, "createFuseBatchPriority", {
+	enumerable: true,
+	get: function() {
+		return createFuseBatchPriority;
+	}
+});
+Object.defineProperty(exports, "createSiftBatchPriority", {
+	enumerable: true,
+	get: function() {
+		return createSiftBatchPriority;
+	}
+});
 Object.defineProperty(exports, "dfsPriority", {
 	enumerable: true,
 	get: function() {
@@ -1801,6 +2028,18 @@ Object.defineProperty(exports, "fuseAsync", {
 		return fuseAsync;
 	}
 });
+Object.defineProperty(exports, "fuseBatchPriority", {
+	enumerable: true,
+	get: function() {
+		return fuseBatchPriority;
+	}
+});
+Object.defineProperty(exports, "fuseWithBatchPriority", {
+	enumerable: true,
+	get: function() {
+		return fuseWithBatchPriority;
+	}
+});
 Object.defineProperty(exports, "hae", {
 	enumerable: true,
 	get: function() {
@@ -1831,6 +2070,18 @@ Object.defineProperty(exports, "laceAsync", {
 		return laceAsync;
 	}
 });
+Object.defineProperty(exports, "laceBatchPriority", {
+	enumerable: true,
+	get: function() {
+		return laceBatchPriority;
+	}
+});
+Object.defineProperty(exports, "laceWithBatchPriority", {
+	enumerable: true,
+	get: function() {
+		return laceWithBatchPriority;
+	}
+});
 Object.defineProperty(exports, "maze", {
 	enumerable: true,
 	get: function() {
@@ -1909,6 +2160,18 @@ Object.defineProperty(exports, "siftAsync", {
 		return siftAsync;
 	}
 });
+Object.defineProperty(exports, "siftBatchPriority", {
+	enumerable: true,
+	get: function() {
+		return siftBatchPriority;
+	}
+});
+Object.defineProperty(exports, "siftWithBatchPriority", {
+	enumerable: true,
+	get: function() {
+		return siftWithBatchPriority;
+	}
+});
 Object.defineProperty(exports, "standardBfs", {
 	enumerable: true,
 	get: function() {
@@ -1946,4 +2209,4 @@ Object.defineProperty(exports, "warpAsync", {
 	}
 });
 
-//# sourceMappingURL=expansion-DaTroIyv.cjs.map
+//# sourceMappingURL=expansion--UuRowv-.cjs.map