graphwise 1.11.0 → 1.12.1

package/dist/{expansion-CZLNK6Pr.js → exploration-DKjRNxS5.js}

@@ -3,9 +3,9 @@ import { f as runAsync, p as runSync, r as opDegree, s as opNeighbours } from ".
 import { c as graphToCSR, i as jaccardFromIntersection, r as intersectionBatch } from "./logic-DyBzRg1A.js";
 import { localTypeEntropy } from "./utils/index.js";
 import { t as jaccard } from "./jaccard-BwC_NuQu.js";
-//#region src/expansion/base-helpers.ts
+//#region src/exploration/base-helpers.ts
 /**
-* Check whether expansion should continue given current progress.
+* Check whether exploration should continue given current progress.
 *
 * Returns shouldContinue=false as soon as any configured limit is reached,
 * along with the appropriate termination reason.
@@ -13,7 +13,7 @@ import { t as jaccard } from "./jaccard-BwC_NuQu.js";
 * @param iterations - Number of iterations completed so far
 * @param nodesVisited - Number of distinct nodes visited so far
 * @param pathsFound - Number of paths discovered so far
-* @param limits - Configured expansion limits (0 = unlimited)
+* @param limits - Configured exploration limits (0 = unlimited)
 * @returns Whether to continue and the termination reason if stopping
 */
 function continueExpansion(iterations, nodesVisited, pathsFound, limits) {
@@ -81,11 +81,11 @@ function reconstructPath$1(collisionNode, frontierA, frontierB, predecessors, se
 	};
 }
 /**
-* Create an empty expansion result for early termination (e.g. no seeds given).
+* Create an empty exploration result for early termination (e.g. no seeds given).
 *
 * @param algorithm - Name of the algorithm producing this result
 * @param startTime - performance.now() timestamp taken before the algorithm began
-* @returns An ExpansionResult with zero paths and zero stats
+* @returns An ExplorationResult with zero paths and zero stats
 */
 function emptyResult$2(algorithm, startTime) {
 	return {
@@ -105,7 +105,7 @@ function emptyResult$2(algorithm, startTime) {
 	};
 }
 //#endregion
-//#region src/expansion/base-core.ts
+//#region src/exploration/base-core.ts
 /**
 * Default priority function — degree-ordered (DOME).
 *
@@ -115,7 +115,7 @@ function degreePriority(_nodeId, context) {
 	return context.degree;
 }
 /**
-* Generator core of the BASE expansion algorithm.
+* Generator core of the BASE exploration algorithm.
 *
 * Yields GraphOp objects to request graph data, allowing the caller to
 * provide a sync or async runner. The optional `graphRef` parameter is
@@ -124,10 +124,10 @@ function degreePriority(_nodeId, context) {
 * graph may be supplied instead.
 *
 * @param graphMeta - Immutable graph metadata (directed, nodeCount, edgeCount)
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion configuration (priority, limits, debug)
 * @param graphRef - Optional real graph reference for context.graph in priority functions
-* @returns An ExpansionResult with all discovered paths and statistics
+* @returns An ExplorationResult with all discovered paths and statistics
 */
 function* baseCore(graphMeta, seeds, config, graphRef) {
 	const startTime = performance.now();
@@ -333,15 +333,15 @@ function buildPriorityContext(_nodeId, frontierIndex, combinedVisited, allVisite
 	};
 }
 //#endregion
-//#region src/expansion/base.ts
+//#region src/exploration/base.ts
 /**
-* Run BASE expansion synchronously.
+* Run BASE exploration synchronously.
 *
 * Delegates to baseCore + runSync. Behaviour is identical to the previous
 * direct implementation — all existing callers are unaffected.
 *
 * @param graph - Source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion configuration
 * @returns Expansion result with discovered paths
 */
@@ -353,7 +353,7 @@ function base(graph, seeds, config) {
 	}, seeds, config, graph), graph);
 }
 /**
-* Run BASE expansion asynchronously.
+* Run BASE exploration asynchronously.
 *
 * Delegates to baseCore + runAsync. Supports:
 * - Cancellation via AbortSignal (config.signal)
@@ -365,9 +365,9 @@ function base(graph, seeds, config) {
 * priority (DOME) does not access context.graph and works correctly.
 *
 * @param graph - Async source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion and async runner configuration
-* @returns Promise resolving to the expansion result
+* @returns Promise resolving to the exploration result
 */
 async function baseAsync(graph, seeds, config) {
 	const [nodeCount, edgeCount] = await Promise.all([graph.nodeCount, graph.edgeCount]);
@@ -383,7 +383,7 @@ async function baseAsync(graph, seeds, config) {
 	return runAsync(gen, graph, runnerOptions);
 }
 //#endregion
-//#region src/expansion/dome.ts
+//#region src/exploration/dome.ts
 /**
 * DOME priority: lower degree is expanded first.
 */
@@ -397,10 +397,10 @@ function domeHighDegreePriority(_nodeId, context) {
 	return -context.degree;
 }
 /**
-* Run DOME expansion (degree-ordered).
+* Run DOME exploration (degree-ordered).
 *
 * @param graph - Source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion configuration
 * @returns Expansion result with discovered paths
 */
@@ -411,12 +411,12 @@ function dome(graph, seeds, config) {
 	});
 }
 /**
-* Run DOME expansion asynchronously (degree-ordered).
+* Run DOME exploration asynchronously (degree-ordered).
 *
 * @param graph - Async source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion and async runner configuration
-* @returns Promise resolving to the expansion result
+* @returns Promise resolving to the exploration result
 */
 async function domeAsync(graph, seeds, config) {
 	return baseAsync(graph, seeds, {
@@ -434,12 +434,12 @@ function domeHighDegree(graph, seeds, config) {
 	});
 }
 /**
-* Run DOME high-degree expansion asynchronously (high degree first).
+* Run DOME high-degree exploration asynchronously (high degree first).
 *
 * @param graph - Async source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion and async runner configuration
-* @returns Promise resolving to the expansion result
+* @returns Promise resolving to the exploration result
 */
 async function domeHighDegreeAsync(graph, seeds, config) {
 	return baseAsync(graph, seeds, {
@@ -448,7 +448,7 @@ async function domeHighDegreeAsync(graph, seeds, config) {
 	});
 }
 //#endregion
-//#region src/expansion/hae.ts
+//#region src/exploration/hae.ts
 var EPSILON = 1e-10;
 /**
 * Default type mapper - uses node.type property.
@@ -472,13 +472,13 @@ function createHAEPriority(typeMapper) {
 	};
 }
 /**
-* Run HAE expansion (Heterogeneity-Aware Expansion).
+* Run HAE exploration (Heterogeneity-Aware Exploration).
 *
 * Discovers paths by prioritising nodes with diverse neighbour types,
 * using a custom type mapper for flexible type extraction.
 *
 * @param graph - Source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - HAE configuration with optional typeMapper
 * @returns Expansion result with discovered paths
 */
@@ -490,7 +490,7 @@ function hae(graph, seeds, config) {
 	});
 }
 /**
-* Run HAE expansion asynchronously.
+* Run HAE exploration asynchronously.
 *
 * Note: the HAE priority function accesses `context.graph` to retrieve
 * neighbour types. Full async equivalence requires PriorityContext
@@ -498,9 +498,9 @@ function hae(graph, seeds, config) {
 * surface; use with a `wrapAsync`-wrapped sync graph for testing.
 *
 * @param graph - Async source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - HAE configuration combined with async runner options
-* @returns Promise resolving to the expansion result
+* @returns Promise resolving to the exploration result
 */
 async function haeAsync(graph, seeds, config) {
 	const typeMapper = config?.typeMapper ?? defaultTypeMapper$1;
@@ -510,17 +510,17 @@ async function haeAsync(graph, seeds, config) {
 	});
 }
 //#endregion
