graphwise 1.7.0 → 1.8.0

package/dist/index.d.ts

@@ -12,4 +12,5 @@ export * from './seeds';
 export * from './extraction';
 export * from './utils';
 export * from './gpu';
+export * from './async';
 //# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,cAAc,SAAS,CAAC;AAGxB,cAAc,aAAa,CAAC;AAG5B,cAAc,cAAc,CAAC;AAG7B,cAAc,aAAa,CAAC;AAG5B,cAAc,WAAW,CAAC;AAG1B,cAAc,SAAS,CAAC;AAGxB,cAAc,cAAc,CAAC;AAG7B,cAAc,SAAS,CAAC;AAGxB,cAAc,OAAO,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,cAAc,SAAS,CAAC;AAGxB,cAAc,aAAa,CAAC;AAG5B,cAAc,cAAc,CAAC;AAG7B,cAAc,aAAa,CAAC;AAG5B,cAAc,WAAW,CAAC;AAG1B,cAAc,SAAS,CAAC;AAGxB,cAAc,cAAc,CAAC;AAG7B,cAAc,SAAS,CAAC;AAGxB,cAAc,OAAO,CAAC;AAGtB,cAAc,SAAS,CAAC"}

package/dist/ranking/mi/adamic-adar.d.ts

@@ -1,4 +1,5 @@
 import { NodeId, NodeData, EdgeData, ReadableGraph } from '../../graph';
+import { AsyncReadableGraph } from '../../graph/async-interfaces';
 import { MIConfig } from './types';
 /**
  * Compute Adamic-Adar index between neighbourhoods of two nodes.
@@ -10,4 +11,11 @@ import { MIConfig } from './types';
  * @returns Adamic-Adar index (normalised to [0, 1] if configured)
  */
 export declare function adamicAdar<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, source: NodeId, target: NodeId, config?: MIConfig): number;
+/**
+ * Async variant of Adamic-Adar index for use with async graph data sources.
+ *
+ * Fetches both neighbourhoods concurrently, then fetches degree for each common
+ * neighbour to compute the inverse-log-degree weighted sum.
+ */
+export declare function adamicAdarAsync<N extends NodeData, E extends EdgeData>(graph: AsyncReadableGraph<N, E>, source: NodeId, target: NodeId, config?: MIConfig): Promise<number>;
 //# sourceMappingURL=adamic-adar.d.ts.map

package/dist/ranking/mi/adamic-adar.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"adamic-adar.d.ts","sourceRoot":"","sources":["../../../src/ranking/mi/adamic-adar.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,UAAU,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAChE,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,MAAM,CA8BR"}
+{"version":3,"file":"adamic-adar.d.ts","sourceRoot":"","sources":["../../../src/ranking/mi/adamic-adar.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC7E,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAGvE,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAExC;;;;;;;;GAQG;AACH,wBAAgB,UAAU,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAChE,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,MAAM,CA8BR;AAED;;;;;GAKG;AACH,wBAAsB,eAAe,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAC3E,KAAK,EAAE,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,EAC/B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,OAAO,CAAC,MAAM,CAAC,CA0CjB"}

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

@@ -1,4 +1,5 @@
 import { NodeId, NodeData, EdgeData, ReadableGraph } from '../../graph';
+import { AsyncReadableGraph } from '../../graph/async-interfaces';
 import { AdaptiveMIConfig } from './types';
 /**
  * Compute unified adaptive MI between two connected nodes.
@@ -13,4 +14,11 @@ import { AdaptiveMIConfig } from './types';
  * @returns Adaptive MI score in [0, 1]
  */
 export declare function adaptive<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, source: NodeId, target: NodeId, config?: AdaptiveMIConfig): number;
