graphwise 1.1.1 → 1.3.0

package/dist/graph-az06J1YV.cjs

@@ -1,227 +0,0 @@
-//#region src/graph/adjacency-map.ts
-/**
-* Graph implementation using adjacency map data structure.
-*
-* Uses Map<NodeId, N> for node storage and Map<NodeId, Map<NodeId, E>>
-* for adjacency representation. This provides O(1) average-case lookup
-* for nodes and edges, with memory proportional to V + E.
-*
-* @typeParam N - Node data type, must extend NodeData
-* @typeParam E - Edge data type, must extend EdgeData
-*
-* @example
-* ```typescript
-* // Create a directed citation graph
-* const graph = AdjacencyMapGraph.directed<AuthorNode, CitationEdge>()
-*   .addNode({ id: 'A1', name: 'Alice' })
-*   .addNode({ id: 'B1', name: 'Bob' })
-*   .addEdge({ source: 'A1', target: 'B1', year: 2024 });
-* ```
-*/
-var AdjacencyMapGraph = class AdjacencyMapGraph {
-	directed;
-	nodes;
-	adjacency;
-	reverseAdjacency;
-	_edgeCount;
-	constructor(directed) {
-		this.directed = directed;
-		this.nodes = /* @__PURE__ */ new Map();
-		this.adjacency = /* @__PURE__ */ new Map();
-		this.reverseAdjacency = directed ? /* @__PURE__ */ new Map() : null;
-		this._edgeCount = 0;
-	}
-	/**
-	* Create a new directed graph.
-	*
-	* In a directed graph, edges have direction from source to target.
-	* The `neighbours` method with direction 'out' returns successors,
-	* and direction 'in' returns predecessors.
-	*
-	* @typeParam N - Node data type
-	* @typeParam E - Edge data type
-	* @returns A new empty directed graph
-	*/
-	static directed() {
-		return new AdjacencyMapGraph(true);
-	}
-	/**
-	* Create a new undirected graph.
-	*
-	* In an undirected graph, edges have no direction. Adding an edge
-	* from A to B automatically creates the connection from B to A.
-	*
-	* @typeParam N - Node data type
-	* @typeParam E - Edge data type
-	* @returns A new empty undirected graph
-	*/
-	static undirected() {
-		return new AdjacencyMapGraph(false);
-	}
-	get nodeCount() {
-		return this.nodes.size;
-	}
-	get edgeCount() {
-		return this._edgeCount;
-	}
-	hasNode(id) {
-		return this.nodes.has(id);
-	}
-	getNode(id) {
-		return this.nodes.get(id);
-	}
-	/**
-	* Iterate over all node identifiers in the graph.
-	*
-	* @returns An iterable of all node IDs
-	*/
-	*nodeIds() {
-		yield* this.nodes.keys();
-	}
-	neighbours(id, direction = "out") {
-		if (!this.nodes.has(id)) return [];
-		if (this.directed) {
-			if (direction === "out") return this.adjacency.get(id)?.keys() ?? [];
-			if (direction === "in") return this.reverseAdjacency?.get(id)?.keys() ?? [];
-			return this.iterateBothDirections(id);
-		}
-		return this.adjacency.get(id)?.keys() ?? [];
-	}
-	*iterateBothDirections(id) {
-		const seen = /* @__PURE__ */ new Set();
-		const outNeighbours = this.adjacency.get(id);
-		if (outNeighbours !== void 0) {
-			for (const neighbour of outNeighbours.keys()) if (!seen.has(neighbour)) {
-				seen.add(neighbour);
-				yield neighbour;
-			}
-		}
-		const inNeighbours = this.reverseAdjacency?.get(id);
-		if (inNeighbours !== void 0) {
-			for (const neighbour of inNeighbours.keys()) if (!seen.has(neighbour)) {
-				seen.add(neighbour);
-				yield neighbour;
-			}
-		}
-	}
-	degree(id, direction = "out") {
-		if (!this.nodes.has(id)) return 0;
-		if (this.directed) {
-			if (direction === "out") return this.adjacency.get(id)?.size ?? 0;
-			if (direction === "in") return this.reverseAdjacency?.get(id)?.size ?? 0;
-			return (this.adjacency.get(id)?.size ?? 0) + (this.reverseAdjacency?.get(id)?.size ?? 0);
-		}
-		return this.adjacency.get(id)?.size ?? 0;
-	}
-	getEdge(source, target) {
-		const forward = this.adjacency.get(source)?.get(target);
-		if (forward !== void 0) return forward;
-		if (!this.directed) return this.adjacency.get(target)?.get(source);
-	}
-	*edges() {
-		const emitted = /* @__PURE__ */ new Set();
-		for (const [, neighbours] of this.adjacency) for (const [, edge] of neighbours) if (this.directed) yield edge;
-		else {
-			const key = this.edgeKey(edge.source, edge.target);
-			if (!emitted.has(key)) {
-				emitted.add(key);
-				yield edge;
-			}
-		}
-	}
-	edgeKey(source, target) {
-		const [a, b] = source < target ? [source, target] : [target, source];
-		return `${a}::${b}`;
-	}
-	/**
-	* Add a node to the graph (builder pattern).
-	*
-	* If a node with the same ID already exists, it is not replaced.
-	*
-	* @param node - The node data to add
-	* @returns this (for method chaining)
-	*/
-	addNode(node) {
-		if (!this.nodes.has(node.id)) this.nodes.set(node.id, node);
-		return this;
-	}
-	/**
-	* Add an edge to the graph (builder pattern).
-	*
-	* @param edge - The edge data to add
-	* @returns this (for method chaining)
-	* @throws Error if either endpoint node does not exist
-	*/
-	addEdge(edge) {
-		if (!this.nodes.has(edge.source) || !this.nodes.has(edge.target)) throw new Error(`Cannot add edge: nodes ${edge.source} and/or ${edge.target} do not exist`);
-		let forwardMap = this.adjacency.get(edge.source);
-		if (forwardMap === void 0) {
-			forwardMap = /* @__PURE__ */ new Map();
-			this.adjacency.set(edge.source, forwardMap);
-		}
-		const isNewEdge = !forwardMap.has(edge.target);
-		forwardMap.set(edge.target, edge);
-		if (this.directed) {
-			let reverseMap = this.reverseAdjacency?.get(edge.target);
-			if (reverseMap === void 0) {
-				reverseMap = /* @__PURE__ */ new Map();
-				this.reverseAdjacency?.set(edge.target, reverseMap);
-			}
-			reverseMap.set(edge.source, edge);
-		} else {
-			let reverseMap = this.adjacency.get(edge.target);
-			if (reverseMap === void 0) {
-				reverseMap = /* @__PURE__ */ new Map();
-				this.adjacency.set(edge.target, reverseMap);
-			}
-			reverseMap.set(edge.source, edge);
-		}
-		if (isNewEdge) this._edgeCount++;
-		return this;
-	}
-	removeNode(id) {
-		if (!this.nodes.has(id)) return false;
-		const outNeighbours = [...this.adjacency.get(id)?.keys() ?? []];
-		for (const neighbour of outNeighbours) this.removeEdgeInternal(id, neighbour);
-		if (this.directed && this.reverseAdjacency !== null) {
-			const inNeighbours = [...this.reverseAdjacency.get(id)?.keys() ?? []];
-			for (const neighbour of inNeighbours) this.removeEdgeFromDirected(neighbour, id);
-		}
-		this.nodes.delete(id);
-		this.adjacency.delete(id);
-		this.reverseAdjacency?.delete(id);
-		return true;
-	}
-	/**
-	* Remove an edge from a directed graph, updating both adjacency maps.
-	* This handles the case where we're removing an edge that points TO the removed node.
-	*/
-	removeEdgeFromDirected(source, target) {
-		if (this.adjacency.get(source)?.delete(target) === true) this._edgeCount--;
-		this.reverseAdjacency?.get(target)?.delete(source);
-	}
-	removeEdgeInternal(source, target) {
-		if (this.adjacency.get(source)?.delete(target) === true) this._edgeCount--;
-		if (this.directed) this.reverseAdjacency?.get(target)?.delete(source);
-		else this.adjacency.get(target)?.delete(source);
-	}
-	removeEdge(source, target) {
-		if (!this.hasEdgeInternal(source, target)) return false;
-		this.removeEdgeInternal(source, target);
-		return true;
-	}
-	hasEdgeInternal(source, target) {
-		if (this.adjacency.get(source)?.has(target) === true) return true;
-		if (!this.directed) return this.adjacency.get(target)?.has(source) === true;
-		return false;
-	}
-};
-//#endregion
-Object.defineProperty(exports, "AdjacencyMapGraph", {
-	enumerable: true,
-	get: function() {
-		return AdjacencyMapGraph;
-	}
-});
-
-//# sourceMappingURL=graph-az06J1YV.cjs.map

