graphwise 1.4.2 → 1.5.0

package/dist/ranking/baselines/hitting-time.d.ts

@@ -0,0 +1,27 @@
+import { NodeData, EdgeData, ReadableGraph } from '../../graph';
+import { ExpansionPath } from '../../expansion/types';
+import { BaselineConfig, BaselineResult } from './types';
+/**
+ * Configuration for hitting-time ranking.
+ */
+interface HittingTimeConfig extends BaselineConfig {
+    /** Computation mode: "exact", "approximate", or "auto" (default: "auto") */
+    readonly mode?: "exact" | "approximate" | "auto";
+    /** Number of Monte Carlo walks for approximate mode (default: 1000) */
+    readonly walks?: number;
+    /** Maximum steps per walk (default: 10000) */
+    readonly maxSteps?: number;
+    /** Random seed for reproducibility (default: 42) */
+    readonly seed?: number;
+}
+/**
+ * Rank paths by inverse hitting time between endpoints.
+ *
+ * @param graph - Source graph
+ * @param paths - Paths to rank
+ * @param config - Configuration options
+ * @returns Ranked paths (highest inverse hitting time first)
+ */
+export declare function hittingTime<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, paths: readonly ExpansionPath[], config?: HittingTimeConfig): BaselineResult;
+export {};
+//# sourceMappingURL=hitting-time.d.ts.map

package/dist/ranking/baselines/hitting-time.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hitting-time.d.ts","sourceRoot":"","sources":["../../../src/ranking/baselines/hitting-time.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AACrE,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAC3D,OAAO,KAAK,EAAE,cAAc,EAAE,cAAc,EAAc,MAAM,SAAS,CAAC;AAE1E;;GAEG;AACH,UAAU,iBAAkB,SAAQ,cAAc;IACjD,4EAA4E;IAC5E,QAAQ,CAAC,IAAI,CAAC,EAAE,OAAO,GAAG,aAAa,GAAG,MAAM,CAAC;IACjD,uEAAuE;IACvE,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,8CAA8C;IAC9C,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAC3B,oDAAoD;IACpD,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;CACvB;AAwVD;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EACjE,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,KAAK,EAAE,SAAS,aAAa,EAAE,EAC/B,MAAM,CAAC,EAAE,iBAAiB,GACxB,cAAc,CA2EhB"}

package/dist/ranking/baselines/hitting-time.unit.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=hitting-time.unit.test.d.ts.map

package/dist/ranking/baselines/hitting-time.unit.test.d.ts.map

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

package/dist/ranking/baselines/index.d.ts

@@ -17,4 +17,5 @@ export * from './katz';
 export * from './communicability';
 export * from './resistance-distance';
 export * from './random-ranking';
+export * from './hitting-time';
 //# sourceMappingURL=index.d.ts.map

package/dist/ranking/baselines/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/ranking/baselines/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,cAAc,SAAS,CAAC;AACxB,cAAc,YAAY,CAAC;AAC3B,cAAc,cAAc,CAAC;AAC7B,cAAc,eAAe,CAAC;AAC9B,cAAc,sBAAsB,CAAC;AACrC,cAAc,YAAY,CAAC;AAC3B,cAAc,eAAe,CAAC;AAC9B,cAAc,QAAQ,CAAC;AACvB,cAAc,mBAAmB,CAAC;AAClC,cAAc,uBAAuB,CAAC;AACtC,cAAc,kBAAkB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/ranking/baselines/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,cAAc,SAAS,CAAC;AACxB,cAAc,YAAY,CAAC;AAC3B,cAAc,cAAc,CAAC;AAC7B,cAAc,eAAe,CAAC;AAC9B,cAAc,sBAAsB,CAAC;AACrC,cAAc,YAAY,CAAC;AAC3B,cAAc,eAAe,CAAC;AAC9B,cAAc,QAAQ,CAAC;AACvB,cAAc,mBAAmB,CAAC;AAClC,cAAc,uBAAuB,CAAC;AACtC,cAAc,kBAAkB,CAAC;AACjC,cAAc,gBAAgB,CAAC"}