+/**
+ * Async variant of Adaptive MI for use with async graph data sources.
+ *
+ * Fetches both neighbourhoods concurrently, then delegates degree-weighted
+ * component to the async Adamic-Adar variant.
+ */
+export declare function adaptiveAsync<N extends NodeData, E extends EdgeData>(graph: AsyncReadableGraph<N, E>, source: NodeId, target: NodeId, config?: AdaptiveMIConfig): Promise<number>;
 //# sourceMappingURL=adaptive.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"adaptive.d.ts","sourceRoot":"","sources":["../../../src/ranking/mi/adaptive.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAE7E,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,SAAS,CAAC;AAGhD;;;;;;;;;;;GAWG;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,gBAAgB,GACvB,MAAM,CAoDR"}
+{"version":3,"file":"adaptive.d.ts","sourceRoot":"","sources":["../../../src/ranking/mi/adaptive.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC7E,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAGvE,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,SAAS,CAAC;AAIhD;;;;;;;;;;;GAWG;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,gBAAgB,GACvB,MAAM,CAoDR;AAED;;;;;GAKG;AACH,wBAAsB,aAAa,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EACzE,KAAK,EAAE,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,EAC/B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,gBAAgB,GACvB,OAAO,CAAC,MAAM,CAAC,CAoDjB"}

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

@@ -1,4 +1,5 @@
 import { NodeId, NodeData, EdgeData, ReadableGraph } from '../../graph';
+import { AsyncReadableGraph } from '../../graph/async-interfaces';
 import { MIConfig } from './types';
 /**
  * Compute cosine similarity between neighbourhoods of two nodes.
@@ -10,4 +11,10 @@ import { MIConfig } from './types';
  * @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;
+/**
+ * Async variant of cosine similarity for use with async graph data sources.
+ *
+ * Fetches both neighbourhoods concurrently, then applies the same formula.
+ */
+export declare function cosineAsync<N extends NodeData, E extends EdgeData>(graph: AsyncReadableGraph<N, E>, source: NodeId, target: NodeId, config?: MIConfig): Promise<number>;
 //# sourceMappingURL=cosine.d.ts.map

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

@@ -1 +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"}
+{"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;AAC7E,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAGvE,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;AAED;;;;GAIG;AACH,wBAAsB,WAAW,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EACvE,KAAK,EAAE,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,EAC/B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,OAAO,CAAC,MAAM,CAAC,CA6BjB"}

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

@@ -1,7 +1,15 @@
 import { NodeId, NodeData, EdgeData, ReadableGraph } from '../../graph';
+import { AsyncReadableGraph } from '../../graph/async-interfaces';
 import { MIConfig } from './types';
 /**
  * Compute ETCH MI between two nodes.
  */
 export declare function etch<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, source: NodeId, target: NodeId, config?: MIConfig): number;
+/**
+ * Async variant of ETCH MI for use with async graph data sources.
+ *
+ * Fetches both neighbourhoods and edge data concurrently, then counts
+ * edges of the same type by iterating the async edge stream.
+ */
+export declare function etchAsync<N extends NodeData, E extends EdgeData>(graph: AsyncReadableGraph<N, E>, source: NodeId, target: NodeId, config?: MIConfig): Promise<number>;
 //# sourceMappingURL=etch.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"etch.d.ts","sourceRoot":"","sources":["../../../src/ranking/mi/etch.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;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;;GAEG;AACH,wBAAgB,IAAI,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAC1D,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,MAAM,CA0BR"}
