graphwise 1.8.0 → 1.9.0

package/dist/graph/index.cjs

@@ -1,230 +1,3 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-//#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`);
-		if (!this.directed) {
-			const [cSource, cTarget] = edge.source < edge.target ? [edge.source, edge.target] : [edge.target, edge.source];
-			if (this.adjacency.get(cSource)?.get(cTarget) !== void 0) {
-				this.adjacency.get(cSource)?.set(cTarget, edge);
-				return this;
-			}
-		}
-		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
-exports.AdjacencyMapGraph = AdjacencyMapGraph;
-
-//# sourceMappingURL=index.cjs.map
+const require_adjacency_map = require("../adjacency-map-JqBnMNkF.cjs");
+exports.AdjacencyMapGraph = require_adjacency_map.AdjacencyMapGraph;

package/dist/graph/index.js

@@ -1,229 +1,2 @@
-//#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`);
-		if (!this.directed) {
-			const [cSource, cTarget] = edge.source < edge.target ? [edge.source, edge.target] : [edge.target, edge.source];
-			if (this.adjacency.get(cSource)?.get(cTarget) !== void 0) {
-				this.adjacency.get(cSource)?.set(cTarget, edge);
-				return this;
-			}
-		}
-		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
+import { t as AdjacencyMapGraph } from "../adjacency-map-BtKzcuJq.js";
 export { AdjacencyMapGraph };
-
-//# sourceMappingURL=index.js.map