package/dist/ranking/mi/cosine.d.ts

@@ -0,0 +1,13 @@
+import { NodeId, NodeData, EdgeData, ReadableGraph } from '../../graph';
+import { MIConfig } from './types';
+/**
+ * Compute cosine similarity between neighbourhoods of two nodes.
+ *
+ * @param graph - Source graph
+ * @param source - Source node ID
+ * @param target - Target node ID
+ * @param config - Optional configuration
+ * @returns Cosine similarity in [0, 1]
+ */
+export declare function cosine<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, source: NodeId, target: NodeId, config?: MIConfig): number;
+//# sourceMappingURL=cosine.d.ts.map

package/dist/ranking/mi/cosine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cosine.d.ts","sourceRoot":"","sources":["../../../src/ranking/mi/cosine.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAE7E,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAExC;;;;;;;;GAQG;AACH,wBAAgB,MAAM,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAC5D,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,MAAM,CAuBR"}

package/dist/ranking/mi/cosine.unit.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=cosine.unit.test.d.ts.map

package/dist/ranking/mi/cosine.unit.test.d.ts.map

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

package/dist/ranking/mi/hub-promoted.d.ts

@@ -0,0 +1,13 @@
+import { NodeId, NodeData, EdgeData, ReadableGraph } from '../../graph';
+import { MIConfig } from './types';
+/**
+ * Compute Hub Promoted index between neighbourhoods of two nodes.
+ *
+ * @param graph - Source graph
+ * @param source - Source node ID
+ * @param target - Target node ID
+ * @param config - Optional configuration
+ * @returns Hub Promoted index in [0, 1]
+ */
+export declare function hubPromoted<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, source: NodeId, target: NodeId, config?: MIConfig): number;
+//# sourceMappingURL=hub-promoted.d.ts.map

package/dist/ranking/mi/hub-promoted.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hub-promoted.d.ts","sourceRoot":"","sources":["../../../src/ranking/mi/hub-promoted.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAE7E,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAExC;;;;;;;;GAQG;AACH,wBAAgB,WAAW,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EACjE,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,MAAM,CAwBR"}

package/dist/ranking/mi/hub-promoted.unit.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=hub-promoted.unit.test.d.ts.map

package/dist/ranking/mi/hub-promoted.unit.test.d.ts.map

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

package/dist/ranking/mi/index.d.ts

@@ -9,6 +9,11 @@
 export * from './types';
 export * from './jaccard';
 export * from './adamic-adar';
+export * from './cosine';
+export * from './sorensen';
+export * from './resource-allocation';
+export * from './overlap-coefficient';
+export * from './hub-promoted';
 export * from './scale';
 export * from './skew';
 export * from './span';

package/dist/ranking/mi/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/ranking/mi/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,cAAc,SAAS,CAAC;AACxB,cAAc,WAAW,CAAC;AAC1B,cAAc,eAAe,CAAC;AAC9B,cAAc,SAAS,CAAC;AACxB,cAAc,QAAQ,CAAC;AACvB,cAAc,QAAQ,CAAC;AACvB,cAAc,QAAQ,CAAC;AACvB,cAAc,SAAS,CAAC;AACxB,cAAc,YAAY,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/ranking/mi/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,cAAc,SAAS,CAAC;AACxB,cAAc,WAAW,CAAC;AAC1B,cAAc,eAAe,CAAC;AAC9B,cAAc,UAAU,CAAC;AACzB,cAAc,YAAY,CAAC;AAC3B,cAAc,uBAAuB,CAAC;AACtC,cAAc,uBAAuB,CAAC;AACtC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,SAAS,CAAC;AACxB,cAAc,QAAQ,CAAC;AACvB,cAAc,QAAQ,CAAC;AACvB,cAAc,QAAQ,CAAC;AACvB,cAAc,SAAS,CAAC;AACxB,cAAc,YAAY,CAAC"}