+{"version":3,"file":"etch.d.ts","sourceRoot":"","sources":["../../../src/ranking/mi/etch.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC7E,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAGvE,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAExC;;GAEG;AACH,wBAAgB,IAAI,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAC1D,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,MAAM,CA0BR;AAED;;;;;GAKG;AACH,wBAAsB,SAAS,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EACrE,KAAK,EAAE,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,EAC/B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,OAAO,CAAC,MAAM,CAAC,CA6CjB"}

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

@@ -1,4 +1,5 @@
 import { NodeId, NodeData, EdgeData, ReadableGraph } from '../../graph';
+import { AsyncReadableGraph } from '../../graph/async-interfaces';
 import { MIConfig } from './types';
 /**
  * Compute Hub Promoted index between neighbourhoods of two nodes.
@@ -10,4 +11,10 @@ import { MIConfig } from './types';
  * @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;
+/**
+ * Async variant of Hub Promoted index for use with async graph data sources.
+ *
+ * Fetches both neighbourhoods and degrees concurrently, then applies the same formula.
+ */
+export declare function hubPromotedAsync<N extends NodeData, E extends EdgeData>(graph: AsyncReadableGraph<N, E>, source: NodeId, target: NodeId, config?: MIConfig): Promise<number>;
 //# sourceMappingURL=hub-promoted.d.ts.map

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

@@ -1 +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"}
+{"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;AAC7E,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAGvE,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;AAED;;;;GAIG;AACH,wBAAsB,gBAAgB,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAC5E,KAAK,EAAE,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,EAC/B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,OAAO,CAAC,MAAM,CAAC,CA+BjB"}

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

@@ -1,4 +1,5 @@
 import { NodeId, NodeData, EdgeData, ReadableGraph } from '../../graph';
+import { AsyncReadableGraph } from '../../graph/async-interfaces';
 import { MIConfig } from './types';
 /**
  * Compute Jaccard similarity between neighbourhoods of two nodes.
@@ -10,4 +11,10 @@ import { MIConfig } from './types';
  * @returns Jaccard coefficient in [0, 1]
  */
 export declare function jaccard<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, source: NodeId, target: NodeId, config?: MIConfig): number;
+/**
+ * Async variant of Jaccard similarity for use with async graph data sources.
+ *
+ * Fetches both neighbourhoods concurrently, then applies the same formula.
+ */
+export declare function jaccardAsync<N extends NodeData, E extends EdgeData>(graph: AsyncReadableGraph<N, E>, source: NodeId, target: NodeId, config?: MIConfig): Promise<number>;
 //# sourceMappingURL=jaccard.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"jaccard.d.ts","sourceRoot":"","sources":["../../../src/ranking/mi/jaccard.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,OAAO,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAC7D,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,MAAM,CAgBR"}
+{"version":3,"file":"jaccard.d.ts","sourceRoot":"","sources":["../../../src/ranking/mi/jaccard.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC7E,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAGvE,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAExC;;;;;;;;GAQG;AACH,wBAAgB,OAAO,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAC7D,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,MAAM,CAgBR;AAED;;;;GAIG;AACH,wBAAsB,YAAY,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EACxE,KAAK,EAAE,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,EAC/B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,OAAO,CAAC,MAAM,CAAC,CA2BjB"}

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

@@ -1,7 +1,15 @@
 import { NodeId, NodeData, EdgeData, ReadableGraph } from '../../graph';
+import { AsyncReadableGraph } from '../../graph/async-interfaces';
 import { MIConfig } from './types';
 /**
  * Compute NOTCH MI between two nodes.
  */
 export declare function notch<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, source: NodeId, target: NodeId, config?: MIConfig): number;
+/**
+ * Async variant of NOTCH MI for use with async graph data sources.
+ *
+ * Fetches both neighbourhoods and node data concurrently, then counts
+ * nodes of each type by iterating the async node stream.
+ */
+export declare function notchAsync<N extends NodeData, E extends EdgeData>(graph: AsyncReadableGraph<N, E>, source: NodeId, target: NodeId, config?: MIConfig): Promise<number>;
 //# sourceMappingURL=notch.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"notch.d.ts","sourceRoot":"","sources":["../../../src/ranking/mi/notch.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;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;;GAEG;AACH,wBAAgB,KAAK,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAC3D,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,MAAM,CA8BR"}
