graphwise 1.10.0 → 1.12.0

package/dist/seeds/index.js

@@ -1,397 +1,2 @@
-import { n as miniBatchKMeans, r as normaliseFeatures } from "../kmeans-DLrlrp6i.js";
-//#region src/seeds/grasp.ts
-/** Default configuration values */
-var DEFAULTS$1 = {
-	nClusters: 100,
-	pairsPerCluster: 10,
-	withinClusterRatio: .5,
-	sampleSize: 2e5,
-	rngSeed: 42,
-	pagerankIterations: 10
-};
-/**
-* Simple seeded pseudo-random number generator using mulberry32.
-*/
-function createRNG$1(seed) {
-	let state = seed >>> 0;
-	return () => {
-		state = state + 1831565813 >>> 0;
-		let t = Math.imul(state ^ state >>> 15, state | 1);
-		t = (t ^ t >>> 7) * (t | 1640531527);
-		return ((t ^ t >>> 14) >>> 0) / 4294967296;
-	};
-}
-/**
-* Reservoir sampling (Vitter's Algorithm R) for streaming node selection.
-*
-* Maintains a uniform sample of nodes as edges are streamed, without
-* requiring the full graph in memory.
-*/
-function reservoirSample(graph, sampleSize, rng) {
-	const reservoir = [];
-	const neighbourMap = /* @__PURE__ */ new Map();
-	const inReservoir = /* @__PURE__ */ new Set();
-	let nodesSeen = 0;
-	for (const edge of graph.edges()) {
-		const source = edge.source;
-		if (!inReservoir.has(source)) {
-			nodesSeen++;
-			if (reservoir.length < sampleSize) {
-				reservoir.push(source);
-				inReservoir.add(source);
-				neighbourMap.set(source, /* @__PURE__ */ new Set());
-			} else {
-				const j = Math.floor(rng() * nodesSeen);
-				if (j < sampleSize) {
-					const oldNode = reservoir[j];
-					if (oldNode !== void 0) {
-						inReservoir.delete(oldNode);
-						neighbourMap.delete(oldNode);
-					}
-					reservoir[j] = source;
-					inReservoir.add(source);
-					neighbourMap.set(source, /* @__PURE__ */ new Set());
-				}
-			}
-		}
-		const target = edge.target;
-		if (!inReservoir.has(target)) {
-			nodesSeen++;
-			if (reservoir.length < sampleSize) {
-				reservoir.push(target);
-				inReservoir.add(target);
-				neighbourMap.set(target, /* @__PURE__ */ new Set());
-			} else {
-				const j = Math.floor(rng() * nodesSeen);
-				if (j < sampleSize) {
-					const oldNode = reservoir[j];
-					if (oldNode !== void 0) {
-						inReservoir.delete(oldNode);
-						neighbourMap.delete(oldNode);
-					}
-					reservoir[j] = target;
-					inReservoir.add(target);
-					neighbourMap.set(target, /* @__PURE__ */ new Set());
-				}
-			}
-		}
-		if (inReservoir.has(source) && inReservoir.has(target)) {
-			const sourceNeighbours = neighbourMap.get(source);
-			const targetNeighbours = neighbourMap.get(target);
-			sourceNeighbours?.add(target);
-			targetNeighbours?.add(source);
-		}
-	}
-	return {
-		nodeIds: inReservoir,
-		neighbourMap
-	};
-}
-/**
-* Compute approximate PageRank scores using power iteration on the reservoir subgraph.
-*
-* This is an approximation since it only considers the sampled nodes and their
-* connections within the reservoir, not the full graph.
-*/
-function approximatePageRank(nodeIds, neighbourMap, iterations, dampingFactor = .85) {
-	const n = nodeIds.size;
-	if (n === 0) return /* @__PURE__ */ new Map();
-	const nodeIdList = [...nodeIds];
-	const nodeIndex = new Map(nodeIdList.map((id, i) => [id, i]));
-	const scores = new Float64Array(n).fill(1 / n);
-	const newScores = new Float64Array(n);
-	for (let iter = 0; iter < iterations; iter++) {
-		newScores.fill((1 - dampingFactor) / n);
-		for (let i = 0; i < n; i++) {
-			const nodeId = nodeIdList[i];
-			if (nodeId === void 0) continue;
-			const neighbours = neighbourMap.get(nodeId);
-			if (neighbours === void 0) continue;
-			const outDegree = neighbours.size;
-			if (outDegree === 0) continue;
-			const contribution = dampingFactor * (scores[i] ?? 0) / outDegree;
-			for (const neighbour of neighbours) {
-				const neighbourIdx = nodeIndex.get(neighbour);
-				if (neighbourIdx !== void 0) newScores[neighbourIdx] = (newScores[neighbourIdx] ?? 0) + contribution;
-			}
-		}
-		for (let i = 0; i < n; i++) scores[i] = newScores[i] ?? 0;
-	}
-	const result = /* @__PURE__ */ new Map();
-	for (let i = 0; i < n; i++) {
-		const nodeId = nodeIdList[i];
-		const score = scores[i];
-		if (nodeId !== void 0 && score !== void 0) result.set(nodeId, score);
-	}
-	return result;
-}
-/**
-* Compute structural features for sampled nodes.
-*
-* Features:
-* - f1: log(deg(v) + 1) — scale-normalised connectivity
-* - f2: clustering_coefficient(v) — local density
-* - f3: approx_pagerank(v) — positional importance
-*/
-function computeFeatures(graph, nodeIds, neighbourMap, pagerankScores) {
-	const features = [];
-	for (const nodeId of nodeIds) {
-		const degree = graph.degree(nodeId, "both");
-		const neighbours = neighbourMap.get(nodeId);
-		let clusteringCoef = 0;
-		if (neighbours !== void 0 && neighbours.size >= 2) {
-			let triangleCount = 0;
-			const neighbourList = [...neighbours];
-			for (let i = 0; i < neighbourList.length; i++) for (let j = i + 1; j < neighbourList.length; j++) {
-				const u = neighbourList[i];
-				const w = neighbourList[j];
-				if (u !== void 0 && w !== void 0) {
-					if (neighbourMap.get(u)?.has(w) === true) triangleCount++;
-				}
-			}
-			const possibleTriangles = degree * (degree - 1) / 2;
-			clusteringCoef = triangleCount / possibleTriangles;
-		}
-		const pagerank = pagerankScores.get(nodeId) ?? 0;
-		features.push({
-			nodeId,
-			f1: Math.log(degree + 1),
-			f2: clusteringCoef,
-			f3: pagerank
-		});
-	}
-	return features;
-}
-/**
-* Sample seed pairs from clusters.
-*
-* For each cluster, samples a mix of within-cluster and cross-cluster pairs.
-*/
-function samplePairs(features, clusterAssignments, nClusters, pairsPerCluster, withinClusterRatio, rng) {
-	const pairs = [];
-	const clusterNodes = /* @__PURE__ */ new Map();
-	for (const feature of features) {
-		const cluster = clusterAssignments.get(feature.nodeId);
-		if (cluster === void 0) continue;
-		let nodes = clusterNodes.get(cluster);
-		if (nodes === void 0) {
-			nodes = [];
-			clusterNodes.set(cluster, nodes);
-		}
-		nodes.push(feature);
-	}
-	const withinCount = Math.floor(pairsPerCluster * withinClusterRatio);
-	const crossCount = pairsPerCluster - withinCount;
-	for (let clusterIdx = 0; clusterIdx < nClusters; clusterIdx++) {
-		const nodes = clusterNodes.get(clusterIdx);
-		if (nodes === void 0 || nodes.length < 2) continue;
-		for (let i = 0; i < withinCount; i++) {
-			const idx1 = Math.floor(rng() * nodes.length);
-			let idx2 = Math.floor(rng() * nodes.length);
-			while (idx1 === idx2) idx2 = Math.floor(rng() * nodes.length);
-			const source = nodes[idx1];
-			const target = nodes[idx2];
-			if (source === void 0 || target === void 0) continue;
-			const distance = computeFeatureDistance(source, target);
-			pairs.push({
-				source: { id: source.nodeId },
-				target: { id: target.nodeId },
-				featureDistance: distance,
-				sameCluster: true,
-				sourceCluster: clusterIdx,
-				targetCluster: clusterIdx
-			});
-		}
-		for (let i = 0; i < crossCount; i++) {
-			const source = nodes[Math.floor(rng() * nodes.length)];
-			if (source === void 0) continue;
-			const otherClusterIdx = Math.floor(rng() * nClusters);
-			if (otherClusterIdx === clusterIdx) continue;
-			const otherNodes = clusterNodes.get(otherClusterIdx);
-			if (otherNodes === void 0 || otherNodes.length === 0) continue;
-			const target = otherNodes[Math.floor(rng() * otherNodes.length)];
-			if (target === void 0) continue;
-			const distance = computeFeatureDistance(source, target);
-			pairs.push({
-				source: { id: source.nodeId },
-				target: { id: target.nodeId },
-				featureDistance: distance,
-				sameCluster: false,
-				sourceCluster: clusterIdx,
-				targetCluster: otherClusterIdx
-			});
-		}
-	}
-	return pairs;
-}
-/**
-* Compute Euclidean distance between two feature vectors.
-*/
-function computeFeatureDistance(a, b) {
-	const d1 = a.f1 - b.f1;
-	const d2 = a.f2 - b.f2;
-	const d3 = a.f3 - b.f3;
-	return Math.sqrt(d1 * d1 + d2 * d2 + d3 * d3);
-}
-/**
-* GRASP — Graph-agnostic Representative Seed pAir Sampling.
-*
-* Selects structurally representative seed pairs without domain knowledge.
-* The algorithm streams edges, samples nodes via reservoir sampling, computes
-* structural features, clusters nodes, and samples pairs within/across clusters.
-*
-* @param graph - The graph to sample seeds from
-* @param options - Configuration options
-* @returns Sampled seed pairs with structural metadata
-*
-* @example
-* ```typescript
-* const graph = new AdjacencyMapGraph();
-* // ... populate graph ...
-*
-* const result = grasp(graph, {
-*   nClusters: 50,
-*   pairsPerCluster: 20,
-*   sampleSize: 100000,
-* });
-*
-* console.log(`Sampled ${result.pairs.length} pairs from ${result.sampledNodeCount} nodes`);
-* ```
-*/
-function grasp(graph, options = {}) {
-	const config = {
-		...DEFAULTS$1,
-		...options
-	};
-	const rng = createRNG$1(config.rngSeed);
-	const { nodeIds, neighbourMap } = reservoirSample(graph, config.sampleSize, rng);
-	let features = computeFeatures(graph, nodeIds, neighbourMap, approximatePageRank(nodeIds, neighbourMap, config.pagerankIterations));
-	if (features.length > 0) features = normaliseFeatures(features);
-	const k = Math.min(config.nClusters, features.length);
-	const kmeansResult = miniBatchKMeans(features, {
-		k,
-		seed: config.rngSeed,
-		maxIterations: 100
-	});
-	return {
-		pairs: samplePairs(features, kmeansResult.assignments, kmeansResult.k, config.pairsPerCluster, config.withinClusterRatio, rng),
-		nClusters: kmeansResult.k,
-		sampledNodeCount: nodeIds.size,
-		features,
-		clusterAssignments: kmeansResult.assignments
-	};
-}
-//#endregion
-//#region src/seeds/stratified.ts
-/** Default values */
-var DEFAULTS = {
-	pairsPerStratum: 10,
-	rngSeed: 42
-};
-/**
-* Simple seeded pseudo-random number generator using mulberry32.
-*/
-function createRNG(seed) {
-	let state = seed >>> 0;
-	return () => {
-		state = state + 1831565813 >>> 0;
-		let t = Math.imul(state ^ state >>> 15, state | 1);
-		t = (t ^ t >>> 7) * (t | 1640531527);
-		return ((t ^ t >>> 14) >>> 0) / 4294967296;
-	};
-}
-/**
-* Stratified seed selection algorithm.
-*
-* @param graph - The graph to sample seeds from
-* @param options - Configuration options including field classifier
-* @returns Stratified selection result
-*
-* @example
-* ```typescript
-* const graph = new AdjacencyMapGraph();
-* // ... populate graph ...
-*
-* const result = stratified(graph, {
-*   fieldClassifier: (node) => node.type === 'paper' ? 'computer-science' : undefined,
-*   pairsPerStratum: 20,
-* });
-*
-* for (const stratum of result.strata) {
-*   console.log(`${stratum.name}: ${stratum.pairs.length} pairs`);
-* }
-* ```
-*/
-function stratified(graph, options) {
-	const { fieldClassifier, pairsPerStratum = DEFAULTS.pairsPerStratum, rngSeed = DEFAULTS.rngSeed, customStrata } = options;
-	const rng = createRNG(rngSeed);
-	const strataDefinitions = customStrata ?? [];
-	const nodesWithFields = [];
-	for (const nodeId of graph.nodeIds()) {
-		const node = graph.getNode(nodeId);
-		if (node === void 0) continue;
-		const field = fieldClassifier(node.type !== void 0 ? {
-			id: nodeId,
-			type: node.type
-		} : { id: nodeId });
-		if (field === void 0) continue;
-		const nodeWithField = node.type !== void 0 ? {
-			id: nodeId,
-			type: node.type,
-			field
-		} : {
-			id: nodeId,
-			field
-		};
-		nodesWithFields.push(nodeWithField);
-	}
-	const errors = [];
-	const strataResults = [];
-	for (const stratum of strataDefinitions) {
-		const pairs = [];
-		const eligiblePairs = [];
-		for (let i = 0; i < nodesWithFields.length; i++) {
-			const source = nodesWithFields[i];
-			if (source === void 0) continue;
-			for (let j = i + 1; j < nodesWithFields.length; j++) {
-				if (j === i) continue;
-				const target = nodesWithFields[j];
-				if (target === void 0) continue;
-				if (stratum.predicate(source, target)) eligiblePairs.push({
-					source,
-					target
-				});
-			}
-		}
-		const numToSample = Math.min(pairsPerStratum, eligiblePairs.length);
-		for (let i = 0; i < numToSample; i++) {
-			const pair = eligiblePairs[Math.floor(rng() * eligiblePairs.length)];
-			if (pair === void 0) continue;
-			const sourceField = fieldClassifier(pair.source);
-			const targetField = fieldClassifier(pair.target);
-			pairs.push({
-				source: { id: pair.source.id },
-				target: { id: pair.target.id },
-				stratum: stratum.name,
-				sameField: sourceField === targetField
-			});
-		}
-		strataResults.push({
-			name: stratum.name,
-			pairs
-		});
-	}
-	for (const stratum of strataDefinitions) {
-		const result = strataResults.find((r) => r.name === stratum.name);
-		if (result === void 0 || result.pairs.length === 0) errors.push(/* @__PURE__ */ new Error(`No pairs found for stratum: ${stratum.name}`));
-	}
-	return {
-		strata: strataResults,
-		totalPairs: strataResults.reduce((sum, r) => sum + r.pairs.length, 0),
-		errors
-	};
-}
-//#endregion
-export { grasp, stratified };
-
-//# sourceMappingURL=index.js.map
+import { a as basil, c as grasp, i as brisk, l as crisp, n as prism, o as stride, r as omnia, s as spine, t as stratified, u as crest } from "../seeds-ihozTw4J.js";
+export { basil, brisk, crest, crisp, grasp, omnia, prism, spine, stratified, stride };