-//#region src/expansion/edge.ts
+//#region src/exploration/edge.ts
 /** Default type mapper: reads `node.type`, falling back to "default". */
 var defaultTypeMapper = (n) => typeof n.type === "string" ? n.type : "default";
 /**
-* Run EDGE expansion (Entropy-Driven Graph Expansion).
+* Run EDGE exploration (Entropy-Driven Graph Exploration).
 *
 * Discovers paths by prioritising nodes with diverse neighbour types,
 * deferring nodes with homogeneous neighbourhoods.
 *
 * @param graph - Source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion configuration
 * @returns Expansion result with discovered paths
 */
@@ -531,7 +531,7 @@ function edge(graph, seeds, config) {
 	});
 }
 /**
-* Run EDGE expansion asynchronously.
+* Run EDGE exploration asynchronously.
 *
 * Delegates to `haeAsync` with the default `node.type` mapper.
 *
@@ -541,9 +541,9 @@ function edge(graph, seeds, config) {
 * surface; use with a `wrapAsync`-wrapped sync graph for testing.
 *
 * @param graph - Async source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion and async runner configuration
-* @returns Promise resolving to the expansion result
+* @returns Promise resolving to the exploration result
 */
 async function edgeAsync(graph, seeds, config) {
 	return haeAsync(graph, seeds, {
@@ -552,7 +552,7 @@ async function edgeAsync(graph, seeds, config) {
 	});
 }
 //#endregion
-//#region src/expansion/pipe.ts
+//#region src/exploration/pipe.ts
 /**
 * Priority function using path potential.
 * Lower values = higher priority (expanded first).
@@ -570,13 +570,13 @@ function pipePriority(nodeId, context) {
 	return context.degree / (1 + pathPotential);
 }
 /**
-* Run PIPE expansion (Path-Potential Informed Priority Expansion).
+* Run PIPE exploration (Path-potential Informed Priority Exploration).
 *
 * Discovers paths by prioritising nodes that bridge multiple frontiers,
 * identifying connecting points between seed regions.
 *
 * @param graph - Source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion configuration
 * @returns Expansion result with discovered paths
 */
@@ -587,7 +587,7 @@ function pipe(graph, seeds, config) {
 	});
 }
 /**
-* Run PIPE expansion asynchronously.
+* Run PIPE exploration asynchronously.
 *
 * Note: the PIPE priority function accesses `context.graph` to retrieve
 * neighbour lists. Full async equivalence requires PriorityContext
@@ -595,9 +595,9 @@ function pipe(graph, seeds, config) {
 * surface; use with a `wrapAsync`-wrapped sync graph for testing.
 *
 * @param graph - Async source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion and async runner configuration
-* @returns Promise resolving to the expansion result
+* @returns Promise resolving to the exploration result
 */
 async function pipeAsync(graph, seeds, config) {
 	return baseAsync(graph, seeds, {
@@ -606,7 +606,7 @@ async function pipeAsync(graph, seeds, config) {
 	});
 }
 //#endregion
-//#region src/expansion/priority-helpers.ts
+//#region src/exploration/priority-helpers.ts
 /**
 * Compute average MI between each candidate and a set of reference nodes.
 *
@@ -747,16 +747,16 @@ function updateSalienceCounts(salienceCounts, paths, fromIndex) {
 	return paths.length;
 }
 //#endregion
-//#region src/expansion/sage.ts
+//#region src/exploration/sage.ts
 /**
-* Run SAGE expansion algorithm.
+* Run SAGE exploration algorithm.
 *
-* Salience-aware multi-frontier expansion with two phases:
+* Salience-aware multi-frontier exploration with two phases:
 * - Phase 1: Degree-based priority (early exploration)
 * - Phase 2: Salience feedback (path-aware frontier steering)
 *
 * @param graph - Source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion configuration
 * @returns Expansion result with discovered paths
 */
@@ -780,16 +780,16 @@ function sage(graph, seeds, config) {
 	});
 }
 /**
-* Run SAGE expansion asynchronously.
+* Run SAGE exploration asynchronously.
 *
 * Creates fresh closure state (salienceCounts, phase tracking) for this
 * invocation. The SAGE priority function does not access `context.graph`
 * directly, so it is safe to use in async mode via `baseAsync`.
 *
 * @param graph - Async source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion and async runner configuration
-* @returns Promise resolving to the expansion result
+* @returns Promise resolving to the exploration result
 */
 async function sageAsync(graph, seeds, config) {
 	const salienceCounts = /* @__PURE__ */ new Map();
@@ -808,16 +808,16 @@ async function sageAsync(graph, seeds, config) {
 	});
 }
 //#endregion
