graphwise 1.11.0 → 1.12.1

package/README.md

@@ -4,14 +4,14 @@
 [![npm](https://img.shields.io/badge/npm-cb3837?logo=npm)](https://www.npmjs.com/package/graphwise)
 [![GitHub](https://img.shields.io/badge/GitHub-181717?logo=github)](https://github.com/Mearman/graphwise)
 
-Low-dependency TypeScript graph algorithms for citation network analysis: novel expansion, MI variants, and path ranking.
+Low-dependency TypeScript graph algorithms for citation network analysis: novel exploration, MI variants, and path ranking.
 
 ## Features
 
-- **Expansion algorithms**: BASE, DOME, EDGE, HAE, PIPE, SAGE, REACH, MAZE + 6 variants (TIDE, LACE, WARP, FUSE, SIFT, FLUX) + baselines
+- **Exploration algorithms**: BASE, DOME, EDGE, HAE, PIPE, SAGE, REACH, MAZE + 6 variants (TIDE, LACE, WARP, FUSE, SIFT, FLUX) + baselines
 - **MI variants**: Jaccard, Adamic-Adar, SCALE, SKEW, SPAN, ETCH, NOTCH, Unified Adaptive
 - **Path ranking**: PARSE + baselines (Katz, Communicability, PageRank, etc.)
-- **Seed selection**: GRASP, Stratified
+- **Seed selection**: GRASP, STRIDE, CREST, SPINE, CRISP, BRISK, BASIL, PRISM, OMNIA, Stratified
 - **Subgraph extraction**: ego-network, k-core, k-truss, motif, induced, filter
 - **Optional WebGPU acceleration**
 - **Async support**: Generator coroutine protocol, sync/async runners, all algorithms available as `*Async` variants
@@ -36,7 +36,7 @@ const ranked = parse(graph, result.paths, { mi: jaccard });
 
 ## Algorithms
 
-### Expansion: BASE Framework
+### Exploration: BASE Framework
 
 **Boundary-free Adaptive Seeded Expansion** (BASE) discovers the neighbourhood around seed nodes without any configuration. You provide seeds and a priority function; BASE expands outward, visiting the most interesting nodes first and recording paths when search frontiers from different seeds collide. It stops naturally when there is nothing left to explore — no depth limits, no size thresholds, no parameters to tune.
 
@@ -50,7 +50,7 @@ Three key properties:
 
 ---
 
-#### DOME: Degree-Ordered Multi-seed Expansion
+#### DOME: Degree-Ordered Multi-seed Exploration
 
 Explores low-connectivity nodes before hubs. In a social network, DOME visits niche specialists before reaching the well-connected influencers, discovering the quiet corners of the graph before the busy crossroads.
 
@@ -60,7 +60,7 @@ where $\deg^{+}(v)$ is weighted out-degree, $\deg^{-}(v)$ is weighted in-degree,
 
 ---
 
-#### Expansion Variants
+#### Exploration Variants
 
 | Algorithm | Priority Function                                      | Phases |
 | --------- | ------------------------------------------------------ | ------ |
@@ -80,7 +80,7 @@ where $\deg^{+}(v)$ is weighted out-degree, $\deg^{-}(v)$ is weighted in-degree,
 
 ---
 
-#### EDGE: Entropy-Driven Graph Expansion
+#### EDGE: Entropy-Driven Graph Exploration
 
 Finds nodes that sit at the boundary between different kinds of things. If a person's friends include scientists, artists, and engineers (high type diversity), EDGE visits them early — they are likely bridges between communities.
 
@@ -90,7 +90,7 @@ where $H_{\text{local}}(v) = -\sum_{\tau} p(\tau) \log p(\tau)$ is the Shannon e
 
 ---
 
-#### PIPE: Path-potential Informed Priority Expansion
+#### PIPE: Path-potential Informed Priority Exploration
 
 Rushes towards nodes that are about to connect two search frontiers. When expanding from multiple seeds, PIPE detects that a node's neighbours have already been reached by another seed's frontier — meaning a connecting path is one step away.
 
@@ -100,7 +100,7 @@ where $\mathrm{pathPotential}(v) = \lvert N(v) \cap \bigcup_{j \neq i} V_j \rver
 
 ---
 
-#### SAGE: Salience-Accumulation Guided Expansion
+#### SAGE: Salience-Accumulation Guided Exploration
 
 Learns from its own discoveries. Phase 1 explores by degree (like DOME). Once the first path is found, SAGE switches to Phase 2: nodes that appear in many discovered paths get top priority, guiding expansion towards structurally rich regions.
 
@@ -112,7 +112,7 @@ where $\text{salience}(v)$ counts discovered paths containing $v$.
 
 ---
 
-#### REACH: Retrospective Expansion with Adaptive Convergence
+#### REACH: Retrospective Exploration with Adaptive Convergence
 
 Uses the quality of already-discovered paths to steer future exploration. Phase 1 explores by degree. Once paths are found, REACH asks "which unexplored nodes look structurally similar to the endpoints of my best paths?" and prioritises those — seeking more of what already worked.
 
@@ -124,7 +124,7 @@ where $\widehat{\text{MI}}(v) = \frac{1}{\lvert \mathcal{P}\_{\text{top}} \rvert
 
 ---
 
-#### MAZE: Multi-frontier Adaptive Zone Expansion
+#### MAZE: Multi-frontier Adaptive Zone Exploration
 
 Combines the best of PIPE and SAGE across three phases. First, it races to find initial paths using path potential (like PIPE). Then it refines exploration using salience feedback (like SAGE). Finally, it decides when to stop based on whether it's still discovering diverse, high-quality paths.
 
@@ -136,7 +136,7 @@ Phase 1 uses path potential until $M$ paths found. Phase 2 adds salience feedbac
 
 ---
 
-#### TIDE: Total Interconnected Degree Expansion
+#### TIDE: Total Interconnected Degree Exploration
 
 Avoids dense clusters by looking at total neighbourhood connectivity. A node surrounded by other well-connected nodes gets deferred; a node in a quiet corner of the graph gets explored first.
 
@@ -146,7 +146,7 @@ Related to EDGE but uses raw degree sums rather than entropy.
 
 ---
 
-#### LACE: Local Affinity-Computed Expansion
+#### LACE: Local Affinity-Computed Exploration
 
 Explores towards nodes that are most similar to what the frontier has already seen. If a candidate node shares many neighbours with the explored region, it gets priority — building outward from a coherent core.
 
@@ -166,7 +166,7 @@ Related to PIPE but omits the degree numerator, making it more aggressive at pri
 
 ---
 
-#### FUSE: Fused Utility-Salience Expansion
+#### FUSE: Fused Utility-Salience Exploration
 
 Balances two signals simultaneously: how connected a node is (degree) and how strongly it relates to the explored region (MI). The weight $w$ controls the trade-off — at $w=0$ it behaves like DOME, at $w=1$ it behaves like LACE.
 
@@ -196,7 +196,7 @@ Related to MAZE but adapts spatially (per-node) rather than temporally (per-phas
 
 ---
 
-#### Expansion Baselines
+#### Exploration Baselines
 
 | Algorithm             | Priority Function              | Description                                |
 | --------------------- | ------------------------------ | ------------------------------------------ |
@@ -325,7 +325,7 @@ where $c(\tau_u)$ is the count of nodes with the same type as $u$.
 
 ### Seed Selection: GRASP
 
-**Graph-agnostic Representative seed pAir Sampling** picks starting points for expansion algorithms. Given a graph you have never seen before, GRASP streams through its edges, samples a representative set of nodes, clusters them by structural role (hubs, bridges, peripherals), and returns seed pairs that cover the full range of structural diversity — without loading the entire graph into memory.
+**Graph-agnostic Representative seed pAir Sampling** picks starting points for exploration algorithms. Given a graph you have never seen before, GRASP streams through its edges, samples a representative set of nodes, clusters them by structural role (hubs, bridges, peripherals), and returns seed pairs that cover the full range of structural diversity — without loading the entire graph into memory.
 
 Three phases:
 
@@ -342,7 +342,7 @@ Three phases:
 ```typescript
 import { ... } from 'graphwise';           // Everything
 import { ... } from 'graphwise/graph';      // Graph data structures
-import { ... } from 'graphwise/expansion';  // Expansion algorithms
+import { ... } from 'graphwise/exploration';  // Exploration algorithms
 import { ... } from 'graphwise/ranking';    // PARSE + baselines
 import { ... } from 'graphwise/ranking/mi'; // MI variants
 import { ... } from 'graphwise/seeds';      // Seed selection

package/dist/__test__/fixtures/graphs/linear-chain.d.ts

@@ -3,15 +3,15 @@ import { KGNode } from '../types';
 /**
  * Five-node linear chain: A – B – C – D – E, all edges weight 1.
  *
- * Used as the primary test graph in expansion unit tests. Seeds are typically
- * placed at the two endpoints (A and E) to exercise bidirectional expansion
+ * Used as the primary test graph in exploration unit tests. Seeds are typically
+ * placed at the two endpoints (A and E) to exercise bidirectional exploration
  * across the full chain length.
  */
 export declare function createLinearChainGraph(): AdjacencyMapGraph<KGNode>;
 /**
  * Two disconnected nodes A and B with no edges between them.
  *
- * Used to verify that expansion algorithms correctly return zero paths when
+ * Used to verify that exploration algorithms correctly return zero paths when
  * seeds cannot be connected.
  */
 export declare function createDisconnectedGraph(): AdjacencyMapGraph<KGNode>;

package/dist/__test__/fixtures/helpers.d.ts

@@ -1,14 +1,14 @@
 import { NodeId, ReadableGraph, NodeData, EdgeData } from '../../graph';
-import { ExpansionPath, ExpansionResult, ExpansionStats } from '../../expansion';
+import { ExplorationPath, ExplorationResult, ExplorationStats } from '../../exploration';
 import { MIFunction } from '../../ranking/mi';
 /**
- * Create an ExpansionPath from an array of node IDs.
+ * Create an ExplorationPath from an array of node IDs.
  *
  * The first node becomes the source seed and the last becomes the target seed.
  * Useful for constructing paths in tests without manually creating Seed objects.
  *
  * @param nodes - Array of node IDs forming the path (must have at least 1 element)
- * @returns ExpansionPath with fromSeed and toSeed inferred from endpoints
+ * @returns ExplorationPath with fromSeed and toSeed inferred from endpoints
  *
  * @example
  * ```typescript
@@ -18,7 +18,7 @@ import { MIFunction } from '../../ranking/mi';
  * // path.nodes === ['A', 'B', 'C']
  * ```
  */
-export declare function createPath(nodes: readonly NodeId[]): ExpansionPath;
+export declare function createPath(nodes: readonly NodeId[]): ExplorationPath;
 /**
  * Compute the mean MI across all edges in a single path.
  *
@@ -40,18 +40,18 @@ export declare function createPath(nodes: readonly NodeId[]): ExpansionPath;
  * // score is geometric mean of MI(A,B) and MI(B,C)
  * ```
  */
-export declare function pathMI<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, path: ExpansionPath, mi: MIFunction<N, E>): number;
+export declare function pathMI<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, path: ExplorationPath, mi: MIFunction<N, E>): number;
 /**
- * Assert that an ExpansionResult has the four required top-level properties.
+ * Assert that an ExplorationResult has the four required top-level properties.
  *
  * Checks for `paths`, `sampledNodes`, `sampledEdges`, and `stats`. Intended
- * as a concise structural guard in expansion unit tests.
+ * as a concise structural guard in exploration unit tests.
  *
- * @param result - The expansion result to validate
+ * @param result - The exploration result to validate
  */
-export declare function assertExpansionResultShape(result: ExpansionResult): void;
+export declare function assertExpansionResultShape(result: ExplorationResult): void;
 /**
- * Assert that an ExpansionStats object has all expected numeric fields and
+ * Assert that an ExplorationStats object has all expected numeric fields and
  * a valid termination reason.
  *
  * Checks `iterations`, `nodesVisited`, `edgesTraversed`, `pathsFound`,
@@ -59,7 +59,7 @@ export declare function assertExpansionResultShape(result: ExpansionResult): voi
  *
  * @param stats - The stats object to validate
  */
-export declare function assertValidStats(stats: ExpansionStats): void;
+export declare function assertValidStats(stats: ExplorationStats): void;
 /**
  * Compute the mean MI across all edges in all paths.
  *
@@ -81,5 +81,5 @@ export declare function assertValidStats(stats: ExpansionStats): void;
  * const avgScore = meanPathMI(graph, paths, jaccard);
  * ```
  */
-export declare function meanPathMI<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, paths: readonly ExpansionPath[], mi: MIFunction<N, E>): number;
+export declare function meanPathMI<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, paths: readonly ExplorationPath[], mi: MIFunction<N, E>): number;
 //# sourceMappingURL=helpers.d.ts.map

package/dist/__test__/fixtures/helpers.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"helpers.d.ts","sourceRoot":"","sources":["../../../src/__test__/fixtures/helpers.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,aAAa,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAC7E,OAAO,KAAK,EACX,aAAa,EACb,eAAe,EACf,cAAc,EACd,MAAM,iBAAiB,CAAC;AACzB,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAEnD;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,GAAG,aAAa,CAiBlE;AAoBD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,MAAM,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAC5D,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,IAAI,EAAE,aAAa,EACnB,EAAE,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,GAClB,MAAM,CAgCR;AAED;;;;;;;GAOG;AACH,wBAAgB,0BAA0B,CAAC,MAAM,EAAE,eAAe,GAAG,IAAI,CAaxE;AAED;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,cAAc,GAAG,IAAI,CA8B5D;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,UAAU,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAChE,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,KAAK,EAAE,SAAS,aAAa,EAAE,EAC/B,EAAE,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,GAClB,MAAM,CAeR"}
+{"version":3,"file":"helpers.d.ts","sourceRoot":"","sources":["../../../src/__test__/fixtures/helpers.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,aAAa,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAC7E,OAAO,KAAK,EACX,eAAe,EACf,iBAAiB,EACjB,gBAAgB,EAChB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAEnD;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,GAAG,eAAe,CAiBpE;AAoBD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,MAAM,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAC5D,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,IAAI,EAAE,eAAe,EACrB,EAAE,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,GAClB,MAAM,CAgCR;AAED;;;;;;;GAOG;AACH,wBAAgB,0BAA0B,CAAC,MAAM,EAAE,iBAAiB,GAAG,IAAI,CAa1E;AAED;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,gBAAgB,GAAG,IAAI,CA8B9D;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,UAAU,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAChE,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,KAAK,EAAE,SAAS,eAAe,EAAE,EACjC,EAAE,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,GAClB,MAAM,CAeR"}

package/dist/__test__/fixtures/index.d.ts

@@ -2,7 +2,7 @@
  * Test fixtures infrastructure.
  *
  * Provides types, helpers, and graph builders for integration tests
- * across expansion, ranking, and other algorithms.
+ * across exploration, ranking, and other algorithms.
  */
 export * from './types';
 export * from './helpers';

package/dist/__test__/fixtures/metrics.d.ts

@@ -1,44 +1,44 @@
 import { NodeId, NodeData, EdgeData, ReadableGraph } from '../../graph';
-import { ExpansionResult } from '../../expansion/types';
+import { ExplorationResult } from '../../exploration/types';
 import { PARSEResult } from '../../ranking/parse';
 /**
  * Fraction of visited nodes whose degree is below the 90th percentile of all
  * sampled node degrees. A high ratio indicates the algorithm successfully
  * defers high-degree hubs in favour of lower-degree nodes.
  */
-export declare function hubDeferralRatio<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, result: ExpansionResult): number;
+export declare function hubDeferralRatio<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, result: ExplorationResult): number;
 /**
  * Count of distinct intermediate nodes (i.e. excluding endpoints) across all
  * discovered paths. Higher values indicate broader path diversity.
  */
-export declare function pathDiversity(result: ExpansionResult): number;
+export declare function pathDiversity(result: ExplorationResult): number;
 /**
  * Ratio of sampled edges to sampled nodes. Reflects how densely the sampled
  * subgraph is connected (higher = more edges per node).
  */
-export declare function subgraphDensity(result: ExpansionResult): number;
+export declare function subgraphDensity(result: ExplorationResult): number;
 /**
  * Ratio of discovered paths to total nodes visited. Measures how efficiently
- * the expansion produced useful paths relative to exploration cost.
+ * the exploration produced useful paths relative to exploration cost.
  */
-export declare function coverageEfficiency(result: ExpansionResult): number;
+export declare function coverageEfficiency(result: ExplorationResult): number;
 /**
  * Ratio of total iterations to paths discovered. Measures how many
  * iterations were required per path. Returns Infinity when no paths
- * were found (expansion terminated without connecting seeds).
+ * were found (exploration terminated without connecting seeds).
  */
-export declare function firstPathLatency(result: ExpansionResult): number;
+export declare function firstPathLatency(result: ExplorationResult): number;
 /**
  * Number of distinct node types present in the sampled node set.
  * Nodes without a `type` property are counted as a single unnamed type.
  */
-export declare function typeCoverage<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, result: ExpansionResult): number;
+export declare function typeCoverage<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, result: ExplorationResult): number;
 /**
  * Number of connected components that contain at least one path node,
  * determined via union-find over the sampled edge set. Higher values
  * indicate paths spanning structurally distant regions of the graph.
  */