package/dist/seeds/omnia.d.ts

@@ -0,0 +1,12 @@
+import { ReadableGraph } from '../graph';
+import { EnsemblePair } from './hybrid-core';
+export interface OmniaOptions {
+    readonly nPairs?: number;
+    readonly rngSeed?: number;
+    readonly blindPriorityBias?: number;
+}
+export interface OmniaResult {
+    readonly pairs: readonly EnsemblePair[];
+}
+export declare function omnia(graph: ReadableGraph, options?: OmniaOptions): OmniaResult;
+//# sourceMappingURL=omnia.d.ts.map

package/dist/seeds/omnia.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"omnia.d.ts","sourceRoot":"","sources":["../../src/seeds/omnia.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AAI9C,OAAO,EAMN,KAAK,YAAY,EACjB,MAAM,eAAe,CAAC;AAIvB,MAAM,WAAW,YAAY;IAC5B,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,iBAAiB,CAAC,EAAE,MAAM,CAAC;CACpC;AAED,MAAM,WAAW,WAAW;IAC3B,QAAQ,CAAC,KAAK,EAAE,SAAS,YAAY,EAAE,CAAC;CACxC;AAQD,wBAAgB,KAAK,CACpB,KAAK,EAAE,aAAa,EACpB,OAAO,GAAE,YAAiB,GACxB,WAAW,CAqEb"}