+{"version":3,"file":"notch.d.ts","sourceRoot":"","sources":["../../../src/ranking/mi/notch.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC7E,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAGvE,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAExC;;GAEG;AACH,wBAAgB,KAAK,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAC3D,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,MAAM,CA8BR;AAED;;;;;GAKG;AACH,wBAAsB,UAAU,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EACtE,KAAK,EAAE,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,EAC/B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,OAAO,CAAC,MAAM,CAAC,CAoDjB"}

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

@@ -1,4 +1,5 @@
 import { NodeId, NodeData, EdgeData, ReadableGraph } from '../../graph';
+import { AsyncReadableGraph } from '../../graph/async-interfaces';
 import { MIConfig } from './types';
 /**
  * Compute Overlap Coefficient between neighbourhoods of two nodes.
@@ -10,4 +11,10 @@ import { MIConfig } from './types';
  * @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;
+/**
+ * Async variant of Overlap Coefficient for use with async graph data sources.
+ *
+ * Fetches both neighbourhoods concurrently, then applies the same formula.
+ */
+export declare function overlapCoefficientAsync<N extends NodeData, E extends EdgeData>(graph: AsyncReadableGraph<N, E>, source: NodeId, target: NodeId, config?: MIConfig): Promise<number>;
 //# sourceMappingURL=overlap-coefficient.d.ts.map

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

@@ -1 +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"}
+{"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;AAC7E,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAGvE,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;AAED;;;;GAIG;AACH,wBAAsB,uBAAuB,CAC5C,CAAC,SAAS,QAAQ,EAClB,CAAC,SAAS,QAAQ,EAElB,KAAK,EAAE,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,EAC/B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,OAAO,CAAC,MAAM,CAAC,CA6BjB"}

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

@@ -1,4 +1,5 @@
 import { NodeId, NodeData, EdgeData, ReadableGraph } from '../../graph';
+import { AsyncReadableGraph } from '../../graph/async-interfaces';
 import { MIConfig } from './types';
 /**
  * Compute Resource Allocation index between neighbourhoods of two nodes.
@@ -10,4 +11,11 @@ import { MIConfig } from './types';
  * @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;
+/**
+ * Async variant of Resource Allocation index for use with async graph data sources.
+ *
+ * Fetches both neighbourhoods concurrently, then fetches degree for each common
+ * neighbour to compute the inverse-degree weighted sum.
+ */
+export declare function resourceAllocationAsync<N extends NodeData, E extends EdgeData>(graph: AsyncReadableGraph<N, E>, source: NodeId, target: NodeId, config?: MIConfig): Promise<number>;
 //# sourceMappingURL=resource-allocation.d.ts.map

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

@@ -1 +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"}
+{"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;AAC7E,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAGvE,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;AAED;;;;;GAKG;AACH,wBAAsB,uBAAuB,CAC5C,CAAC,SAAS,QAAQ,EAClB,CAAC,SAAS,QAAQ,EAElB,KAAK,EAAE,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,EAC/B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,OAAO,CAAC,MAAM,CAAC,CA2CjB"}

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

@@ -1,7 +1,14 @@
 import { NodeId, NodeData, EdgeData, ReadableGraph } from '../../graph';
+import { AsyncReadableGraph } from '../../graph/async-interfaces';
 import { MIConfig } from './types';
 /**
  * Compute SCALE MI between two nodes.
  */
 export declare function scale<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, source: NodeId, target: NodeId, config?: MIConfig): number;
+/**
+ * Async variant of SCALE MI for use with async graph data sources.
+ *
+ * Fetches both neighbourhoods, node count, and edge count concurrently.
+ */
+export declare function scaleAsync<N extends NodeData, E extends EdgeData>(graph: AsyncReadableGraph<N, E>, source: NodeId, target: NodeId, config?: MIConfig): Promise<number>;
 //# sourceMappingURL=scale.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"scale.d.ts","sourceRoot":"","sources":["../../../src/ranking/mi/scale.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;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;;GAEG;AACH,wBAAgB,KAAK,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAC3D,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,MAAM,CAuBR"}
+{"version":3,"file":"scale.d.ts","sourceRoot":"","sources":["../../../src/ranking/mi/scale.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC7E,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAGvE,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAExC;;GAEG;AACH,wBAAgB,KAAK,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAC3D,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,MAAM,CAuBR;AAED;;;;GAIG;AACH,wBAAsB,UAAU,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EACtE,KAAK,EAAE,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,EAC/B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,OAAO,CAAC,MAAM,CAAC,CAoCjB"}

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

@@ -1,7 +1,14 @@
 import { NodeId, NodeData, EdgeData, ReadableGraph } from '../../graph';
+import { AsyncReadableGraph } from '../../graph/async-interfaces';
 import { MIConfig } from './types';
 /**
  * Compute SKEW MI between two nodes.
  */
 export declare function skew<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, source: NodeId, target: NodeId, config?: MIConfig): number;