-//#region src/expansion/reach.ts
+//#region src/exploration/reach.ts
 /**
-* Run REACH expansion algorithm.
+* Run REACH exploration algorithm.
 *
-* Mutual information-aware multi-frontier expansion with two phases:
+* Mutual information-aware multi-frontier exploration with two phases:
 * - Phase 1: Degree-based priority (early exploration)
 * - Phase 2: Structural similarity feedback (MI-guided frontier steering)
 *
 * @param graph - Source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion configuration
 * @returns Expansion result with discovered paths
 */
@@ -864,7 +864,7 @@ function reach(graph, seeds, config) {
 	});
 }
 /**
-* Run REACH expansion asynchronously.
+* Run REACH exploration asynchronously.
 *
 * Creates fresh closure state (phase tracking, Jaccard cache) for this
 * invocation. The REACH priority function uses `jaccard(context.graph, ...)`
@@ -873,9 +873,9 @@ function reach(graph, seeds, config) {
 * deferred). This export establishes the async API surface.
 *
 * @param graph - Async source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion and async runner configuration
-* @returns Promise resolving to the expansion result
+* @returns Promise resolving to the exploration result
 */
 async function reachAsync(graph, seeds, config) {
 	let inPhase2 = false;
@@ -898,19 +898,19 @@ async function reachAsync(graph, seeds, config) {
 	});
 }
 //#endregion