-export declare function communitySpan(result: ExpansionResult): number;
+export declare function communitySpan(result: ExplorationResult): number;
 /**
  * Spearman rank correlation coefficient between two rankings (arrays of node
  * IDs ordered from highest to lowest). Returns a value in [-1, 1] where 1

package/dist/__test__/fixtures/metrics.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"metrics.d.ts","sourceRoot":"","sources":["../../../src/__test__/fixtures/metrics.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC7E,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAC7D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAMvD;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EACtE,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,MAAM,EAAE,eAAe,GACrB,MAAM,CAaR;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,eAAe,GAAG,MAAM,CAa7D;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,eAAe,GAAG,MAAM,CAM/D;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,eAAe,GAAG,MAAM,CAMlE;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,eAAe,GAAG,MAAM,CAKhE;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAClE,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,MAAM,EAAE,eAAe,GACrB,MAAM,CASR;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,eAAe,GAAG,MAAM,CA4C7D;AAMD;;;;;;GAMG;AACH,wBAAgB,WAAW,CAC1B,QAAQ,EAAE,SAAS,MAAM,EAAE,EAC3B,QAAQ,EAAE,SAAS,MAAM,EAAE,GACzB,MAAM,CA+BR;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CACzB,QAAQ,EAAE,SAAS,MAAM,EAAE,EAC3B,QAAQ,EAAE,SAAS,MAAM,EAAE,GACzB,MAAM,CAsCR;AAMD;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CAClC,UAAU,EAAE,MAAM,EAClB,QAAQ,EAAE,MAAM,GACd,MAAM,CAKR;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,WAAW,EAAE,WAAW,GAAG,MAAM,CAS9D;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,WAAW,EAAE,WAAW,GAAG,MAAM,CA+B3D;AAED;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAK1E"}
+{"version":3,"file":"metrics.d.ts","sourceRoot":"","sources":["../../../src/__test__/fixtures/metrics.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC7E,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AACjE,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAMvD;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EACtE,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,MAAM,EAAE,iBAAiB,GACvB,MAAM,CAaR;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,iBAAiB,GAAG,MAAM,CAa/D;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,iBAAiB,GAAG,MAAM,CAMjE;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,iBAAiB,GAAG,MAAM,CAMpE;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,iBAAiB,GAAG,MAAM,CAKlE;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAClE,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,MAAM,EAAE,iBAAiB,GACvB,MAAM,CASR;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,iBAAiB,GAAG,MAAM,CA4C/D;AAMD;;;;;;GAMG;AACH,wBAAgB,WAAW,CAC1B,QAAQ,EAAE,SAAS,MAAM,EAAE,EAC3B,QAAQ,EAAE,SAAS,MAAM,EAAE,GACzB,MAAM,CA+BR;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CACzB,QAAQ,EAAE,SAAS,MAAM,EAAE,EAC3B,QAAQ,EAAE,SAAS,MAAM,EAAE,GACzB,MAAM,CAsCR;AAMD;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CAClC,UAAU,EAAE,MAAM,EAClB,QAAQ,EAAE,MAAM,GACd,MAAM,CAKR;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,WAAW,EAAE,WAAW,GAAG,MAAM,CAS9D;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,WAAW,EAAE,WAAW,GAAG,MAAM,CA+B3D;AAED;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAK1E"}

package/dist/__test__/fixtures/types.d.ts

@@ -1,5 +1,5 @@
 import { NodeData, EdgeData, ReadableGraph } from '../../graph';
-import { Seed } from '../../expansion';
+import { Seed } from '../../exploration';
 /**
  * Knowledge graph node with optional label and type.
  */