+/**
+ * Async variant of SKEW MI for use with async graph data sources.
+ *
+ * Fetches both neighbourhoods, degrees, and node count concurrently.
+ */
+export declare function skewAsync<N extends NodeData, E extends EdgeData>(graph: AsyncReadableGraph<N, E>, source: NodeId, target: NodeId, config?: MIConfig): Promise<number>;
 //# sourceMappingURL=skew.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"skew.d.ts","sourceRoot":"","sources":["../../../src/ranking/mi/skew.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;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;;GAEG;AACH,wBAAgB,IAAI,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAC1D,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,MAAM,CAiBR"}
+{"version":3,"file":"skew.d.ts","sourceRoot":"","sources":["../../../src/ranking/mi/skew.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC7E,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAGvE,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAExC;;GAEG;AACH,wBAAgB,IAAI,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAC1D,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,MAAM,CAiBR;AAED;;;;GAIG;AACH,wBAAsB,SAAS,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EACrE,KAAK,EAAE,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,EAC/B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,OAAO,CAAC,MAAM,CAAC,CA+BjB"}

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

@@ -1,4 +1,5 @@
 import { NodeId, NodeData, EdgeData, ReadableGraph } from '../../graph';
+import { AsyncReadableGraph } from '../../graph/async-interfaces';
 import { MIConfig } from './types';
 /**
  * Compute Sorensen-Dice similarity between neighbourhoods of two nodes.
@@ -10,4 +11,10 @@ import { MIConfig } from './types';
  * @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;
+/**
+ * Async variant of Sorensen-Dice coefficient for use with async graph data sources.
+ *
+ * Fetches both neighbourhoods concurrently, then applies the same formula.
+ */
+export declare function sorensenAsync<N extends NodeData, E extends EdgeData>(graph: AsyncReadableGraph<N, E>, source: NodeId, target: NodeId, config?: MIConfig): Promise<number>;
 //# sourceMappingURL=sorensen.d.ts.map

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

@@ -1 +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"}
+{"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;AAC7E,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAGvE,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;AAED;;;;GAIG;AACH,wBAAsB,aAAa,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EACzE,KAAK,EAAE,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,EAC/B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,OAAO,CAAC,MAAM,CAAC,CA6BjB"}

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

@@ -1,7 +1,15 @@
 import { NodeId, NodeData, EdgeData, ReadableGraph } from '../../graph';
+import { AsyncReadableGraph } from '../../graph/async-interfaces';
 import { MIConfig } from './types';
 /**
  * Compute SPAN MI between two nodes.
  */
 export declare function span<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, source: NodeId, target: NodeId, config?: MIConfig): number;
+/**
+ * Async variant of SPAN MI for use with async graph data sources.
+ *
+ * Fetches both neighbourhoods concurrently, then computes the clustering
+ * coefficient for each endpoint from the collected neighbour arrays.
+ */
+export declare function spanAsync<N extends NodeData, E extends EdgeData>(graph: AsyncReadableGraph<N, E>, source: NodeId, target: NodeId, config?: MIConfig): Promise<number>;
 //# sourceMappingURL=span.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"span.d.ts","sourceRoot":"","sources":["../../../src/ranking/mi/span.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAG7E,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAExC;;GAEG;AACH,wBAAgB,IAAI,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAC1D,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,MAAM,CAgBR"}