-//#region src/expansion/maze.ts
+//#region src/exploration/maze.ts
 /** Default threshold for switching to phase 2 (after M paths) */
 var DEFAULT_PHASE2_THRESHOLD = 1;
 /** Salience weighting factor */
 var SALIENCE_WEIGHT = 1e3;
 /**
-* Run MAZE expansion algorithm.
+* Run MAZE exploration algorithm.
 *
-* Multi-phase expansion combining path potential and salience with
+* Multi-phase exploration combining path potential and salience with
 * adaptive frontier steering.
 *
 * @param graph - Source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion configuration
 * @returns Expansion result with discovered paths
 */
@@ -944,7 +944,7 @@ function maze(graph, seeds, config) {
 	});
 }
 /**
-* Run MAZE expansion asynchronously.
+* Run MAZE exploration asynchronously.
 *
 * Creates fresh closure state (salienceCounts, phase tracking) for this
 * invocation. The MAZE priority function accesses `context.graph` to
@@ -953,9 +953,9 @@ function maze(graph, seeds, config) {
 * This export establishes the async API surface.
 *
 * @param graph - Async source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion and async runner configuration
-* @returns Promise resolving to the expansion result
+* @returns Promise resolving to the exploration result
 */
 async function mazeAsync(graph, seeds, config) {
 	const salienceCounts = /* @__PURE__ */ new Map();
@@ -984,7 +984,7 @@ async function mazeAsync(graph, seeds, config) {
 	});
 }
 //#endregion
-//#region src/expansion/tide.ts
+//#region src/exploration/tide.ts
 /**
 * TIDE priority function.
 *
@@ -998,13 +998,13 @@ function tidePriority(nodeId, context) {
 	return totalDegree;
 }
 /**
-* Run TIDE expansion algorithm.
+* Run TIDE exploration algorithm.
 *
 * Expands from seeds prioritising low-degree edges first.
 * Useful for avoiding hubs and exploring sparse regions.
 *
 * @param graph - Source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion configuration
 * @returns Expansion result with discovered paths
 */