package/dist/graph-az06J1YV.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph-az06J1YV.cjs","names":[],"sources":["../src/graph/adjacency-map.ts"],"sourcesContent":["/**\n * Adjacency map graph implementation.\n *\n * This module provides a flexible graph implementation using nested Maps\n * for efficient adjacency list representation. It supports both directed\n * and undirected graphs with builder pattern for convenient construction.\n */\n\nimport type { NodeId, NodeData, EdgeData, Direction } from \"./types\";\nimport type { MutableGraph } from \"./interfaces\";\n\n/**\n * Graph implementation using adjacency map data structure.\n *\n * Uses Map<NodeId, N> for node storage and Map<NodeId, Map<NodeId, E>>\n * for adjacency representation. This provides O(1) average-case lookup\n * for nodes and edges, with memory proportional to V + E.\n *\n * @typeParam N - Node data type, must extend NodeData\n * @typeParam E - Edge data type, must extend EdgeData\n *\n * @example\n * ```typescript\n * // Create a directed citation graph\n * const graph = AdjacencyMapGraph.directed<AuthorNode, CitationEdge>()\n *   .addNode({ id: 'A1', name: 'Alice' })\n *   .addNode({ id: 'B1', name: 'Bob' })\n *   .addEdge({ source: 'A1', target: 'B1', year: 2024 });\n * ```\n */\nexport class AdjacencyMapGraph<\n\tN extends NodeData = NodeData,\n\tE extends EdgeData = EdgeData,\n> implements MutableGraph<N, E> {\n\treadonly directed: boolean;\n\n\tprivate readonly nodes: Map<NodeId, N>;\n\tprivate readonly adjacency: Map<NodeId, Map<NodeId, E>>;\n\tprivate readonly reverseAdjacency: Map<NodeId, Map<NodeId, E>> | null;\n\tprivate _edgeCount: number;\n\n\tprivate constructor(directed: boolean) {\n\t\tthis.directed = directed;\n\t\tthis.nodes = new Map();\n\t\tthis.adjacency = new Map();\n\t\tthis.reverseAdjacency = directed ? new Map() : null;\n\t\tthis._edgeCount = 0;\n\t}\n\n\t/**\n\t * Create a new directed graph.\n\t *\n\t * In a directed graph, edges have direction from source to target.\n\t * The `neighbours` method with direction 'out' returns successors,\n\t * and direction 'in' returns predecessors.\n\t *\n\t * @typeParam N - Node data type\n\t * @typeParam E - Edge data type\n\t * @returns A new empty directed graph\n\t */\n\tstatic directed<\n\t\tN extends NodeData = NodeData,\n\t\tE extends EdgeData = EdgeData,\n\t>(): AdjacencyMapGraph<N, E> {\n\t\treturn new AdjacencyMapGraph<N, E>(true);\n\t}\n\n\t/**\n\t * Create a new undirected graph.\n\t *\n\t * In an undirected graph, edges have no direction. Adding an edge\n\t * from A to B automatically creates the connection from B to A.\n\t *\n\t * @typeParam N - Node data type\n\t * @typeParam E - Edge data type\n\t * @returns A new empty undirected graph\n\t */\n\tstatic undirected<\n\t\tN extends NodeData = NodeData,\n\t\tE extends EdgeData = EdgeData,\n\t>(): AdjacencyMapGraph<N, E> {\n\t\treturn new AdjacencyMapGraph<N, E>(false);\n\t}\n\n\tget nodeCount(): number {\n\t\treturn this.nodes.size;\n\t}\n\n\tget edgeCount(): number {\n\t\treturn this._edgeCount;\n\t}\n\n\thasNode(id: NodeId): boolean {\n\t\treturn this.nodes.has(id);\n\t}\n\n\tgetNode(id: NodeId): N | undefined {\n\t\treturn this.nodes.get(id);\n\t}\n\n\t/**\n\t * Iterate over all node identifiers in the graph.\n\t *\n\t * @returns An iterable of all node IDs\n\t */\n\t*nodeIds(): Iterable<NodeId> {\n\t\tyield* this.nodes.keys();\n\t}\n\n\tneighbours(id: NodeId, direction: Direction = \"out\"): Iterable<NodeId> {\n\t\tif (!this.nodes.has(id)) {\n\t\t\treturn [];\n\t\t}\n\n\t\tif (this.directed) {\n\t\t\tif (direction === \"out\") {\n\t\t\t\treturn this.adjacency.get(id)?.keys() ?? [];\n\t\t\t}\n\t\t\tif (direction === \"in\") {\n\t\t\t\treturn this.reverseAdjacency?.get(id)?.keys() ?? [];\n\t\t\t}\n\t\t\t// direction === 'both'\n\t\t\treturn this.iterateBothDirections(id);\n\t\t}\n\n\t\t// Undirected: all neighbours are in adjacency\n\t\treturn this.adjacency.get(id)?.keys() ?? [];\n\t}\n\n\tprivate *iterateBothDirections(id: NodeId): Iterable<NodeId> {\n\t\tconst seen = new Set<NodeId>();\n\n\t\t// Yield outgoing neighbours\n\t\tconst outNeighbours = this.adjacency.get(id);\n\t\tif (outNeighbours !== undefined) {\n\t\t\tfor (const neighbour of outNeighbours.keys()) {\n\t\t\t\tif (!seen.has(neighbour)) {\n\t\t\t\t\tseen.add(neighbour);\n\t\t\t\t\tyield neighbour;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Yield incoming neighbours\n\t\tconst inNeighbours = this.reverseAdjacency?.get(id);\n\t\tif (inNeighbours !== undefined) {\n\t\t\tfor (const neighbour of inNeighbours.keys()) {\n\t\t\t\tif (!seen.has(neighbour)) {\n\t\t\t\t\tseen.add(neighbour);\n\t\t\t\t\tyield neighbour;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tdegree(id: NodeId, direction: Direction = \"out\"): number {\n\t\tif (!this.nodes.has(id)) {\n\t\t\treturn 0;\n\t\t}\n\n\t\tif (this.directed) {\n\t\t\tif (direction === \"out\") {\n\t\t\t\treturn this.adjacency.get(id)?.size ?? 0;\n\t\t\t}\n\t\t\tif (direction === \"in\") {\n\t\t\t\treturn this.reverseAdjacency?.get(id)?.size ?? 0;\n\t\t\t}\n\t\t\t// direction === 'both': count unique neighbours\n\t\t\tconst outSize = this.adjacency.get(id)?.size ?? 0;\n\t\t\tconst inSize = this.reverseAdjacency?.get(id)?.size ?? 0;\n\t\t\t// Simple sum is sufficient as edges are stored separately\n\t\t\treturn outSize + inSize;\n\t\t}\n\n\t\t// Undirected\n\t\treturn this.adjacency.get(id)?.size ?? 0;\n\t}\n\n\tgetEdge(source: NodeId, target: NodeId): E | undefined {\n\t\t// For undirected, try both orders\n\t\tconst forward = this.adjacency.get(source)?.get(target);\n\t\tif (forward !== undefined) {\n\t\t\treturn forward;\n\t\t}\n\n\t\tif (!this.directed) {\n\t\t\treturn this.adjacency.get(target)?.get(source);\n\t\t}\n\n\t\treturn undefined;\n\t}\n\n\t*edges(): Iterable<E> {\n\t\tconst emitted = new Set<string>();\n\n\t\tfor (const [, neighbours] of this.adjacency) {\n\t\t\tfor (const [, edge] of neighbours) {\n\t\t\t\tif (this.directed) {\n\t\t\t\t\tyield edge;\n\t\t\t\t} else {\n\t\t\t\t\t// For undirected, avoid emitting duplicate edges\n\t\t\t\t\tconst key = this.edgeKey(edge.source, edge.target);\n\t\t\t\t\tif (!emitted.has(key)) {\n\t\t\t\t\t\temitted.add(key);\n\t\t\t\t\t\tyield edge;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tprivate edgeKey(source: NodeId, target: NodeId): string {\n\t\t// Create a canonical key for undirected edges\n\t\tconst [a, b] = source < target ? [source, target] : [target, source];\n\t\treturn `${a}::${b}`;\n\t}\n\n\t/**\n\t * Add a node to the graph (builder pattern).\n\t *\n\t * If a node with the same ID already exists, it is not replaced.\n\t *\n\t * @param node - The node data to add\n\t * @returns this (for method chaining)\n\t */\n\taddNode(node: N): this {\n\t\tif (!this.nodes.has(node.id)) {\n\t\t\tthis.nodes.set(node.id, node);\n\t\t}\n\t\treturn this;\n\t}\n\n\t/**\n\t * Add an edge to the graph (builder pattern).\n\t *\n\t * @param edge - The edge data to add\n\t * @returns this (for method chaining)\n\t * @throws Error if either endpoint node does not exist\n\t */\n\taddEdge(edge: E): this {\n\t\t// Ensure both nodes exist\n\t\tif (!this.nodes.has(edge.source) || !this.nodes.has(edge.target)) {\n\t\t\tthrow new Error(\n\t\t\t\t`Cannot add edge: nodes ${edge.source} and/or ${edge.target} do not exist`,\n\t\t\t);\n\t\t}\n\n\t\t// Store in forward adjacency\n\t\tlet forwardMap = this.adjacency.get(edge.source);\n\t\tif (forwardMap === undefined) {\n\t\t\tforwardMap = new Map();\n\t\t\tthis.adjacency.set(edge.source, forwardMap);\n\t\t}\n\n\t\tconst isNewEdge = !forwardMap.has(edge.target);\n\t\tforwardMap.set(edge.target, edge);\n\n\t\tif (this.directed) {\n\t\t\t// Store reverse reference for efficient predecessor lookup\n\t\t\tlet reverseMap = this.reverseAdjacency?.get(edge.target);\n\t\t\tif (reverseMap === undefined) {\n\t\t\t\treverseMap = new Map();\n\t\t\t\tthis.reverseAdjacency?.set(edge.target, reverseMap);\n\t\t\t}\n\t\t\treverseMap.set(edge.source, edge);\n\t\t} else {\n\t\t\t// For undirected, also store in reverse direction\n\t\t\tlet reverseMap = this.adjacency.get(edge.target);\n\t\t\tif (reverseMap === undefined) {\n\t\t\t\treverseMap = new Map();\n\t\t\t\tthis.adjacency.set(edge.target, reverseMap);\n\t\t\t}\n\t\t\treverseMap.set(edge.source, edge);\n\t\t}\n\n\t\tif (isNewEdge) {\n\t\t\tthis._edgeCount++;\n\t\t}\n\t\treturn this;\n\t}\n\n\tremoveNode(id: NodeId): boolean {\n\t\tif (!this.nodes.has(id)) {\n\t\t\treturn false;\n\t\t}\n\n\t\t// Remove all outgoing edges from this node\n\t\tconst outNeighbours = [...(this.adjacency.get(id)?.keys() ?? [])];\n\t\tfor (const neighbour of outNeighbours) {\n\t\t\tthis.removeEdgeInternal(id, neighbour);\n\t\t}\n\n\t\t// For directed graphs, also remove incoming edges to this node\n\t\tif (this.directed && this.reverseAdjacency !== null) {\n\t\t\tconst inNeighbours = [...(this.reverseAdjacency.get(id)?.keys() ?? [])];\n\t\t\tfor (const neighbour of inNeighbours) {\n\t\t\t\t// Remove the edge from neighbour -> id\n\t\t\t\tthis.removeEdgeFromDirected(neighbour, id);\n\t\t\t}\n\t\t}\n\n\t\t// Remove the node itself\n\t\tthis.nodes.delete(id);\n\t\tthis.adjacency.delete(id);\n\t\tthis.reverseAdjacency?.delete(id);\n\n\t\treturn true;\n\t}\n\n\t/**\n\t * Remove an edge from a directed graph, updating both adjacency maps.\n\t * This handles the case where we're removing an edge that points TO the removed node.\n\t */\n\tprivate removeEdgeFromDirected(source: NodeId, target: NodeId): void {\n\t\t// Remove from forward adjacency (source -> target)\n\t\tconst forwardMap = this.adjacency.get(source);\n\t\tif (forwardMap?.delete(target) === true) {\n\t\t\tthis._edgeCount--;\n\t\t}\n\n\t\t// Remove from reverse adjacency\n\t\tthis.reverseAdjacency?.get(target)?.delete(source);\n\t}\n\n\tprivate removeEdgeInternal(source: NodeId, target: NodeId): void {\n\t\t// Remove from forward adjacency\n\t\tconst forwardMap = this.adjacency.get(source);\n\t\tif (forwardMap?.delete(target) === true) {\n\t\t\tthis._edgeCount--;\n\t\t}\n\n\t\tif (this.directed) {\n\t\t\t// Remove from reverse adjacency\n\t\t\tthis.reverseAdjacency?.get(target)?.delete(source);\n\t\t} else {\n\t\t\t// For undirected, remove both directions\n\t\t\tthis.adjacency.get(target)?.delete(source);\n\t\t}\n\t}\n\n\tremoveEdge(source: NodeId, target: NodeId): boolean {\n\t\t// Check if edge exists\n\t\tif (!this.hasEdgeInternal(source, target)) {\n\t\t\treturn false;\n\t\t}\n\n\t\tthis.removeEdgeInternal(source, target);\n\t\treturn true;\n\t}\n\n\tprivate hasEdgeInternal(source: NodeId, target: NodeId): boolean {\n\t\tconst forward = this.adjacency.get(source)?.has(target) === true;\n\t\tif (forward) {\n\t\t\treturn true;\n\t\t}\n\n\t\tif (!this.directed) {\n\t\t\treturn this.adjacency.get(target)?.has(source) === true;\n\t\t}\n\n\t\treturn false;\n\t}\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AA8BA,IAAa,oBAAb,MAAa,kBAGmB;CAC/B;CAEA;CACA;CACA;CACA;CAEA,YAAoB,UAAmB;AACtC,OAAK,WAAW;AAChB,OAAK,wBAAQ,IAAI,KAAK;AACtB,OAAK,4BAAY,IAAI,KAAK;AAC1B,OAAK,mBAAmB,2BAAW,IAAI,KAAK,GAAG;AAC/C,OAAK,aAAa;;;;;;;;;;;;;CAcnB,OAAO,WAGsB;AAC5B,SAAO,IAAI,kBAAwB,KAAK;;;;;;;;;;;;CAazC,OAAO,aAGsB;AAC5B,SAAO,IAAI,kBAAwB,MAAM;;CAG1C,IAAI,YAAoB;AACvB,SAAO,KAAK,MAAM;;CAGnB,IAAI,YAAoB;AACvB,SAAO,KAAK;;CAGb,QAAQ,IAAqB;AAC5B,SAAO,KAAK,MAAM,IAAI,GAAG;;CAG1B,QAAQ,IAA2B;AAClC,SAAO,KAAK,MAAM,IAAI,GAAG;;;;;;;CAQ1B,CAAC,UAA4B;AAC5B,SAAO,KAAK,MAAM,MAAM;;CAGzB,WAAW,IAAY,YAAuB,OAAyB;AACtE,MAAI,CAAC,KAAK,MAAM,IAAI,GAAG,CACtB,QAAO,EAAE;AAGV,MAAI,KAAK,UAAU;AAClB,OAAI,cAAc,MACjB,QAAO,KAAK,UAAU,IAAI,GAAG,EAAE,MAAM,IAAI,EAAE;AAE5C,OAAI,cAAc,KACjB,QAAO,KAAK,kBAAkB,IAAI,GAAG,EAAE,MAAM,IAAI,EAAE;AAGpD,UAAO,KAAK,sBAAsB,GAAG;;AAItC,SAAO,KAAK,UAAU,IAAI,GAAG,EAAE,MAAM,IAAI,EAAE;;CAG5C,CAAS,sBAAsB,IAA8B;EAC5D,MAAM,uBAAO,IAAI,KAAa;EAG9B,MAAM,gBAAgB,KAAK,UAAU,IAAI,GAAG;AAC5C,MAAI,kBAAkB,KAAA;QAChB,MAAM,aAAa,cAAc,MAAM,CAC3C,KAAI,CAAC,KAAK,IAAI,UAAU,EAAE;AACzB,SAAK,IAAI,UAAU;AACnB,UAAM;;;EAMT,MAAM,eAAe,KAAK,kBAAkB,IAAI,GAAG;AACnD,MAAI,iBAAiB,KAAA;QACf,MAAM,aAAa,aAAa,MAAM,CAC1C,KAAI,CAAC,KAAK,IAAI,UAAU,EAAE;AACzB,SAAK,IAAI,UAAU;AACnB,UAAM;;;;CAMV,OAAO,IAAY,YAAuB,OAAe;AACxD,MAAI,CAAC,KAAK,MAAM,IAAI,GAAG,CACtB,QAAO;AAGR,MAAI,KAAK,UAAU;AAClB,OAAI,cAAc,MACjB,QAAO,KAAK,UAAU,IAAI,GAAG,EAAE,QAAQ;AAExC,OAAI,cAAc,KACjB,QAAO,KAAK,kBAAkB,IAAI,GAAG,EAAE,QAAQ;AAMhD,WAHgB,KAAK,UAAU,IAAI,GAAG,EAAE,QAAQ,MACjC,KAAK,kBAAkB,IAAI,GAAG,EAAE,QAAQ;;AAMxD,SAAO,KAAK,UAAU,IAAI,GAAG,EAAE,QAAQ;;CAGxC,QAAQ,QAAgB,QAA+B;EAEtD,MAAM,UAAU,KAAK,UAAU,IAAI,OAAO,EAAE,IAAI,OAAO;AACvD,MAAI,YAAY,KAAA,EACf,QAAO;AAGR,MAAI,CAAC,KAAK,SACT,QAAO,KAAK,UAAU,IAAI,OAAO,EAAE,IAAI,OAAO;;CAMhD,CAAC,QAAqB;EACrB,MAAM,0BAAU,IAAI,KAAa;AAEjC,OAAK,MAAM,GAAG,eAAe,KAAK,UACjC,MAAK,MAAM,GAAG,SAAS,WACtB,KAAI,KAAK,SACR,OAAM;OACA;GAEN,MAAM,MAAM,KAAK,QAAQ,KAAK,QAAQ,KAAK,OAAO;AAClD,OAAI,CAAC,QAAQ,IAAI,IAAI,EAAE;AACtB,YAAQ,IAAI,IAAI;AAChB,UAAM;;;;CAOX,QAAgB,QAAgB,QAAwB;EAEvD,MAAM,CAAC,GAAG,KAAK,SAAS,SAAS,CAAC,QAAQ,OAAO,GAAG,CAAC,QAAQ,OAAO;AACpE,SAAO,GAAG,EAAE,IAAI;;;;;;;;;;CAWjB,QAAQ,MAAe;AACtB,MAAI,CAAC,KAAK,MAAM,IAAI,KAAK,GAAG,CAC3B,MAAK,MAAM,IAAI,KAAK,IAAI,KAAK;AAE9B,SAAO;;;;;;;;;CAUR,QAAQ,MAAe;AAEtB,MAAI,CAAC,KAAK,MAAM,IAAI,KAAK,OAAO,IAAI,CAAC,KAAK,MAAM,IAAI,KAAK,OAAO,CAC/D,OAAM,IAAI,MACT,0BAA0B,KAAK,OAAO,UAAU,KAAK,OAAO,eAC5D;EAIF,IAAI,aAAa,KAAK,UAAU,IAAI,KAAK,OAAO;AAChD,MAAI,eAAe,KAAA,GAAW;AAC7B,gCAAa,IAAI,KAAK;AACtB,QAAK,UAAU,IAAI,KAAK,QAAQ,WAAW;;EAG5C,MAAM,YAAY,CAAC,WAAW,IAAI,KAAK,OAAO;AAC9C,aAAW,IAAI,KAAK,QAAQ,KAAK;AAEjC,MAAI,KAAK,UAAU;GAElB,IAAI,aAAa,KAAK,kBAAkB,IAAI,KAAK,OAAO;AACxD,OAAI,eAAe,KAAA,GAAW;AAC7B,iCAAa,IAAI,KAAK;AACtB,SAAK,kBAAkB,IAAI,KAAK,QAAQ,WAAW;;AAEpD,cAAW,IAAI,KAAK,QAAQ,KAAK;SAC3B;GAEN,IAAI,aAAa,KAAK,UAAU,IAAI,KAAK,OAAO;AAChD,OAAI,eAAe,KAAA,GAAW;AAC7B,iCAAa,IAAI,KAAK;AACtB,SAAK,UAAU,IAAI,KAAK,QAAQ,WAAW;;AAE5C,cAAW,IAAI,KAAK,QAAQ,KAAK;;AAGlC,MAAI,UACH,MAAK;AAEN,SAAO;;CAGR,WAAW,IAAqB;AAC/B,MAAI,CAAC,KAAK,MAAM,IAAI,GAAG,CACtB,QAAO;EAIR,MAAM,gBAAgB,CAAC,GAAI,KAAK,UAAU,IAAI,GAAG,EAAE,MAAM,IAAI,EAAE,CAAE;AACjE,OAAK,MAAM,aAAa,cACvB,MAAK,mBAAmB,IAAI,UAAU;AAIvC,MAAI,KAAK,YAAY,KAAK,qBAAqB,MAAM;GACpD,MAAM,eAAe,CAAC,GAAI,KAAK,iBAAiB,IAAI,GAAG,EAAE,MAAM,IAAI,EAAE,CAAE;AACvE,QAAK,MAAM,aAAa,aAEvB,MAAK,uBAAuB,WAAW,GAAG;;AAK5C,OAAK,MAAM,OAAO,GAAG;AACrB,OAAK,UAAU,OAAO,GAAG;AACzB,OAAK,kBAAkB,OAAO,GAAG;AAEjC,SAAO;;;;;;CAOR,uBAA+B,QAAgB,QAAsB;AAGpE,MADmB,KAAK,UAAU,IAAI,OAAO,EAC7B,OAAO,OAAO,KAAK,KAClC,MAAK;AAIN,OAAK,kBAAkB,IAAI,OAAO,EAAE,OAAO,OAAO;;CAGnD,mBAA2B,QAAgB,QAAsB;AAGhE,MADmB,KAAK,UAAU,IAAI,OAAO,EAC7B,OAAO,OAAO,KAAK,KAClC,MAAK;AAGN,MAAI,KAAK,SAER,MAAK,kBAAkB,IAAI,OAAO,EAAE,OAAO,OAAO;MAGlD,MAAK,UAAU,IAAI,OAAO,EAAE,OAAO,OAAO;;CAI5C,WAAW,QAAgB,QAAyB;AAEnD,MAAI,CAAC,KAAK,gBAAgB,QAAQ,OAAO,CACxC,QAAO;AAGR,OAAK,mBAAmB,QAAQ,OAAO;AACvC,SAAO;;CAGR,gBAAwB,QAAgB,QAAyB;AAEhE,MADgB,KAAK,UAAU,IAAI,OAAO,EAAE,IAAI,OAAO,KAAK,KAE3D,QAAO;AAGR,MAAI,CAAC,KAAK,SACT,QAAO,KAAK,UAAU,IAAI,OAAO,EAAE,IAAI,OAAO,KAAK;AAGpD,SAAO"}

package/dist/seeds-B6J9oJfU.cjs

@@ -1,404 +0,0 @@
-const require_kmeans = require("./kmeans-B0HEOU6k.cjs");
-//#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 = require_kmeans.normaliseFeatures(features);
-	const k = Math.min(config.nClusters, features.length);
-	const kmeansResult = require_kmeans.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({
-			id: nodeId,
-			type: node.type
-		});
-		if (field === void 0) continue;
-		nodesWithFields.push({
-			id: nodeId,
-			type: node.type,
-			field
-		});
-	}
-	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
-Object.defineProperty(exports, "grasp", {
-	enumerable: true,
-	get: function() {
-		return grasp;
-	}
-});
-Object.defineProperty(exports, "stratified", {
-	enumerable: true,
-	get: function() {
-		return stratified;
-	}
-});
-
-//# sourceMappingURL=seeds-B6J9oJfU.cjs.map