+{"version":3,"file":"span.d.ts","sourceRoot":"","sources":["../../../src/ranking/mi/span.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC7E,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAIvE,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAExC;;GAEG;AACH,wBAAgB,IAAI,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAC1D,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,MAAM,CAgBR;AAED;;;;;GAKG;AACH,wBAAsB,SAAS,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EACrE,KAAK,EAAE,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,EAC/B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,GACf,OAAO,CAAC,MAAM,CAAC,CAwEjB"}

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

@@ -1,4 +1,5 @@
 import { NodeId, NodeData, EdgeData, ReadableGraph } from '../../graph';
+import { AsyncReadableGraph } from '../../graph/async-interfaces';
 /**
  * MI function computes association strength between connected nodes.
  *
@@ -8,6 +9,17 @@ import { NodeId, NodeData, EdgeData, ReadableGraph } from '../../graph';
  * @returns MI score in [0, 1] range (0 = no association, 1 = perfect)
  */
 export type MIFunction<N extends NodeData = NodeData, E extends EdgeData = EdgeData> = (graph: ReadableGraph<N, E>, source: NodeId, target: NodeId) => number;
+/**
+ * Async MI function computes association strength between connected nodes
+ * on an async graph data source.
+ *
+ * @param graph - Async source graph
+ * @param source - Source node ID
+ * @param target - Target node ID
+ * @param config - Optional configuration
+ * @returns Promise of MI score in [0, 1] range (0 = no association, 1 = perfect)
+ */
+export type AsyncMIFunction<N extends NodeData = NodeData, E extends EdgeData = EdgeData> = (graph: AsyncReadableGraph<N, E>, source: NodeId, target: NodeId, config?: MIConfig) => Promise<number>;
 /**
  * Names of available MI variants.
  */

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,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"}
+{"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;AAC7E,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAEvE;;;;;;;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;;;;;;;;;GASG;AACH,MAAM,MAAM,eAAe,CAC1B,CAAC,SAAS,QAAQ,GAAG,QAAQ,EAC7B,CAAC,SAAS,QAAQ,GAAG,QAAQ,IAC1B,CACH,KAAK,EAAE,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,EAC/B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,QAAQ,KACb,OAAO,CAAC,MAAM,CAAC,CAAC;AAErB;;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/ranking/parse.d.ts

@@ -1,6 +1,7 @@
 import { NodeData, EdgeData, ReadableGraph } from '../graph';
+import { AsyncReadableGraph } from '../graph/async-interfaces';
 import { ExpansionPath } from '../expansion/types';
-import { MIFunction } from './mi/types';
+import { MIFunction, AsyncMIFunction } from './mi/types';
 /**
  * Configuration for PARSE ranking.
  */
@@ -53,4 +54,26 @@ export interface PARSEResult {
  * @returns Ranked paths with statistics
  */
 export declare function parse<N extends NodeData, E extends EdgeData>(graph: ReadableGraph<N, E>, paths: readonly ExpansionPath[], config?: PARSEConfig<N, E>): PARSEResult;
+/**
+ * Configuration for async PARSE ranking.
+ */
+export interface AsyncPARSEConfig<N extends NodeData = NodeData, E extends EdgeData = EdgeData> {
+    /** Async MI function to use (default: jaccardAsync) */
+    readonly mi?: AsyncMIFunction<N, E>;
+    /** Minimum epsilon for MI (default: 1e-10) */
+    readonly epsilon?: number;
+}
+/**
+ * Rank paths using async PARSE (Path-Aware Ranking via Salience Estimation).
+ *
+ * Async variant suitable for use with remote or lazy graph data sources.
+ * Computes geometric mean of edge MI scores for each path using Promise.all
+ * for parallelism, then sorts by salience (highest first).
+ *
+ * @param graph - Async source graph
+ * @param paths - Paths to rank
+ * @param config - Configuration options
+ * @returns Ranked paths with statistics
+ */
+export declare function parseAsync<N extends NodeData, E extends EdgeData>(graph: AsyncReadableGraph<N, E>, paths: readonly ExpansionPath[], config?: AsyncPARSEConfig<N, E>): Promise<PARSEResult>;
 //# sourceMappingURL=parse.d.ts.map

package/dist/ranking/parse.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"parse.d.ts","sourceRoot":"","sources":["../../src/ranking/parse.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AAClE,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACxD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAG7C;;GAEG;AACH,MAAM,WAAW,WAAW,CAC3B,CAAC,SAAS,QAAQ,GAAG,QAAQ,EAC7B,CAAC,SAAS,QAAQ,GAAG,QAAQ;IAE7B,4CAA4C;IAC5C,QAAQ,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/B,8CAA8C;IAC9C,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAC1B,mEAAmE;IACnE,QAAQ,CAAC,eAAe,CAAC,EAAE,OAAO,CAAC;CACnC;AAED;;GAEG;AACH,MAAM,WAAW,UAAW,SAAQ,aAAa;IAChD,iDAAiD;IACjD,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC1B;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC3B,+CAA+C;IAC/C,QAAQ,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,CAAC;IACtC,yBAAyB;IACzB,QAAQ,CAAC,KAAK,EAAE;QACf,yBAAyB;QACzB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;QAC7B,oBAAoB;QACpB,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;QAC9B,sBAAsB;QACtB,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;QAChC,uBAAuB;QACvB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;QAC7B,uBAAuB;QACvB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;QAC7B,uCAAuC;QACvC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;KAC5B,CAAC;CACF;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,KAAK,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAC3D,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,KAAK,EAAE,SAAS,aAAa,EAAE,EAC/B,MAAM,CAAC,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,GACxB,WAAW,CAoDb"}
+{"version":3,"file":"parse.d.ts","sourceRoot":"","sources":["../../src/ranking/parse.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;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,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACxD,OAAO,KAAK,EAAE,UAAU,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAI9D;;GAEG;AACH,MAAM,WAAW,WAAW,CAC3B,CAAC,SAAS,QAAQ,GAAG,QAAQ,EAC7B,CAAC,SAAS,QAAQ,GAAG,QAAQ;IAE7B,4CAA4C;IAC5C,QAAQ,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/B,8CAA8C;IAC9C,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAC1B,mEAAmE;IACnE,QAAQ,CAAC,eAAe,CAAC,EAAE,OAAO,CAAC;CACnC;AAED;;GAEG;AACH,MAAM,WAAW,UAAW,SAAQ,aAAa;IAChD,iDAAiD;IACjD,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC1B;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC3B,+CAA+C;IAC/C,QAAQ,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,CAAC;IACtC,yBAAyB;IACzB,QAAQ,CAAC,KAAK,EAAE;QACf,yBAAyB;QACzB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;QAC7B,oBAAoB;QACpB,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;QAC9B,sBAAsB;QACtB,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;QAChC,uBAAuB;QACvB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;QAC7B,uBAAuB;QACvB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;QAC7B,uCAAuC;QACvC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;KAC5B,CAAC;CACF;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,KAAK,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EAC3D,KAAK,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,KAAK,EAAE,SAAS,aAAa,EAAE,EAC/B,MAAM,CAAC,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,GACxB,WAAW,CAoDb;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB,CAChC,CAAC,SAAS,QAAQ,GAAG,QAAQ,EAC7B,CAAC,SAAS,QAAQ,GAAG,QAAQ;IAE7B,uDAAuD;IACvD,QAAQ,CAAC,EAAE,CAAC,EAAE,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpC,8CAA8C;IAC9C,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED;;;;;;;;;;;GAWG;AACH,wBAAsB,UAAU,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,SAAS,QAAQ,EACtE,KAAK,EAAE,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,EAC/B,KAAK,EAAE,SAAS,aAAa,EAAE,EAC/B,MAAM,CAAC,EAAE,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,GAC7B,OAAO,CAAC,WAAW,CAAC,CAoDtB"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "graphwise",
-  "version": "1.7.0",
+  "version": "1.8.0",
   "description": "Graph algorithms for citation network analysis - novel expansion, MI variants, and path ranking",
   "type": "module",
   "sideEffects": false,
@@ -67,6 +67,11 @@
       "types": "./dist/schemas/index.d.ts",
       "import": "./dist/schemas/index.js",
       "require": "./dist/schemas/index.cjs"
+    },
+    "./async": {
+      "types": "./dist/async/index.d.ts",
+      "import": "./dist/async/index.js",
+      "require": "./dist/async/index.cjs"
     }
   },
   "files": [