@@ -27,7 +27,7 @@ export interface KGEdge extends EdgeData {
 export interface TestGraphFixture {
     /** The test graph */
     readonly graph: ReadableGraph;
-    /** Seed nodes for expansion */
+    /** Seed nodes for exploration */
     readonly seeds: readonly Seed[];
     /** Optional metadata about the fixture (e.g. structure description) */
     readonly metadata: Record<string, unknown>;

package/dist/__test__/fixtures/types.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/__test__/fixtures/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AACrE,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,iBAAiB,CAAC;AAE5C;;GAEG;AACH,MAAM,WAAW,MAAO,SAAQ,QAAQ;IACvC,wCAAwC;IACxC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,8DAA8D;IAC9D,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;CACvB;AAED;;GAEG;AACH,MAAM,WAAW,MAAO,SAAQ,QAAQ;IACvC,oDAAoD;IACpD,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,sEAAsE;IACtE,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;CACvB;AAED;;;;;GAKG;AACH,MAAM,WAAW,gBAAgB;IAChC,qBAAqB;IACrB,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC;IAC9B,+BAA+B;IAC/B,QAAQ,CAAC,KAAK,EAAE,SAAS,IAAI,EAAE,CAAC;IAChC,uEAAuE;IACvE,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CAC3C"}
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/__test__/fixtures/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AACrE,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,mBAAmB,CAAC;AAE9C;;GAEG;AACH,MAAM,WAAW,MAAO,SAAQ,QAAQ;IACvC,wCAAwC;IACxC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,8DAA8D;IAC9D,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;CACvB;AAED;;GAEG;AACH,MAAM,WAAW,MAAO,SAAQ,QAAQ;IACvC,oDAAoD;IACpD,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,sEAAsE;IACtE,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;CACvB;AAED;;;;;GAKG;AACH,MAAM,WAAW,gBAAgB;IAChC,qBAAqB;IACrB,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC;IAC9B,iCAAiC;IACjC,QAAQ,CAAC,KAAK,EAAE,SAAS,IAAI,EAAE,CAAC;IAChC,uEAAuE;IACvE,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CAC3C"}

package/dist/async/protocol.d.ts

@@ -64,7 +64,7 @@ export type GraphOpResponse<N extends NodeData = NodeData, E extends EdgeData =
 } | {
     readonly tag: "progress";
 };
-/** Progress statistics emitted during expansion. */
+/** Progress statistics emitted during exploration. */
 export interface ProgressStats {
     readonly iterations: number;
     readonly nodesVisited: number;

package/dist/async/protocol.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"protocol.d.ts","sourceRoot":"","sources":["../../src/async/protocol.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,UAAU,CAAC;AAEtE,gEAAgE;AAChE,MAAM,MAAM,OAAO,GAChB;IACA,QAAQ,CAAC,GAAG,EAAE,YAAY,CAAC;IAC3B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,CAAC;CAC9B,GACD;IACA,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC;IACvB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,CAAC;CAC9B,GACD;IAAE,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC;IAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAChD;IACA,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC;IACxB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACvB,GACD;IAAE,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC;IAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAChD;IACA,QAAQ,CAAC,GAAG,EAAE,iBAAiB,CAAC;IAChC,QAAQ,CAAC,GAAG,EAAE,SAAS,MAAM,EAAE,CAAC;IAChC,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,CAAC;CAC9B,GACD;IACA,QAAQ,CAAC,GAAG,EAAE,aAAa,CAAC;IAC5B,QAAQ,CAAC,GAAG,EAAE,SAAS,MAAM,EAAE,CAAC;IAChC,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,CAAC;CAC9B,GACD;IAAE,QAAQ,CAAC,GAAG,EAAE,OAAO,CAAA;CAAE,GACzB;IAAE,QAAQ,CAAC,GAAG,EAAE,UAAU,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAA;CAAE,CAAC;AAE/D;;;;;GAKG;AACH,MAAM,MAAM,eAAe,CAC1B,CAAC,SAAS,QAAQ,GAAG,QAAQ,EAC7B,CAAC,SAAS,QAAQ,GAAG,QAAQ,IAE3B;IAAE,QAAQ,CAAC,GAAG,EAAE,YAAY,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAA;CAAE,GACjE;IAAE,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GAClD;IAAE,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,SAAS,CAAA;CAAE,GAC1D;IAAE,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,SAAS,CAAA;CAAE,GAC1D;IAAE,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAA;CAAE,GACpD;IACA,QAAQ,CAAC,GAAG,EAAE,iBAAiB,CAAC;IAChC,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC;CACtD,GACD;IAAE,QAAQ,CAAC,GAAG,EAAE,aAAa,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CAAE,GAC5E;IAAE,QAAQ,CAAC,GAAG,EAAE,OAAO,CAAA;CAAE,GACzB;IAAE,QAAQ,CAAC,GAAG,EAAE,UAAU,CAAA;CAAE,CAAC;AAEhC,oDAAoD;AACpD,MAAM,WAAW,aAAa;IAC7B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,aAAa,EAAE,SAAS,MAAM,EAAE,CAAC;IAC1C,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC3B"}
+{"version":3,"file":"protocol.d.ts","sourceRoot":"","sources":["../../src/async/protocol.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,UAAU,CAAC;AAEtE,gEAAgE;AAChE,MAAM,MAAM,OAAO,GAChB;IACA,QAAQ,CAAC,GAAG,EAAE,YAAY,CAAC;IAC3B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,CAAC;CAC9B,GACD;IACA,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC;IACvB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,CAAC;CAC9B,GACD;IAAE,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC;IAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAChD;IACA,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC;IACxB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACvB,GACD;IAAE,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC;IAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAChD;IACA,QAAQ,CAAC,GAAG,EAAE,iBAAiB,CAAC;IAChC,QAAQ,CAAC,GAAG,EAAE,SAAS,MAAM,EAAE,CAAC;IAChC,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,CAAC;CAC9B,GACD;IACA,QAAQ,CAAC,GAAG,EAAE,aAAa,CAAC;IAC5B,QAAQ,CAAC,GAAG,EAAE,SAAS,MAAM,EAAE,CAAC;IAChC,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,CAAC;CAC9B,GACD;IAAE,QAAQ,CAAC,GAAG,EAAE,OAAO,CAAA;CAAE,GACzB;IAAE,QAAQ,CAAC,GAAG,EAAE,UAAU,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAA;CAAE,CAAC;AAE/D;;;;;GAKG;AACH,MAAM,MAAM,eAAe,CAC1B,CAAC,SAAS,QAAQ,GAAG,QAAQ,EAC7B,CAAC,SAAS,QAAQ,GAAG,QAAQ,IAE3B;IAAE,QAAQ,CAAC,GAAG,EAAE,YAAY,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAA;CAAE,GACjE;IAAE,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GAClD;IAAE,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,SAAS,CAAA;CAAE,GAC1D;IAAE,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,SAAS,CAAA;CAAE,GAC1D;IAAE,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAA;CAAE,GACpD;IACA,QAAQ,CAAC,GAAG,EAAE,iBAAiB,CAAC;IAChC,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC;CACtD,GACD;IAAE,QAAQ,CAAC,GAAG,EAAE,aAAa,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CAAE,GAC5E;IAAE,QAAQ,CAAC,GAAG,EAAE,OAAO,CAAA;CAAE,GACzB;IAAE,QAAQ,CAAC,GAAG,EAAE,UAAU,CAAA;CAAE,CAAC;AAEhC,sDAAsD;AACtD,MAAM,WAAW,aAAa;IAC7B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,aAAa,EAAE,SAAS,MAAM,EAAE,CAAC;IAC1C,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC3B"}

package/dist/{expansion → exploration}/base-core.d.ts

@@ -1,8 +1,8 @@
 import { NodeData, EdgeData, ReadableGraph } from '../graph';
 import { GraphOp, GraphOpResponse } from '../async/protocol';
-import { Seed, ExpansionResult, ExpansionConfig } from './types';
+import { Seed, ExplorationResult, ExplorationConfig } from './types';
 /**
- * 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
@@ -11,14 +11,14 @@ import { Seed, ExpansionResult, ExpansionConfig } from './types';
  * 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
  */
 export declare function baseCore<N extends NodeData, E extends EdgeData>(graphMeta: {
     readonly directed: boolean;
     readonly nodeCount: number;
     readonly edgeCount: number;
-}, seeds: readonly Seed[], config?: ExpansionConfig<N, E>, graphRef?: ReadableGraph<N, E>): Generator<GraphOp, ExpansionResult, GraphOpResponse<N, E>>;
+}, seeds: readonly Seed[], config?: ExplorationConfig<N, E>, graphRef?: ReadableGraph<N, E>): Generator<GraphOp, ExplorationResult, GraphOpResponse<N, E>>;
 //# sourceMappingURL=base-core.d.ts.map

package/dist/exploration/base-core.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"base-core.d.ts","sourceRoot":"","sources":["../../src/exploration/base-core.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAU,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AAE1E,OAAO,KAAK,EAAE,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAElE,OAAO,KAAK,EACX,IAAI,EACJ,iBAAiB,EAGjB,iBAAiB,EAGjB,MAAM,SAAS,CAAC;AAqBjB;;;;;;;;;;;;;;GAcG;AACH,wBAAiB,QAAQ,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAC/D,SAAS,EAAE;IACV,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC3B,EACD,KAAK,EAAE,SAAS,IAAI,EAAE,EACtB,MAAM,CAAC,EAAE,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,EAChC,QAAQ,CAAC,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,GAC5B,SAAS,CAAC,OAAO,EAAE,iBAAiB,EAAE,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAoR9D"}

package/dist/exploration/base-core.unit.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"base-core.unit.test.d.ts","sourceRoot":"","sources":["../../src/exploration/base-core.unit.test.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG"}

package/dist/{expansion → exploration}/base-helpers.d.ts

@@ -1,7 +1,7 @@
 import { NodeId } from '../graph';
-import { Seed, ExpansionPath, ExpansionResult, ExpansionStats } from './types';
+import { Seed, ExplorationPath, ExplorationResult, ExplorationStats } from './types';
 /**
- * Internal queue entry for frontier expansion.
+ * Internal queue entry for frontier exploration.
  */
 export interface QueueEntry {
     nodeId: NodeId;
@@ -11,13 +11,13 @@ export interface QueueEntry {
 /**
  * Limits structure used by continueExpansion.
  */
-export interface ExpansionLimits {
+export interface ExplorationLimits {
     readonly maxIterations: number;
     readonly maxNodes: number;
     readonly maxPaths: number;
 }
 /**
- * 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.
@@ -25,12 +25,12 @@ export interface ExpansionLimits {
  * @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
  */
-export declare function continueExpansion(iterations: number, nodesVisited: number, pathsFound: number, limits: ExpansionLimits): {
+export declare function continueExpansion(iterations: number, nodesVisited: number, pathsFound: number, limits: ExplorationLimits): {
     shouldContinue: boolean;
-    termination: ExpansionStats["termination"];
+    termination: ExplorationStats["termination"];
 };
 /**
  * Reconstruct path from collision point.
@@ -45,13 +45,13 @@ export declare function continueExpansion(iterations: number, nodesVisited: numb
  * @param seeds - Seed nodes, one per frontier
  * @returns The reconstructed path, or null if seeds are missing
  */
-export declare function reconstructPath(collisionNode: NodeId, frontierA: number, frontierB: number, predecessors: readonly Map<NodeId, NodeId | null>[], seeds: readonly Seed[]): ExpansionPath | null;
+export declare function reconstructPath(collisionNode: NodeId, frontierA: number, frontierB: number, predecessors: readonly Map<NodeId, NodeId | null>[], seeds: readonly Seed[]): ExplorationPath | null;
 /**
- * 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
  */
-export declare function emptyResult(algorithm: string, startTime: number): ExpansionResult;
+export declare function emptyResult(algorithm: string, startTime: number): ExplorationResult;
 //# sourceMappingURL=base-helpers.d.ts.map

package/dist/exploration/base-helpers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"base-helpers.d.ts","sourceRoot":"","sources":["../../src/exploration/base-helpers.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AACvC,OAAO,KAAK,EACX,IAAI,EACJ,eAAe,EACf,iBAAiB,EACjB,gBAAgB,EAChB,MAAM,SAAS,CAAC;AAEjB;;GAEG;AACH,MAAM,WAAW,UAAU;IAC1B,MAAM,EAAE,MAAM,CAAC;IACf,aAAa,EAAE,MAAM,CAAC;IACtB,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;CAC3B;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IACjC,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC1B;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,iBAAiB,CAChC,UAAU,EAAE,MAAM,EAClB,YAAY,EAAE,MAAM,EACpB,UAAU,EAAE,MAAM,EAClB,MAAM,EAAE,iBAAiB,GACvB;IAAE,cAAc,EAAE,OAAO,CAAC;IAAC,WAAW,EAAE,gBAAgB,CAAC,aAAa,CAAC,CAAA;CAAE,CAW3E;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,eAAe,CAC9B,aAAa,EAAE,MAAM,EACrB,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,MAAM,EACjB,YAAY,EAAE,SAAS,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,EAAE,EACnD,KAAK,EAAE,SAAS,IAAI,EAAE,GACpB,eAAe,GAAG,IAAI,CAuCxB;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CAC1B,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,MAAM,GACf,iBAAiB,CAgBnB"}

package/dist/{expansion → exploration}/base.d.ts

@@ -1,29 +1,29 @@
 import { NodeData, EdgeData, ReadableGraph } from '../graph';
 import { AsyncReadableGraph } from '../graph/async-interfaces';
 import { AsyncRunnerOptions } from '../async/types';
-import { Seed, ExpansionResult, ExpansionConfig } from './types';
+import { Seed, ExplorationResult, ExplorationConfig } from './types';
 /**
- * Configuration for the async BASE expansion algorithm.
+ * Configuration for the async BASE exploration algorithm.
  *
- * Extends ExpansionConfig with async runner options (cancellation, progress,
+ * Extends ExplorationConfig with async runner options (cancellation, progress,
  * yield strategy).
  */
-export interface AsyncExpansionConfig<N extends NodeData = NodeData, E extends EdgeData = EdgeData> extends ExpansionConfig<N, E>, AsyncRunnerOptions {
+export interface AsyncExpansionConfig<N extends NodeData = NodeData, E extends EdgeData = EdgeData> extends ExplorationConfig<N, E>, AsyncRunnerOptions {
 }
 /**
- * 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
  */
-export declare function base<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, seeds: readonly Seed[], config?: ExpansionConfig<N, E>): ExpansionResult;
+export declare function base<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, seeds: readonly Seed[], config?: ExplorationConfig<N, E>): ExplorationResult;
 /**
- * Run BASE expansion asynchronously.
+ * Run BASE exploration asynchronously.
  *
  * Delegates to baseCore + runAsync. Supports:
  * - Cancellation via AbortSignal (config.signal)
@@ -35,9 +35,9 @@ export declare function base<N extends NodeData, E extends EdgeData>(graph: Read
  * 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
  */
-export declare function baseAsync<N extends NodeData, E extends EdgeData>(graph: AsyncReadableGraph<N, E>, seeds: readonly Seed[], config?: AsyncExpansionConfig<N, E>): Promise<ExpansionResult>;
+export declare function baseAsync<N extends NodeData, E extends EdgeData>(graph: AsyncReadableGraph<N, E>, seeds: readonly Seed[], config?: AsyncExpansionConfig<N, E>): Promise<ExplorationResult>;
 //# sourceMappingURL=base.d.ts.map

package/dist/exploration/base.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"base.d.ts","sourceRoot":"","sources":["../../src/exploration/base.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AAClE,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AAEpE,OAAO,KAAK,EAAE,kBAAkB,EAAiB,MAAM,gBAAgB,CAAC;AAGxE,OAAO,KAAK,EAAE,IAAI,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,SAAS,CAAC;AAE1E;;;;;GAKG;AACH,MAAM,WAAW,oBAAoB,CACpC,CAAC,SAAS,QAAQ,GAAG,QAAQ,EAC7B,CAAC,SAAS,QAAQ,GAAG,QAAQ,CAE7B,SAAQ,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,kBAAkB;CAAG;AAEvD;;;;;;;;;;GAUG;AACH,wBAAgB,IAAI,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAC1D,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,KAAK,EAAE,SAAS,IAAI,EAAE,EACtB,MAAM,CAAC,EAAE,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,GAC9B,iBAAiB,CAYnB;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAsB,SAAS,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EACrE,KAAK,EAAE,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,EAC/B,KAAK,EAAE,SAAS,IAAI,EAAE,EACtB,MAAM,CAAC,EAAE,oBAAoB,CAAC,CAAC,EAAE,CAAC,CAAC,GACjC,OAAO,CAAC,iBAAiB,CAAC,CA8B5B"}

package/dist/exploration/base.unit.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"base.unit.test.d.ts","sourceRoot":"","sources":["../../src/exploration/base.unit.test.ts"],"names":[],"mappings":""}

package/dist/{expansion → exploration}/comparison.integration.test.d.ts

@@ -1,7 +1,7 @@
 /**
- * Cross-algorithm comparison integration tests for expansion algorithms.
+ * Cross-algorithm comparison integration tests for exploration algorithms.
  *
- * Runs all expansion algorithms head-to-head on the same graphs to verify
+ * Runs all exploration algorithms head-to-head on the same graphs to verify
  * relative performance properties. Tests are structural rather than exact —
  * they validate ordering relationships and quality bounds with tolerance.
  *

package/dist/exploration/comparison.integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"comparison.integration.test.d.ts","sourceRoot":"","sources":["../../src/exploration/comparison.integration.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG"}

package/dist/{expansion → exploration}/dfs-priority.d.ts

@@ -1,6 +1,6 @@
 import { NodeData, EdgeData, ReadableGraph } from '../graph';
 import { AsyncReadableGraph } from '../graph/async-interfaces';
-import { Seed, ExpansionResult, ExpansionConfig, PriorityContext } from './types';
+import { Seed, ExplorationResult, ExplorationConfig, PriorityContext } from './types';
 import { AsyncExpansionConfig } from './base';
 /**
  * DFS priority function: negative iteration produces LIFO ordering.
@@ -10,25 +10,25 @@ import { AsyncExpansionConfig } from './base';
  */
 export declare function dfsPriorityFn<N extends NodeData, E extends EdgeData>(_nodeId: string, context: PriorityContext<N, E>): number;
 /**
- * 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
  */
-export declare function dfsPriority<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, seeds: readonly Seed[], config?: ExpansionConfig<N, E>): ExpansionResult;
+export declare function dfsPriority<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, seeds: readonly Seed[], config?: ExplorationConfig<N, E>): ExplorationResult;
 /**
- * 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
  */
-export declare function dfsPriorityAsync<N extends NodeData, E extends EdgeData>(graph: AsyncReadableGraph<N, E>, seeds: readonly Seed[], config?: AsyncExpansionConfig<N, E>): Promise<ExpansionResult>;
+export declare function dfsPriorityAsync<N extends NodeData, E extends EdgeData>(graph: AsyncReadableGraph<N, E>, seeds: readonly Seed[], config?: AsyncExpansionConfig<N, E>): Promise<ExplorationResult>;
 //# sourceMappingURL=dfs-priority.d.ts.map

package/dist/exploration/dfs-priority.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dfs-priority.d.ts","sourceRoot":"","sources":["../../src/exploration/dfs-priority.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AAClE,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AACpE,OAAO,KAAK,EACX,IAAI,EACJ,iBAAiB,EACjB,iBAAiB,EACjB,eAAe,EACf,MAAM,SAAS,CAAC;AAEjB,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,QAAQ,CAAC;AAEnD;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EACnE,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,GAC5B,MAAM,CAER;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,WAAW,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EACjE,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,KAAK,EAAE,SAAS,IAAI,EAAE,EACtB,MAAM,CAAC,EAAE,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,GAC9B,iBAAiB,CAKnB;AAED;;;;;;;GAOG;AACH,wBAAsB,gBAAgB,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAC5E,KAAK,EAAE,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,EAC/B,KAAK,EAAE,SAAS,IAAI,EAAE,EACtB,MAAM,CAAC,EAAE,oBAAoB,CAAC,CAAC,EAAE,CAAC,CAAC,GACjC,OAAO,CAAC,iBAAiB,CAAC,CAE5B"}

package/dist/exploration/dfs-priority.unit.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dfs-priority.unit.test.d.ts","sourceRoot":"","sources":["../../src/exploration/dfs-priority.unit.test.ts"],"names":[],"mappings":""}