package/dist/seeds/prism.d.ts

@@ -0,0 +1,12 @@
+import { ReadableGraph } from '../graph';
+import { EnsemblePair } from './hybrid-core';
+export interface PrismOptions {
+    readonly nPairs?: number;
+    readonly rngSeed?: number;
+    readonly blindPriorityBias?: number;
+}
+export interface PrismResult {
+    readonly pairs: readonly EnsemblePair[];
+}
+export declare function prism(graph: ReadableGraph, options?: PrismOptions): PrismResult;
+//# sourceMappingURL=prism.d.ts.map

package/dist/seeds/prism.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prism.d.ts","sourceRoot":"","sources":["../../src/seeds/prism.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AAI9C,OAAO,EAKN,KAAK,YAAY,EACjB,MAAM,eAAe,CAAC;AAIvB,MAAM,WAAW,YAAY;IAC5B,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,iBAAiB,CAAC,EAAE,MAAM,CAAC;CACpC;AAED,MAAM,WAAW,WAAW;IAC3B,QAAQ,CAAC,KAAK,EAAE,SAAS,YAAY,EAAE,CAAC;CACxC;AAQD,wBAAgB,KAAK,CACpB,KAAK,EAAE,aAAa,EACpB,OAAO,GAAE,YAAiB,GACxB,WAAW,CA+Db"}