@@ -1015,7 +1015,7 @@ function tide(graph, seeds, config) {
 	});
 }
 /**
-* Run TIDE expansion asynchronously.
+* Run TIDE exploration asynchronously.
 *
 * Note: the TIDE priority function accesses `context.graph` to retrieve
 * neighbour lists and per-neighbour degrees. Full async equivalence
@@ -1023,9 +1023,9 @@ function tide(graph, seeds, config) {
 * establishes the async API surface.
 *
 * @param graph - Async source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion and async runner configuration
-* @returns Promise resolving to the expansion result
+* @returns Promise resolving to the exploration result
 */
 async function tideAsync(graph, seeds, config) {
 	return baseAsync(graph, seeds, {
@@ -1034,7 +1034,7 @@ async function tideAsync(graph, seeds, config) {
 	});
 }
 //#endregion
-//#region src/expansion/lace.ts
+//#region src/exploration/lace.ts
 /**
 * LACE priority function.
 *
@@ -1045,13 +1045,13 @@ function lacePriority(nodeId, context, mi) {
 	return 1 - avgFrontierMI(context.graph, nodeId, context, mi);
 }
 /**
-* Run LACE expansion algorithm.
+* Run LACE exploration algorithm.
 *
 * Expands from seeds prioritising high-MI edges.
 * Useful for finding paths with strong semantic associations.
 *
 * @param graph - Source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion configuration with MI function
 * @returns Expansion result with discovered paths
 */
@@ -1064,7 +1064,7 @@ function lace(graph, seeds, config) {
 	});
 }
 /**
-* Run LACE expansion asynchronously.
+* Run LACE exploration asynchronously.
 *
 * Note: the LACE priority function accesses `context.graph` via
 * `avgFrontierMI`. Full async equivalence requires PriorityContext
@@ -1072,9 +1072,9 @@ function lace(graph, seeds, config) {
 * API surface.
 *
 * @param graph - Async source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - LACE configuration combined with async runner options
-* @returns Promise resolving to the expansion result
+* @returns Promise resolving to the exploration result
 */
 async function laceAsync(graph, seeds, config) {
 	const { mi = jaccard, ...restConfig } = config ?? {};
@@ -1085,7 +1085,7 @@ async function laceAsync(graph, seeds, config) {
 	});
 }
 /**
-* Batch priority function for LACE expansion.
+* Batch priority function for LACE exploration.
 *
 * Computes average MI between each candidate and all nodes visited by the
 * same frontier in a single batch operation. More efficient than computing
@@ -1118,7 +1118,7 @@ function laceWithBatchPriority(config) {
 	};
 }
 //#endregion
-//#region src/expansion/warp.ts
+//#region src/exploration/warp.ts
 /**
 * WARP priority function.
 *
@@ -1133,13 +1133,13 @@ function warpPriority(nodeId, context) {
 	return 1 / (1 + bridgeScore);
 }
 /**
-* Run WARP expansion algorithm.
+* Run WARP exploration algorithm.
 *
 * Expands from seeds prioritising bridge nodes.
 * Useful for finding paths through structurally important nodes.
 *
 * @param graph - Source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion configuration
 * @returns Expansion result with discovered paths
 */
@@ -1150,7 +1150,7 @@ function warp(graph, seeds, config) {
 	});
 }
 /**
-* Run WARP expansion asynchronously.
+* Run WARP exploration asynchronously.
 *
 * Note: the WARP priority function accesses `context.graph` via
 * `countCrossFrontierNeighbours`. Full async equivalence requires
@@ -1158,9 +1158,9 @@ function warp(graph, seeds, config) {
 * establishes the async API surface.
 *
 * @param graph - Async source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion and async runner configuration
-* @returns Promise resolving to the expansion result
+* @returns Promise resolving to the exploration result
 */
 async function warpAsync(graph, seeds, config) {
 	return baseAsync(graph, seeds, {
@@ -1169,7 +1169,7 @@ async function warpAsync(graph, seeds, config) {
 	});
 }
 //#endregion
-//#region src/expansion/fuse.ts
+//#region src/exploration/fuse.ts
 /**
 * FUSE priority function.
 *
@@ -1182,13 +1182,13 @@ function fusePriority(nodeId, context, mi, salienceWeight) {
 	return (1 - salienceWeight) * context.degree + salienceWeight * (1 - avgSalience);
 }
 /**
-* Run FUSE expansion algorithm.
+* Run FUSE exploration algorithm.
 *
 * Combines structural exploration with semantic salience.
 * Useful for finding paths that are both short and semantically meaningful.
 *
 * @param graph - Source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion configuration with MI function
 * @returns Expansion result with discovered paths
 */
@@ -1201,7 +1201,7 @@ function fuse(graph, seeds, config) {
 	});
 }
 /**
-* Run FUSE expansion asynchronously.
+* Run FUSE exploration asynchronously.
 *
 * Note: the FUSE priority function accesses `context.graph` via
 * `avgFrontierMI`. Full async equivalence requires PriorityContext
@@ -1209,9 +1209,9 @@ function fuse(graph, seeds, config) {
 * API surface.
 *
 * @param graph - Async source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - FUSE configuration combined with async runner options
-* @returns Promise resolving to the expansion result
+* @returns Promise resolving to the exploration result
 */
 async function fuseAsync(graph, seeds, config) {
 	const { mi = jaccard, salienceWeight = .5, ...restConfig } = config ?? {};
@@ -1262,7 +1262,7 @@ function fuseWithBatchPriority(config) {
 	};
 }
 //#endregion