package/dist/ranking/mi/overlap-coefficient.d.ts

@@ -0,0 +1,13 @@
+import { NodeId, NodeData, EdgeData, ReadableGraph } from '../../graph';
+import { MIConfig } from './types';
+/**
+ * Compute Overlap Coefficient between neighbourhoods of two nodes.
+ *
+ * @param graph - Source graph
+ * @param source - Source node ID
+ * @param target - Target node ID
+ * @param config - Optional configuration
+ * @returns Overlap Coefficient in [0, 1]
+ */
+export declare function overlapCoefficient<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, source: NodeId, target: NodeId, config?: MIConfig): number;
+//# sourceMappingURL=overlap-coefficient.d.ts.map

package/dist/ranking/mi/overlap-coefficient.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"overlap-coefficient.d.ts","sourceRoot":"","sources":["../../../src/ranking/mi/overlap-coefficient.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAE7E,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAExC;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EACxE,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,MAAM,CAsBR"}

package/dist/ranking/mi/overlap-coefficient.unit.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=overlap-coefficient.unit.test.d.ts.map

package/dist/ranking/mi/overlap-coefficient.unit.test.d.ts.map

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

package/dist/ranking/mi/resource-allocation.d.ts

@@ -0,0 +1,13 @@
+import { NodeId, NodeData, EdgeData, ReadableGraph } from '../../graph';
+import { MIConfig } from './types';
+/**
+ * Compute Resource Allocation index between neighbourhoods of two nodes.
+ *
+ * @param graph - Source graph
+ * @param source - Source node ID
+ * @param target - Target node ID
+ * @param config - Optional configuration
+ * @returns Resource Allocation index (normalised to [0, 1] if configured)
+ */
+export declare function resourceAllocation<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, source: NodeId, target: NodeId, config?: MIConfig): number;
+//# sourceMappingURL=resource-allocation.d.ts.map

package/dist/ranking/mi/resource-allocation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"resource-allocation.d.ts","sourceRoot":"","sources":["../../../src/ranking/mi/resource-allocation.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAE7E,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAExC;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EACxE,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,MAAM,CA+BR"}

package/dist/ranking/mi/resource-allocation.unit.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=resource-allocation.unit.test.d.ts.map

package/dist/ranking/mi/resource-allocation.unit.test.d.ts.map

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

package/dist/ranking/mi/sorensen.d.ts

@@ -0,0 +1,13 @@
+import { NodeId, NodeData, EdgeData, ReadableGraph } from '../../graph';
+import { MIConfig } from './types';
+/**
+ * Compute Sorensen-Dice similarity between neighbourhoods of two nodes.
+ *
+ * @param graph - Source graph
+ * @param source - Source node ID
+ * @param target - Target node ID
+ * @param config - Optional configuration
+ * @returns Sorensen-Dice coefficient in [0, 1]
+ */
+export declare function sorensen<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, source: NodeId, target: NodeId, config?: MIConfig): number;
+//# sourceMappingURL=sorensen.d.ts.map

package/dist/ranking/mi/sorensen.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sorensen.d.ts","sourceRoot":"","sources":["../../../src/ranking/mi/sorensen.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAE7E,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAExC;;;;;;;;GAQG;AACH,wBAAgB,QAAQ,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAC9D,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,MAAM,CAsBR"}

package/dist/ranking/mi/sorensen.unit.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=sorensen.unit.test.d.ts.map

package/dist/ranking/mi/sorensen.unit.test.d.ts.map

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

package/dist/ranking/mi/types.d.ts

@@ -11,7 +11,7 @@ export type MIFunction<N extends NodeData = NodeData, E extends EdgeData = EdgeD
 /**
  * Names of available MI variants.
  */