package/dist/seeds/spine.d.ts

@@ -0,0 +1,50 @@
+import { ReadableGraph } from '../graph';
+import { Seed } from '../schemas/index';
+/**
+ * Configuration options for SPINE seed selection.
+ */
+export interface SpineOptions {
+    /** Number of seed pairs to select (default: 100) */
+    readonly nPairs?: number;
+    /** Random seed for reproducibility (default: 42) */
+    readonly rngSeed?: number;
+    /** Jaccard diversity threshold for greedy selection (default: 0.5) */
+    readonly diversityThreshold?: number;
+}
+/**
+ * A seed pair selected by SPINE with skewness metadata.
+ */
+export interface SpineSeedPair {
+    /** Source seed */
+    readonly source: Seed;
+    /** Target seed */
+    readonly target: Seed;
+    /** Skewness of source node's 2-hop degree distribution */
+    readonly sourceSkewness: number;
+    /** Skewness of target node's 2-hop degree distribution */
+    readonly targetSkewness: number;
+}
+/**
+ * Result of SPINE seed selection.
+ */
+export interface SpineResult {
+    /** Selected seed pairs */
+    readonly pairs: readonly SpineSeedPair[];
+    /** Skewness scores for all nodes */
+    readonly skewness: ReadonlyMap<string, number>;
+}
+/**
+ * SPINE — Structural Position-Informed Node Extraction.
+ *
+ * Computes 2-hop degree distribution skewness for each node. Nodes with
+ * high positive skewness have structurally diverse neighbours (hub-periphery
+ * mix), while nodes with low skewness have uniform neighbours. Pairs
+ * connecting high-skewness and low-skewness nodes explore structurally
+ * varied terrain.
+ *
+ * @param graph - The graph to sample seeds from
+ * @param options - Configuration options
+ * @returns Selected seed pairs with skewness metadata
+ */
+export declare function spine(graph: ReadableGraph, options?: SpineOptions): SpineResult;
+//# sourceMappingURL=spine.d.ts.map