-//#region src/expansion/sift.ts
+//#region src/exploration/sift.ts
 /**
 * REACH (SIFT) priority function.
 *
@@ -1275,13 +1275,13 @@ function siftPriority(nodeId, context, mi, miThreshold) {
 	else return context.degree + 100;
 }
 /**
-* Run SIFT expansion algorithm.
+* Run SIFT exploration algorithm.
 *
-* Two-phase adaptive expansion that learns MI thresholds
-* from initial sampling, then uses them for guided expansion.
+* Two-phase adaptive exploration that learns MI thresholds
+* from initial sampling, then uses them for guided exploration.
 *
 * @param graph - Source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion configuration
 * @returns Expansion result with discovered paths
 */
@@ -1294,7 +1294,7 @@ function sift(graph, seeds, config) {
 	});
 }
 /**
-* Run SIFT expansion asynchronously.
+* Run SIFT exploration asynchronously.
 *
 * Note: the SIFT priority function accesses `context.graph` via
 * `avgFrontierMI`. Full async equivalence requires PriorityContext
@@ -1302,9 +1302,9 @@ function sift(graph, seeds, config) {
 * API surface.
 *
 * @param graph - Async source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - SIFT (REACHConfig) configuration combined with async runner options
-* @returns Promise resolving to the expansion result
+* @returns Promise resolving to the exploration result
 */
 async function siftAsync(graph, seeds, config) {
 	const { mi = jaccard, miThreshold = .25, ...restConfig } = config ?? {};
@@ -1356,7 +1356,7 @@ function siftWithBatchPriority(config) {
 	};
 }
 //#endregion
-//#region src/expansion/flux.ts
+//#region src/exploration/flux.ts
 /**
 * Compute local density around a node.
 */
@@ -1392,14 +1392,14 @@ function fluxPriority(nodeId, context, densityThreshold, bridgeThreshold) {
 	else return degree;
 }
 /**
-* Run FLUX expansion algorithm.
+* Run FLUX exploration algorithm.
 *
-* Adaptively switches between expansion strategies based on
+* Adaptively switches between exploration strategies based on
 * local graph structure. Useful for heterogeneous graphs
 * with varying density.
 *
 * @param graph - Source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion configuration
 * @returns Expansion result with discovered paths
 */
@@ -1412,7 +1412,7 @@ function flux(graph, seeds, config) {
 	});
 }
 /**
-* Run FLUX expansion asynchronously.
+* Run FLUX exploration asynchronously.
 *
 * Note: the FLUX priority function accesses `context.graph` to compute
 * local density and cross-frontier bridge scores. Full async equivalence
@@ -1420,9 +1420,9 @@ function flux(graph, seeds, config) {
 * establishes the async API surface.
 *
 * @param graph - Async source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - FLUX (MAZEConfig) configuration combined with async runner options
-* @returns Promise resolving to the expansion result
+* @returns Promise resolving to the exploration result
 */
 async function fluxAsync(graph, seeds, config) {
 	const { densityThreshold = .5, bridgeThreshold = .3, ...restConfig } = config ?? {};
@@ -1433,7 +1433,7 @@ async function fluxAsync(graph, seeds, config) {
 	});
 }
 //#endregion
