graphwise 1.11.0 → 1.12.1

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

@@ -2,11 +2,11 @@ import { ComputeBackend } from '../gpu/types';
 import { GraphwiseGPURoot } from '../gpu/root';
 import { NodeId, NodeData, EdgeData, ReadableGraph } from '../graph';
 /**
- * Role of a seed node in expansion.
+ * Role of a seed node in exploration.
  */
 export type SeedRole = "source" | "target" | "bidirectional";
 /**
- * A seed node for expansion.
+ * A seed node for exploration.
  */
 export interface Seed {
     /** Node identifier */
@@ -29,14 +29,14 @@ export interface PriorityContext<N extends NodeData = NodeData, E extends EdgeDa
     /** Set of all visited nodes */
     readonly allVisited: ReadonlySet<NodeId>;
     /** Paths discovered so far */
-    readonly discoveredPaths: readonly ExpansionPath[];
+    readonly discoveredPaths: readonly ExplorationPath[];
     /** Current iteration number */
     readonly iteration: number;
     /** Optional MI score (for REACH phase 2) */
     readonly mi?: number;
 }
 /**
- * Function that computes expansion priority for a node.
+ * Function that computes exploration priority for a node.
  * Lower values = higher priority (expanded first).
  */
 export type PriorityFunction<N extends NodeData = NodeData, E extends EdgeData = EdgeData> = (nodeId: NodeId, context: PriorityContext<N, E>) => number;
@@ -53,7 +53,7 @@ export interface BatchPriorityContext<N extends NodeData = NodeData, E extends E
     /** Frontier ID for the current batch */
     readonly frontierId: number;
     /** Paths discovered so far (for REACH-style algorithms) */
-    readonly discoveredPaths: readonly ExpansionPath[];
+    readonly discoveredPaths: readonly ExplorationPath[];
     /** Optional GPU backend selection */
     readonly backend?: ComputeBackend;
     /** Optional TypeGPU root for GPU acceleration */
@@ -65,9 +65,9 @@ export interface BatchPriorityContext<N extends NodeData = NodeData, E extends E
  */
 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.
+ * A path discovered by bidirectional exploration.
  */
-export interface ExpansionPath {
+export interface ExplorationPath {
     /** Source seed */
     readonly fromSeed: Seed;
     /** Target seed */
@@ -78,9 +78,9 @@ export interface ExpansionPath {
     readonly salience?: number;
 }
 /**
- * Statistics from expansion.
+ * Statistics from exploration.
  */
-export interface ExpansionStats {
+export interface ExplorationStats {
     /** Total iterations */
     readonly iterations: number;
     /** Total nodes visited */
@@ -97,24 +97,24 @@ export interface ExpansionStats {
     readonly termination: "exhausted" | "limit" | "collision" | "error";
 }
 /**
- * Result of an expansion algorithm.
+ * Result of an exploration algorithm.
  */
-export interface ExpansionResult {
+export interface ExplorationResult {
     /** All discovered paths */
-    readonly paths: readonly ExpansionPath[];
-    /** Nodes sampled during expansion */
+    readonly paths: readonly ExplorationPath[];
+    /** Nodes sampled during exploration */
     readonly sampledNodes: ReadonlySet<NodeId>;
-    /** Edges sampled during expansion */
+    /** Edges sampled during exploration */
     readonly sampledEdges: ReadonlySet<readonly [NodeId, NodeId]>;
     /** Nodes visited per frontier */
     readonly visitedPerFrontier: readonly ReadonlySet<NodeId>[];
     /** Expansion statistics */
-    readonly stats: ExpansionStats;
+    readonly stats: ExplorationStats;
 }
 /**
- * Configuration for expansion algorithms.
+ * Configuration for exploration algorithms.
  */
-export interface ExpansionConfig<N extends NodeData = NodeData, E extends EdgeData = EdgeData> {
+export interface ExplorationConfig<N extends NodeData = NodeData, E extends EdgeData = EdgeData> {
     /** Maximum number of nodes to visit (0 = unlimited) */
     readonly maxNodes?: number;
     /** Maximum number of iterations (0 = unlimited) */

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

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/exploration/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,eAAe,EAAE,CAAC;IACrD,+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,eAAe,EAAE,CAAC;IACrD,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,eAAe;IAC/B,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,gBAAgB;IAChC,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,iBAAiB;IACjC,2BAA2B;IAC3B,QAAQ,CAAC,KAAK,EAAE,SAAS,eAAe,EAAE,CAAC;IAC3C,uCAAuC;IACvC,QAAQ,CAAC,YAAY,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IAC3C,uCAAuC;IACvC,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,gBAAgB,CAAC;CACjC;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB,CACjC,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 → exploration}/warp.d.ts

@@ -1,21 +1,21 @@
 import { NodeData, EdgeData, ReadableGraph } from '../graph';
 import { AsyncReadableGraph } from '../graph/async-interfaces';
-import { Seed, ExpansionResult, ExpansionConfig } from './types';
+import { Seed, ExplorationResult, ExplorationConfig } from './types';
 import { AsyncExpansionConfig } from './base';
 /**
- * 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
  */
-export declare function warp<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, seeds: readonly Seed[], config?: ExpansionConfig<N, E>): ExpansionResult;
+export declare function warp<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, seeds: readonly Seed[], config?: ExplorationConfig<N, E>): ExplorationResult;
 /**
- * Run WARP expansion asynchronously.
+ * Run WARP exploration asynchronously.
  *
  * Note: the WARP priority function accesses `context.graph` via
  * `countCrossFrontierNeighbours`. Full async equivalence requires
@@ -23,9 +23,9 @@ export declare function warp<N extends NodeData, E extends EdgeData>(graph: Read
  * 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
  */
-export declare function warpAsync<N extends NodeData, E extends EdgeData>(graph: AsyncReadableGraph<N, E>, seeds: readonly Seed[], config?: AsyncExpansionConfig<N, E>): Promise<ExpansionResult>;
+export declare function warpAsync<N extends NodeData, E extends EdgeData>(graph: AsyncReadableGraph<N, E>, seeds: readonly Seed[], config?: AsyncExpansionConfig<N, E>): Promise<ExplorationResult>;
 //# sourceMappingURL=warp.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"warp.d.ts","sourceRoot":"","sources":["../../src/exploration/warp.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;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,EAEjB,MAAM,SAAS,CAAC;AAEjB,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,QAAQ,CAAC;AAkCnD;;;;;;;;;;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,CAKnB;AAED;;;;;;;;;;;;GAYG;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,CAK5B"}

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

@@ -1,5 +1,5 @@
 /**
- * Integration test for WARP expansion algorithm.
+ * Integration test for WARP exploration algorithm.
  *
  * WARP (Path Potential via Intersection Exploration) estimates path potential
  * by counting how many other frontiers have visited a node's neighbours.

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

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

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

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