package/dist/seeds/spine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"spine.d.ts","sourceRoot":"","sources":["../../src/seeds/spine.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAU,MAAM,UAAU,CAAC;AACtD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAE7C;;GAEG;AACH,MAAM,WAAW,YAAY;IAC5B,oDAAoD;IACpD,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,oDAAoD;IACpD,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAC1B,sEAAsE;IACtE,QAAQ,CAAC,kBAAkB,CAAC,EAAE,MAAM,CAAC;CACrC;AAED;;GAEG;AACH,MAAM,WAAW,aAAa;IAC7B,kBAAkB;IAClB,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC;IACtB,kBAAkB;IAClB,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC;IACtB,0DAA0D;IAC1D,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,0DAA0D;IAC1D,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;CAChC;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC3B,0BAA0B;IAC1B,QAAQ,CAAC,KAAK,EAAE,SAAS,aAAa,EAAE,CAAC;IACzC,oCAAoC;IACpC,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC/C;AA2DD;;;;;;;;;;;;GAYG;AACH,wBAAgB,KAAK,CACpB,KAAK,EAAE,aAAa,EACpB,OAAO,GAAE,YAAiB,GACxB,WAAW,CAqJb"}

package/dist/seeds/spine.unit.test.d.ts

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

package/dist/seeds/spine.unit.test.d.ts.map

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