-//#region src/expansion/standard-bfs.ts
+//#region src/exploration/standard-bfs.ts
 /**
 * BFS priority: discovery iteration order (FIFO).
 */
@@ -1441,10 +1441,10 @@ function bfsPriority(_nodeId, context) {
 	return context.iteration;
 }
 /**
-* Run standard BFS expansion (FIFO discovery order).
+* Run standard BFS exploration (FIFO discovery order).
 *
 * @param graph - Source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion configuration
 * @returns Expansion result with discovered paths
 */
@@ -1455,12 +1455,12 @@ function standardBfs(graph, seeds, config) {
 	});
 }
 /**
-* Run standard BFS expansion asynchronously (FIFO discovery order).
+* Run standard BFS exploration asynchronously (FIFO discovery order).
 *
 * @param graph - Async source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion and async runner configuration
-* @returns Promise resolving to the expansion result
+* @returns Promise resolving to the exploration result
 */
 async function standardBfsAsync(graph, seeds, config) {
 	return baseAsync(graph, seeds, {
@@ -1469,7 +1469,7 @@ async function standardBfsAsync(graph, seeds, config) {
 	});
 }
 //#endregion
-//#region src/expansion/frontier-balanced.ts
+//#region src/exploration/frontier-balanced.ts
 /**
 * Frontier-balanced priority: frontier index dominates, then discovery iteration.
 * Scales frontier index by 1e9 to ensure round-robin ordering across frontiers.
@@ -1478,10 +1478,10 @@ function balancedPriority(_nodeId, context) {
 	return context.frontierIndex * 1e9 + context.iteration;
 }
 /**
-* Run frontier-balanced expansion (round-robin across frontiers).
+* Run frontier-balanced exploration (round-robin across frontiers).
 *
 * @param graph - Source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion configuration
 * @returns Expansion result with discovered paths
 */
@@ -1492,12 +1492,12 @@ function frontierBalanced(graph, seeds, config) {
 	});
 }
 /**
-* Run frontier-balanced expansion asynchronously (round-robin across frontiers).
+* Run frontier-balanced exploration asynchronously (round-robin across frontiers).
 *
 * @param graph - Async source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion and async runner configuration
-* @returns Promise resolving to the expansion result
+* @returns Promise resolving to the exploration result
 */
 async function frontierBalancedAsync(graph, seeds, config) {
 	return baseAsync(graph, seeds, {
@@ -1506,7 +1506,7 @@ async function frontierBalancedAsync(graph, seeds, config) {
 	});
 }
 //#endregion
-//#region src/expansion/random-priority.ts
+//#region src/exploration/random-priority.ts
 /**
 * Deterministic seeded random number generator.
 * Uses FNV-1a-like hash for input → [0, 1] output.
@@ -1530,10 +1530,10 @@ function makeRandomPriorityFn(seed) {
 	return (nodeId) => seededRandom(nodeId, seed);
 }
 /**
-* Run random-priority expansion (null hypothesis baseline).
+* Run random-priority exploration (null hypothesis baseline).
 *
 * @param graph - Source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion configuration
 * @returns Expansion result with discovered paths
 */
@@ -1545,12 +1545,12 @@ function randomPriority(graph, seeds, config) {
 	});
 }
 /**
-* Run random-priority expansion asynchronously (null hypothesis baseline).
+* Run random-priority exploration asynchronously (null hypothesis baseline).
 *
 * @param graph - Async source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion and async runner configuration
-* @returns Promise resolving to the expansion result
+* @returns Promise resolving to the exploration result
 */
 async function randomPriorityAsync(graph, seeds, config) {
 	const { seed = 0 } = config ?? {};
@@ -1560,7 +1560,7 @@ async function randomPriorityAsync(graph, seeds, config) {
 	});
 }
 //#endregion