-export type MIVariantName = "jaccard" | "adamic-adar" | "scale" | "skew" | "span" | "etch" | "notch" | "adaptive";
+export type MIVariantName = "jaccard" | "adamic-adar" | "cosine" | "sorensen" | "resource-allocation" | "overlap-coefficient" | "hub-promoted" | "scale" | "skew" | "span" | "etch" | "notch" | "adaptive";
 /**
  * Configuration for MI computation.
  */

package/dist/ranking/mi/types.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/ranking/mi/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAE7E;;;;;;;GAOG;AACH,MAAM,MAAM,UAAU,CACrB,CAAC,SAAS,QAAQ,GAAG,QAAQ,EAC7B,CAAC,SAAS,QAAQ,GAAG,QAAQ,IAC1B,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,KAAK,MAAM,CAAC;AAE3E;;GAEG;AACH,MAAM,MAAM,aAAa,GACtB,SAAS,GACT,aAAa,GACb,OAAO,GACP,MAAM,GACN,MAAM,GACN,MAAM,GACN,OAAO,GACP,UAAU,CAAC;AAEd;;GAEG;AACH,MAAM,WAAW,QAAQ;IACxB,sCAAsC;IACtC,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAC1B,4CAA4C;IAC5C,QAAQ,CAAC,SAAS,CAAC,EAAE,OAAO,CAAC;CAC7B;AAED;;GAEG;AACH,MAAM,WAAW,gBAAiB,SAAQ,QAAQ;IACjD,mDAAmD;IACnD,QAAQ,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC;IACnC,4DAA4D;IAC5D,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAC;IAC/B,+CAA+C;IAC/C,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;CAChC"}
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/ranking/mi/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAE7E;;;;;;;GAOG;AACH,MAAM,MAAM,UAAU,CACrB,CAAC,SAAS,QAAQ,GAAG,QAAQ,EAC7B,CAAC,SAAS,QAAQ,GAAG,QAAQ,IAC1B,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,KAAK,MAAM,CAAC;AAE3E;;GAEG;AACH,MAAM,MAAM,aAAa,GACtB,SAAS,GACT,aAAa,GACb,QAAQ,GACR,UAAU,GACV,qBAAqB,GACrB,qBAAqB,GACrB,cAAc,GACd,OAAO,GACP,MAAM,GACN,MAAM,GACN,MAAM,GACN,OAAO,GACP,UAAU,CAAC;AAEd;;GAEG;AACH,MAAM,WAAW,QAAQ;IACxB,sCAAsC;IACtC,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAC1B,4CAA4C;IAC5C,QAAQ,CAAC,SAAS,CAAC,EAAE,OAAO,CAAC;CAC7B;AAED;;GAEG;AACH,MAAM,WAAW,gBAAiB,SAAQ,QAAQ;IACjD,mDAAmD;IACnD,QAAQ,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC;IACnC,4DAA4D;IAC5D,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAC;IAC/B,+CAA+C;IAC/C,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;CAChC"}

package/dist/schemas/graph.d.ts

@@ -79,7 +79,7 @@ export type Seed = z.infer<typeof Seed>;
  * Compute backend selection.
  */
 export declare const ComputeBackend: z.ZodUnion<readonly [z.ZodLiteral<"cpu">, z.ZodLiteral<"gpu">, z.ZodLiteral<"auto">]> & {
-    is(value: unknown): value is "cpu" | "gpu" | "auto";
+    is(value: unknown): value is "auto" | "cpu" | "gpu";
 };
 export type ComputeBackend = z.infer<typeof ComputeBackend>;
 //# sourceMappingURL=graph.d.ts.map

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "graphwise",
-  "version": "1.4.2",
+  "version": "1.5.0",
   "description": "Graph algorithms for citation network analysis - novel expansion, MI variants, and path ranking",
   "type": "module",
   "sideEffects": false,