package/dist/seeds/stride.d.ts

@@ -0,0 +1,55 @@
+import { ReadableGraph } from '../graph';
+import { Seed } from '../schemas/index';
+/**
+ * Configuration options for STRIDE seed selection.
+ */
+export interface StrideOptions {
+    /** Number of seed pairs to select (default: 100) */
+    readonly nPairs?: number;
+    /** Random seed for reproducibility (default: 42) */
+    readonly rngSeed?: number;
+    /** Jaccard diversity threshold for greedy selection (default: 0.5) */
+    readonly diversityThreshold?: number;
+}
+/**
+ * A seed pair selected by STRIDE with triad metadata.
+ */
+export interface StrideSeedPair {
+    /** Source seed */
+    readonly source: Seed;
+    /** Target seed */
+    readonly target: Seed;
+    /** Triad count of source node */
+    readonly sourceTriads: number;
+    /** Triad count of target node */
+    readonly targetTriads: number;
+    /** Category of source: "core" | "bridge" | "periphery" */
+    readonly sourceCategory: string;
+    /** Category of target: "core" | "bridge" | "periphery" */
+    readonly targetCategory: string;
+}
+/**
+ * Result of STRIDE seed selection.
+ */
+export interface StrideResult {
+    /** Selected seed pairs */
+    readonly pairs: readonly StrideSeedPair[];
+    /** Triad counts for all nodes */
+    readonly triadCounts: ReadonlyMap<string, number>;
+    /** Category assignments */
+    readonly categories: ReadonlyMap<string, string>;
+}
+/**
+ * STRIDE — Shortest-TRIangle Diversity seed selection.
+ *
+ * Nodes are categorised by local triad count into core, bridge, and
+ * periphery. Pairs spanning different categories capture structural
+ * diversity: core-periphery pairs traverse community interiors to
+ * boundaries, bridge-bridge pairs span community gaps.
+ *
+ * @param graph - The graph to sample seeds from
+ * @param options - Configuration options
+ * @returns Selected seed pairs with triad metadata
+ */
+export declare function stride(graph: ReadableGraph, options?: StrideOptions): StrideResult;
+//# sourceMappingURL=stride.d.ts.map

package/dist/seeds/stride.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"stride.d.ts","sourceRoot":"","sources":["../../src/seeds/stride.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAU,MAAM,UAAU,CAAC;AACtD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAE7C;;GAEG;AACH,MAAM,WAAW,aAAa;IAC7B,oDAAoD;IACpD,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,oDAAoD;IACpD,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAC1B,sEAAsE;IACtE,QAAQ,CAAC,kBAAkB,CAAC,EAAE,MAAM,CAAC;CACrC;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC9B,kBAAkB;IAClB,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC;IACtB,kBAAkB;IAClB,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC;IACtB,iCAAiC;IACjC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,iCAAiC;IACjC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,0DAA0D;IAC1D,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,0DAA0D;IAC1D,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;CAChC;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC5B,0BAA0B;IAC1B,QAAQ,CAAC,KAAK,EAAE,SAAS,cAAc,EAAE,CAAC;IAC1C,iCAAiC;IACjC,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAClD,2BAA2B;IAC3B,QAAQ,CAAC,UAAU,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACjD;AAqED;;;;;;;;;;;GAWG;AACH,wBAAgB,MAAM,CACrB,KAAK,EAAE,aAAa,EACpB,OAAO,GAAE,aAAkB,GACzB,YAAY,CAkJd"}

package/dist/seeds/stride.unit.test.d.ts

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

package/dist/seeds/stride.unit.test.d.ts.map

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