-//#region src/expansion/dfs-priority.ts
+//#region src/exploration/dfs-priority.ts
 /**
 * DFS priority function: negative iteration produces LIFO ordering.
 *
@@ -1571,14 +1571,14 @@ function dfsPriorityFn(_nodeId, context) {
 	return -context.iteration;
 }
 /**
-* Run DFS-priority expansion (LIFO discovery order).
+* Run DFS-priority exploration (LIFO discovery order).
 *
 * Uses the BASE framework with a negative-iteration priority function,
 * which causes the most recently discovered node to be expanded first —
 * equivalent to depth-first search behaviour.
 *
 * @param graph - Source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion configuration
 * @returns Expansion result with discovered paths
 */
@@ -1589,12 +1589,12 @@ function dfsPriority(graph, seeds, config) {
 	});
 }
 /**
-* Run DFS-priority expansion asynchronously (LIFO discovery order).
+* Run DFS-priority exploration asynchronously (LIFO discovery order).
 *
 * @param graph - Async source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Expansion and async runner configuration
-* @returns Promise resolving to the expansion result
+* @returns Promise resolving to the exploration result
 */
 async function dfsPriorityAsync(graph, seeds, config) {
 	return baseAsync(graph, seeds, {
@@ -1603,16 +1603,16 @@ async function dfsPriorityAsync(graph, seeds, config) {
 	});
 }
 //#endregion
-//#region src/expansion/k-hop.ts
+//#region src/exploration/k-hop.ts
 /**
-* Run k-hop expansion (fixed-depth BFS).
+* Run k-hop exploration (fixed-depth BFS).
 *
 * Explores all nodes reachable within exactly k hops of any seed using
 * breadth-first search. Paths between seeds are detected when a node
 * is reached by frontiers from two different seeds.
 *
 * @param graph - Source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - K-hop configuration (k defaults to 2)
 * @returns Expansion result with discovered paths
 */
@@ -1766,7 +1766,7 @@ function emptyResult$1(startTime) {
 	};
 }
 //#endregion
-//#region src/expansion/random-walk.ts
+//#region src/exploration/random-walk.ts
 /**
 * Mulberry32 seeded PRNG — fast, compact, and high-quality for simulation.
 *
@@ -1786,7 +1786,7 @@ function mulberry32(seed) {
 	};
 }
 /**
-* Run random-walk-with-restart expansion.
+* Run random-walk-with-restart exploration.
 *
 * For each seed, performs `walks` independent random walks of up to
 * `walkLength` steps. At each step the walk either restarts (with
@@ -1796,10 +1796,10 @@ function mulberry32(seed) {
 * Inter-seed paths are detected when a walk reaches a node that was
 * previously reached by a walk originating from a different seed.
 * The recorded path contains only the two seed endpoints rather than
-* the full walk trajectory, consistent with the ExpansionPath contract.
+* the full walk trajectory, consistent with the ExplorationPath contract.
 *
 * @param graph - Source graph
-* @param seeds - Seed nodes for expansion
+* @param seeds - Seed nodes for exploration
 * @param config - Random walk configuration
 * @returns Expansion result with discovered paths
 */
@@ -1916,4 +1916,4 @@ function emptyResult(startTime) {
 //#endregion
 export { tide as A, edge as B, fuseWithBatchPriority as C, laceAsync as D, lace as E, reachAsync as F, domeAsync as G, hae as H, sage as I, base as J, domeHighDegree as K, sageAsync as L, maze as M, mazeAsync as N, laceBatchPriority as O, reach as P, pipe as R, fuseBatchPriority as S, warpAsync as T, haeAsync as U, edgeAsync as V, dome as W, baseAsync as Y, siftBatchPriority as _, dfsPriorityFn as a, fuse as b, frontierBalanced as c, standardBfsAsync as d, flux as f, siftAsync as g, sift as h, dfsPriorityAsync as i, tideAsync as j, laceWithBatchPriority as k, frontierBalancedAsync as l, createSiftBatchPriority as m, kHop as n, randomPriority as o, fluxAsync as p, domeHighDegreeAsync as q, dfsPriority as r, randomPriorityAsync as s, randomWalk as t, standardBfs as u, siftWithBatchPriority as v, warp as w, fuseAsync as x, createFuseBatchPriority as y, pipeAsync as z };
 
-//# sourceMappingURL=expansion-CZLNK6Pr.js.map
+//# sourceMappingURL=exploration-DKjRNxS5.js.map