@statelyai/graph 0.9.0 → 0.10.0

package/dist/{algorithms-3xvCxHzo.mjs → algorithms-C-S7u40k.mjs}

@@ -49,7 +49,7 @@ function createGraphNode(config) {
 		id: config.id,
 		...config.parentId !== void 0 && { parentId: config.parentId ?? null },
 		...config.initialNodeId !== void 0 && { initialNodeId: config.initialNodeId ?? null },
-		label: config.label ?? "",
+		label: config.label ?? null,
 		data: config.data
 	};
 	if (config.ports !== void 0 && config.ports.length > 0) {
@@ -1775,8 +1775,9 @@ function getNeighborEdges(graph, nodeId) {
 * Returns all paths of equal minimum length per target (not just one).
 * Uses BFS when all edges are unweighted; Dijkstra otherwise.
 */
-/** Compute distance + prev maps via BFS or Dijkstra. */
-function computeShortestDistances(graph, sourceId, getWeight) {
+/** Compute distance + prev maps via BFS, Dijkstra, or Bellman-Ford. */
+function computeShortestDistances(graph, sourceId, getWeight, algorithm) {
+	if (algorithm === "bellman-ford") return bellmanFord(graph, sourceId, getWeight);
 	const dist = /* @__PURE__ */ new Map();
 	const prev = /* @__PURE__ */ new Map();
 	dist.set(sourceId, 0);
@@ -1839,6 +1840,73 @@ function computeShortestDistances(graph, sourceId, getWeight) {
 		prev
 	};
 }
+/**
+* Bellman-Ford single-source shortest paths.
+* **O(VE)** time. Handles negative edge weights.
+* Throws if a negative-weight cycle is reachable from the source.
+*/
+function bellmanFord(graph, sourceId, getWeight) {
+	const dist = /* @__PURE__ */ new Map();
+	const prev = /* @__PURE__ */ new Map();
+	const effectiveWeight = getWeight ?? ((e) => e.weight ?? 1);
+	const isUndirected = graph.type === "undirected";
+	for (const node of graph.nodes) {
+		dist.set(node.id, Infinity);
+		prev.set(node.id, []);
+	}
+	dist.set(sourceId, 0);
+	const V = graph.nodes.length;
+	const directedEdges = [];
+	for (const edge of graph.edges) {
+		directedEdges.push({
+			fromId: edge.sourceId,
+			toId: edge.targetId,
+			edge
+		});
+		if (isUndirected) directedEdges.push({
+			fromId: edge.targetId,
+			toId: edge.sourceId,
+			edge
+		});
+	}
+	for (let i = 0; i < V - 1; i++) {
+		let changed = false;
+		for (const { fromId, toId, edge } of directedEdges) {
+			const d = dist.get(fromId);
+			if (d === Infinity) continue;
+			const newDist = d + effectiveWeight(edge);
+			const existing = dist.get(toId);
+			if (newDist < existing) {
+				dist.set(toId, newDist);
+				prev.set(toId, [{
+					from: fromId,
+					edge
+				}]);
+				changed = true;
+			} else if (newDist === existing && existing !== Infinity) {
+				const preds = prev.get(toId);
+				if (!preds.some((p) => p.from === fromId && p.edge === edge)) preds.push({
+					from: fromId,
+					edge
+				});
+			}
+		}
+		if (!changed) break;
+	}
+	for (const { fromId, toId, edge } of directedEdges) {
+		const d = dist.get(fromId);
+		if (d === Infinity) continue;
+		if (d + effectiveWeight(edge) < dist.get(toId)) throw new Error("Graph contains a negative-weight cycle reachable from the source node");
+	}
+	for (const [id, d] of dist) if (d === Infinity) {
+		dist.delete(id);
+		prev.delete(id);
+	}
+	return {
+		dist,
+		prev
+	};
+}
 /** Reconstruct all shortest paths to a target by backtracking through prev map. */
 function* reconstructPaths(graph, prev, sourceNode, targetId) {
 	if (targetId === sourceNode.id) {
@@ -1888,7 +1956,7 @@ function* reconstructPaths(graph, prev, sourceNode, targetId) {
 function* genShortestPaths(graph, opts) {
 	const idx = getIndex(graph);
 	const sourceId = resolveFrom(graph, opts);
-	const { dist, prev } = computeShortestDistances(graph, sourceId, opts?.getWeight);
+	const { dist, prev } = computeShortestDistances(graph, sourceId, opts?.getWeight, opts?.algorithm);
 	const targets = opts?.to ? [opts.to].filter((id) => dist.has(id)) : [...dist.keys()].filter((id) => id !== sourceId);
 	const sourceNi = idx.nodeById.get(sourceId);
 	const sourceNode = sourceNi !== void 0 ? graph.nodes[sourceNi] : graph.nodes.find((n) => n.id === sourceId);
@@ -2678,9 +2746,10 @@ function kruskalMST(graph, getWeight) {
 /**
 * Returns shortest paths between all pairs of nodes.
 * Algorithm 'dijkstra' (default): runs getShortestPaths per source node.
+* Algorithm 'bellman-ford': handles negative weights, throws on negative cycles.
 * Algorithm 'floyd-warshall': classic dynamic programming.
 *
-* **O(V · (V + E) log V)** (Dijkstra) or **O(V³)** (Floyd-Warshall).
+* **O(V · (V + E) log V)** (Dijkstra), **O(V²E)** (Bellman-Ford), or **O(V³)** (Floyd-Warshall).
 *
 * @example
 * ```ts
@@ -2699,9 +2768,23 @@ function kruskalMST(graph, getWeight) {
 * ```
 */
 function getAllPairsShortestPaths(graph, opts) {
-	if ((opts?.algorithm ?? "dijkstra") === "floyd-warshall") return floydWarshallAllPaths(graph, opts?.getWeight);
+	const algorithm = opts?.algorithm ?? "dijkstra";
+	if (algorithm === "floyd-warshall") return floydWarshallAllPaths(graph, opts?.getWeight);
+	if (algorithm === "bellman-ford") return bellmanFordAllPaths(graph, opts?.getWeight);
 	return dijkstraAllPaths(graph, opts?.getWeight);
 }
+function bellmanFordAllPaths(graph, getWeight) {
+	const results = [];
+	for (const node of graph.nodes) {
+		const paths = getShortestPaths(graph, {
+			from: node.id,
+			getWeight,
+			algorithm: "bellman-ford"
+		});
+		results.push(...paths);
+	}
+	return results;
+}
 function dijkstraAllPaths(graph, getWeight) {
 	const results = [];
 	for (const node of graph.nodes) {

package/dist/{algorithms-g2uWmPrb.d.mts → algorithms-DdjFO-ft.d.mts}

@@ -1,4 +1,4 @@
-import { A as TraversalOptions, O as SinglePathOptions, S as MSTOptions, T as PathOptions, _ as GraphNode, n as AllPairsShortestPathsOptions, p as GraphEdge, t as AStarOptions, u as Graph, y as GraphPath } from "./types-BzckPChi.mjs";
+import { D as SinglePathOptions, g as GraphNode, k as TraversalOptions, n as AllPairsShortestPathsOptions, p as GraphEdge, t as AStarOptions, u as Graph, v as GraphPath, w as PathOptions, x as MSTOptions } from "./types-F3j-sr2X.mjs";
 
 //#region src/algorithms/centrality.d.ts
 interface IterativeCentralityOptions {
@@ -697,9 +697,10 @@ declare function getMinimumSpanningTree<N, E>(graph: Graph<N, E>, opts?: MSTOpti
 /**
  * Returns shortest paths between all pairs of nodes.
  * Algorithm 'dijkstra' (default): runs getShortestPaths per source node.
+ * Algorithm 'bellman-ford': handles negative weights, throws on negative cycles.
  * Algorithm 'floyd-warshall': classic dynamic programming.
  *
- * **O(V · (V + E) log V)** (Dijkstra) or **O(V³)** (Floyd-Warshall).
+ * **O(V · (V + E) log V)** (Dijkstra), **O(V²E)** (Bellman-Ford), or **O(V³)** (Floyd-Warshall).
  *
  * @example
  * ```ts

package/dist/algorithms.d.mts

@@ -1,2 +1,2 @@
-import { A as getArticulationPoints, B as HITSResult, C as hasPath, D as joinPaths, E as isTree, F as genGirvanNewmanCommunities, G as getEigenvectorCentrality, H as getBetweennessCentrality, I as getGirvanNewmanCommunities, J as getOutDegreeCentrality, K as getHITS, L as getGreedyModularityCommunities, M as getBridges, N as GirvanNewmanOptions, O as IsomorphismOptions, P as LabelPropagationOptions, R as getLabelPropagationCommunities, S as getTopologicalSort, T as isConnected, U as getClosenessCentrality, V as IterativeCentralityOptions, W as getDegreeCentrality, Y as getPageRank, _ as getShortestPath, a as genPreorders, b as getSimplePaths, c as getAStarPath, d as getCycles, f as getMinimumSpanningTree, g as getPreorders, h as getPreorder, i as genPostorders, j as getBiconnectedComponents, k as isIsomorphic, l as getAllPairsShortestPaths, m as getPostorders, n as dfs, o as genShortestPaths, p as getPostorder, q as getInDegreeCentrality, r as genCycles, s as genSimplePaths, t as bfs, u as getConnectedComponents, v as getShortestPaths, w as isAcyclic, x as getStronglyConnectedComponents, y as getSimplePath, z as getModularity } from "./algorithms-g2uWmPrb.mjs";
+import { A as getArticulationPoints, B as HITSResult, C as hasPath, D as joinPaths, E as isTree, F as genGirvanNewmanCommunities, G as getEigenvectorCentrality, H as getBetweennessCentrality, I as getGirvanNewmanCommunities, J as getOutDegreeCentrality, K as getHITS, L as getGreedyModularityCommunities, M as getBridges, N as GirvanNewmanOptions, O as IsomorphismOptions, P as LabelPropagationOptions, R as getLabelPropagationCommunities, S as getTopologicalSort, T as isConnected, U as getClosenessCentrality, V as IterativeCentralityOptions, W as getDegreeCentrality, Y as getPageRank, _ as getShortestPath, a as genPreorders, b as getSimplePaths, c as getAStarPath, d as getCycles, f as getMinimumSpanningTree, g as getPreorders, h as getPreorder, i as genPostorders, j as getBiconnectedComponents, k as isIsomorphic, l as getAllPairsShortestPaths, m as getPostorders, n as dfs, o as genShortestPaths, p as getPostorder, q as getInDegreeCentrality, r as genCycles, s as genSimplePaths, t as bfs, u as getConnectedComponents, v as getShortestPaths, w as isAcyclic, x as getStronglyConnectedComponents, y as getSimplePath, z as getModularity } from "./algorithms-DdjFO-ft.mjs";
 export { GirvanNewmanOptions, HITSResult, IsomorphismOptions, IterativeCentralityOptions, LabelPropagationOptions, bfs, dfs, genCycles, genGirvanNewmanCommunities, genPostorders, genPreorders, genShortestPaths, genSimplePaths, getAStarPath, getAllPairsShortestPaths, getArticulationPoints, getBetweennessCentrality, getBiconnectedComponents, getBridges, getClosenessCentrality, getConnectedComponents, getCycles, getDegreeCentrality, getEigenvectorCentrality, getGirvanNewmanCommunities, getGreedyModularityCommunities, getHITS, getInDegreeCentrality, getLabelPropagationCommunities, getMinimumSpanningTree, getModularity, getOutDegreeCentrality, getPageRank, getPostorder, getPostorders, getPreorder, getPreorders, getShortestPath, getShortestPaths, getSimplePath, getSimplePaths, getStronglyConnectedComponents, getTopologicalSort, hasPath, isAcyclic, isConnected, isIsomorphic, isTree, joinPaths };

package/dist/algorithms.mjs

@@ -1,3 +1,3 @@
-import { A as getBiconnectedComponents, B as getEigenvectorCentrality, C as hasPath, D as joinPaths, E as isTree, F as getLabelPropagationCommunities, H as getInDegreeCentrality, I as getModularity, L as getBetweennessCentrality, M as genGirvanNewmanCommunities, N as getGirvanNewmanCommunities, O as isIsomorphic, P as getGreedyModularityCommunities, R as getClosenessCentrality, S as getTopologicalSort, T as isConnected, U as getOutDegreeCentrality, V as getHITS, W as getPageRank, _ as getShortestPath, a as genPreorders, b as getSimplePaths, c as getAStarPath, d as getCycles, f as getMinimumSpanningTree, g as getPreorders, h as getPreorder, i as genPostorders, j as getBridges, k as getArticulationPoints, l as getAllPairsShortestPaths, m as getPostorders, n as dfs, o as genShortestPaths, p as getPostorder, r as genCycles, s as genSimplePaths, t as bfs, u as getConnectedComponents, v as getShortestPaths, w as isAcyclic, x as getStronglyConnectedComponents, y as getSimplePath, z as getDegreeCentrality } from "./algorithms-3xvCxHzo.mjs";
+import { A as getBiconnectedComponents, B as getEigenvectorCentrality, C as hasPath, D as joinPaths, E as isTree, F as getLabelPropagationCommunities, H as getInDegreeCentrality, I as getModularity, L as getBetweennessCentrality, M as genGirvanNewmanCommunities, N as getGirvanNewmanCommunities, O as isIsomorphic, P as getGreedyModularityCommunities, R as getClosenessCentrality, S as getTopologicalSort, T as isConnected, U as getOutDegreeCentrality, V as getHITS, W as getPageRank, _ as getShortestPath, a as genPreorders, b as getSimplePaths, c as getAStarPath, d as getCycles, f as getMinimumSpanningTree, g as getPreorders, h as getPreorder, i as genPostorders, j as getBridges, k as getArticulationPoints, l as getAllPairsShortestPaths, m as getPostorders, n as dfs, o as genShortestPaths, p as getPostorder, r as genCycles, s as genSimplePaths, t as bfs, u as getConnectedComponents, v as getShortestPaths, w as isAcyclic, x as getStronglyConnectedComponents, y as getSimplePath, z as getDegreeCentrality } from "./algorithms-C-S7u40k.mjs";
 
 export { bfs, dfs, genCycles, genGirvanNewmanCommunities, genPostorders, genPreorders, genShortestPaths, genSimplePaths, getAStarPath, getAllPairsShortestPaths, getArticulationPoints, getBetweennessCentrality, getBiconnectedComponents, getBridges, getClosenessCentrality, getConnectedComponents, getCycles, getDegreeCentrality, getEigenvectorCentrality, getGirvanNewmanCommunities, getGreedyModularityCommunities, getHITS, getInDegreeCentrality, getLabelPropagationCommunities, getMinimumSpanningTree, getModularity, getOutDegreeCentrality, getPageRank, getPostorder, getPostorders, getPreorder, getPreorders, getShortestPath, getShortestPaths, getSimplePath, getSimplePaths, getStronglyConnectedComponents, getTopologicalSort, hasPath, isAcyclic, isConnected, isIsomorphic, isTree, joinPaths };

package/dist/formats/adjacency-list/index.d.mts

@@ -1,4 +1,4 @@
-import { u as Graph } from "../../types-BzckPChi.mjs";
+import { u as Graph } from "../../types-F3j-sr2X.mjs";
 
 //#region src/formats/adjacency-list/index.d.ts
 

package/dist/formats/converter/index.d.mts

@@ -1,4 +1,4 @@
-import { g as GraphFormatConverter, u as Graph } from "../../types-BzckPChi.mjs";
+import { h as GraphFormatConverter, u as Graph } from "../../types-F3j-sr2X.mjs";
 
 //#region src/formats/converter/index.d.ts
 

package/dist/formats/cytoscape/index.d.mts

@@ -1,4 +1,4 @@
-import { g as GraphFormatConverter, u as Graph } from "../../types-BzckPChi.mjs";
+import { h as GraphFormatConverter, u as Graph } from "../../types-F3j-sr2X.mjs";
 
 //#region src/formats/cytoscape/index.d.ts
 interface CytoscapeNode {

package/dist/formats/d3/index.d.mts

@@ -1,4 +1,4 @@
-import { g as GraphFormatConverter, u as Graph } from "../../types-BzckPChi.mjs";
+import { h as GraphFormatConverter, u as Graph } from "../../types-F3j-sr2X.mjs";
 
 //#region src/formats/d3/index.d.ts
 interface D3Node {

package/dist/formats/dot/index.d.mts

@@ -1,4 +1,4 @@
-import { g as GraphFormatConverter, u as Graph } from "../../types-BzckPChi.mjs";
+import { h as GraphFormatConverter, u as Graph } from "../../types-F3j-sr2X.mjs";
 
 //#region src/formats/dot/index.d.ts
 

package/dist/formats/edge-list/index.d.mts

@@ -1,4 +1,4 @@
-import { u as Graph } from "../../types-BzckPChi.mjs";
+import { u as Graph } from "../../types-F3j-sr2X.mjs";
 
 //#region src/formats/edge-list/index.d.ts
 

package/dist/formats/elk/index.d.mts

@@ -1,4 +1,4 @@
-import { F as VisualGraphFormatConverter, M as VisualGraph } from "../../types-BzckPChi.mjs";
+import { P as VisualGraphFormatConverter, j as VisualGraph } from "../../types-F3j-sr2X.mjs";
 import { ElkEdge, ElkEdgeSection, ElkExtendedEdge, ElkGraphElement, ElkLabel, ElkNode, ElkNode as ElkNode$1, ElkPoint, ElkPort, ElkPrimitiveEdge, ElkShape, LayoutOptions } from "elkjs/lib/elk-api";
 
 //#region src/formats/elk/index.d.ts

package/dist/formats/gexf/index.d.mts

@@ -1,4 +1,4 @@
-import { g as GraphFormatConverter, u as Graph } from "../../types-BzckPChi.mjs";
+import { h as GraphFormatConverter, u as Graph } from "../../types-F3j-sr2X.mjs";
 
 //#region src/formats/gexf/index.d.ts
 declare function toGEXF(graph: Graph): string;

package/dist/formats/gml/index.d.mts

@@ -1,4 +1,4 @@
-import { g as GraphFormatConverter, u as Graph } from "../../types-BzckPChi.mjs";
+import { h as GraphFormatConverter, u as Graph } from "../../types-F3j-sr2X.mjs";
 
 //#region src/formats/gml/index.d.ts
 

package/dist/formats/graphml/index.d.mts

@@ -1,4 +1,4 @@
-import { g as GraphFormatConverter, u as Graph } from "../../types-BzckPChi.mjs";
+import { h as GraphFormatConverter, u as Graph } from "../../types-F3j-sr2X.mjs";
 
 //#region src/formats/graphml/index.d.ts
 declare function toGraphML(graph: Graph): string;

package/dist/formats/jgf/index.d.mts

@@ -1,4 +1,4 @@
-import { g as GraphFormatConverter, u as Graph } from "../../types-BzckPChi.mjs";
+import { h as GraphFormatConverter, u as Graph } from "../../types-F3j-sr2X.mjs";
 
 //#region src/formats/jgf/index.d.ts
 interface JGFNode {

package/dist/formats/mermaid/index.d.mts

@@ -1,4 +1,4 @@
-import { g as GraphFormatConverter, u as Graph } from "../../types-BzckPChi.mjs";
+import { h as GraphFormatConverter, u as Graph } from "../../types-F3j-sr2X.mjs";
 
 //#region src/formats/mermaid/sequence.d.ts
 interface SequenceNodeData {

package/dist/formats/tgf/index.d.mts

@@ -1,4 +1,4 @@
-import { g as GraphFormatConverter, u as Graph } from "../../types-BzckPChi.mjs";
+import { h as GraphFormatConverter, u as Graph } from "../../types-F3j-sr2X.mjs";
 
 //#region src/formats/tgf/index.d.ts
 

package/dist/formats/xyflow/index.d.mts

@@ -1,4 +1,4 @@
-import { F as VisualGraphFormatConverter, M as VisualGraph } from "../../types-BzckPChi.mjs";
+import { P as VisualGraphFormatConverter, j as VisualGraph } from "../../types-F3j-sr2X.mjs";
 import { EdgeBase, NodeBase } from "@xyflow/system";
 
 //#region src/formats/xyflow/index.d.ts

package/dist/index.d.mts

@@ -1,7 +1,7 @@
-import { A as TraversalOptions, B as WeightedWalkOptions, C as NodeChange, D as PortDirection, E as PortConfig, I as VisualNode, L as VisualPort, M as VisualGraph, N as VisualGraphConfig, O as SinglePathOptions, P as VisualGraphEntity, R as WalkContext, S as MSTOptions, T as PathOptions, _ as GraphNode, a as EdgeChange, b as GraphPort, c as EntitiesUpdate, d as GraphConfig, f as GraphDiff, g as GraphFormatConverter, h as GraphEntityConfig, i as DeleteNodeOptions, j as VisualEdge, k as TransitionOptions, l as EntityRect, m as GraphEntity, n as AllPairsShortestPathsOptions, o as EdgeConfig, p as GraphEdge, r as CoverageStats, s as EntitiesConfig, t as AStarOptions, u as Graph, v as GraphPatch, w as NodeConfig, x as GraphStep, y as GraphPath, z as WalkOptions } from "./types-BzckPChi.mjs";
-import { A as getArticulationPoints, B as HITSResult, C as hasPath, D as joinPaths, E as isTree, F as genGirvanNewmanCommunities, G as getEigenvectorCentrality, H as getBetweennessCentrality, I as getGirvanNewmanCommunities, J as getOutDegreeCentrality, K as getHITS, L as getGreedyModularityCommunities, M as getBridges, N as GirvanNewmanOptions, O as IsomorphismOptions, P as LabelPropagationOptions, R as getLabelPropagationCommunities, S as getTopologicalSort, T as isConnected, U as getClosenessCentrality, V as IterativeCentralityOptions, W as getDegreeCentrality, Y as getPageRank, _ as getShortestPath, a as genPreorders, b as getSimplePaths, c as getAStarPath, d as getCycles, f as getMinimumSpanningTree, g as getPreorders, h as getPreorder, i as genPostorders, j as getBiconnectedComponents, k as isIsomorphic, l as getAllPairsShortestPaths, m as getPostorders, n as dfs, o as genShortestPaths, p as getPostorder, q as getInDegreeCentrality, r as genCycles, s as genSimplePaths, t as bfs, u as getConnectedComponents, v as getShortestPaths, w as isAcyclic, x as getStronglyConnectedComponents, y as getSimplePath, z as getModularity } from "./algorithms-g2uWmPrb.mjs";
+import { A as VisualEdge, C as NodeConfig, D as SinglePathOptions, E as PortDirection, F as VisualNode, I as VisualPort, L as WalkContext, M as VisualGraphConfig, N as VisualGraphEntity, O as TransitionOptions, P as VisualGraphFormatConverter, R as WalkOptions, S as NodeChange, T as PortConfig, _ as GraphPatch, a as EdgeChange, b as GraphStep, c as EntitiesUpdate, d as GraphConfig, f as GraphDiff, g as GraphNode, h as GraphFormatConverter, i as DeleteNodeOptions, j as VisualGraph, k as TraversalOptions, l as EntityRect, m as GraphEntity, n as AllPairsShortestPathsOptions, o as EdgeConfig, p as GraphEdge, r as CoverageStats, s as EntitiesConfig, t as AStarOptions, u as Graph, v as GraphPath, w as PathOptions, x as MSTOptions, y as GraphPort, z as WeightedWalkOptions } from "./types-F3j-sr2X.mjs";
+import { A as getArticulationPoints, B as HITSResult, C as hasPath, D as joinPaths, E as isTree, F as genGirvanNewmanCommunities, G as getEigenvectorCentrality, H as getBetweennessCentrality, I as getGirvanNewmanCommunities, J as getOutDegreeCentrality, K as getHITS, L as getGreedyModularityCommunities, M as getBridges, N as GirvanNewmanOptions, O as IsomorphismOptions, P as LabelPropagationOptions, R as getLabelPropagationCommunities, S as getTopologicalSort, T as isConnected, U as getClosenessCentrality, V as IterativeCentralityOptions, W as getDegreeCentrality, Y as getPageRank, _ as getShortestPath, a as genPreorders, b as getSimplePaths, c as getAStarPath, d as getCycles, f as getMinimumSpanningTree, g as getPreorders, h as getPreorder, i as genPostorders, j as getBiconnectedComponents, k as isIsomorphic, l as getAllPairsShortestPaths, m as getPostorders, n as dfs, o as genShortestPaths, p as getPostorder, q as getInDegreeCentrality, r as genCycles, s as genSimplePaths, t as bfs, u as getConnectedComponents, v as getShortestPaths, w as isAcyclic, x as getStronglyConnectedComponents, y as getSimplePath, z as getModularity } from "./algorithms-DdjFO-ft.mjs";
 import { createFormatConverter } from "./formats/converter/index.mjs";
-import { getAncestors, getChildren, getDegree, getDepth, getDescendants, getEdgeBetween, getEdgesByPort, getEdgesOf, getInDegree, getInEdges, getLCA, getNeighbors, getOutDegree, getOutEdges, getParent, getPort, getPorts, getPredecessors, getRelativeDistance, getRelativeDistanceMap, getRoots, getSiblings, getSinks, getSources, getSuccessors, isCompound, isLeaf } from "./queries.mjs";
+import { getAncestors, getChildren, getDegree, getDepth, getDescendants, getEdgesBetween, getEdgesByPort, getEdgesOf, getInDegree, getInEdges, getLCA, getNeighbors, getOutDegree, getOutEdges, getParent, getPort, getPorts, getPredecessors, getRelativeDistance, getRelativeDistanceMap, getRoots, getSiblings, getSinks, getSources, getSuccessors, isCompound, isLeaf } from "./queries.mjs";
 
 //#region src/graph.d.ts
 
@@ -112,7 +112,7 @@ declare function getNode<N>(graph: Graph<N>, id: string): GraphNode<N> | undefin
  * const missing = getEdge(graph, 'z'); // undefined
  * ```
  */
-declare function getEdge<E>(graph: Graph<any, E>, id: string): GraphEdge<E> | undefined;
+declare function getEdge<N, E>(graph: Graph<N, E>, id: string): GraphEdge<E> | undefined;
 /**
  * Check if a node exists in the graph.
  *
@@ -161,7 +161,7 @@ declare function addNode<N, P = any>(graph: Graph<N, any, any, P>, config: NodeC
  * // graph.edges.length === 1
  * ```
  */
-declare function addEdge<E>(graph: Graph<any, E>, config: EdgeConfig<E>): GraphEdge<E>;
+declare function addEdge<N, E>(graph: Graph<N, E>, config: EdgeConfig<E>): GraphEdge<E>;
 /**
  * **Mutable.** Delete a node and its connected edges. Mutates `graph.nodes`
  * and `graph.edges` in place.
@@ -220,7 +220,7 @@ declare function updateNode<N, P = any>(graph: Graph<N, any, any, P>, id: string
  * // updated.label === 'new'
  * ```
  */
-declare function updateEdge<E>(graph: Graph<any, E>, id: string, update: Partial<Omit<EdgeConfig<E>, 'id'>>): GraphEdge<E>;
+declare function updateEdge<N, E>(graph: Graph<N, E>, id: string, update: Partial<Omit<EdgeConfig<E>, 'id'>>): GraphEdge<E>;
 /**
  * **Mutable.** Add multiple nodes and edges to the graph.
  * Nodes are added first, then edges (so edges can reference new nodes).
@@ -628,4 +628,4 @@ declare function getCoverage<N, E>(graph: Graph<N, E>, steps: GraphStep<N, E>[],
   from?: string;
 }): CoverageStats;
 //#endregion
-export { type AStarOptions, type AllPairsShortestPathsOptions, type CoverageStats, type DeleteNodeOptions, type EdgeChange, type EdgeConfig, type EntitiesConfig, type EntitiesUpdate, type GirvanNewmanOptions, type Graph, type GraphConfig, type GraphDiff, type GraphEdge, type GraphEntity, type GraphEntityConfig, type GraphFormatConverter, GraphInstance, type GraphNode, type GraphPatch, type GraphPath, type GraphPort, type GraphStep, type HITSResult, type IsomorphismOptions, type IterativeCentralityOptions, LAYOUT_KEYS, type LabelPropagationOptions, type MSTOptions, type NodeChange, type NodeConfig, type PathOptions, type PortConfig, type PortDirection, type EntityRect as Positioned, type SinglePathOptions, type TransitionOptions, type TraversalOptions, type VisualEdge, type VisualGraph, type VisualGraphConfig, type VisualGraphEntity, type VisualNode, type VisualPort, type WalkContext, type WalkOptions, type WeightedWalkOptions, addEdge, addEntities, addNode, applyPatches, areEntitiesEqual, bfs, createFormatConverter, createGraph, createGraphEdge, createGraphFromTransition, createGraphNode, createGraphPort, createVisualGraph, deleteEdge, deleteEntities, deleteNode, dfs, flatten, genCycles, genGirvanNewmanCommunities, genPostorders, genPredefinedWalk, genPreorders, genQuickRandomWalk, genRandomWalk, genShortestPaths, genSimplePaths, genWeightedRandomWalk, getAStarPath, getAllPairsShortestPaths, getAncestors, getArticulationPoints, getBetweennessCentrality, getBiconnectedComponents, getBridges, getChildren, getClosenessCentrality, getConnectedComponents, getCoverage, getCycles, getDegree, getDegreeCentrality, getDepth, getDescendants, getDiff, getEdge, getEdgeBetween, getEdgesByPort, getEdgesOf, getEigenvectorCentrality, getGirvanNewmanCommunities, getGreedyModularityCommunities, getHITS, getInDegree, getInDegreeCentrality, getInEdges, getLCA, getLabelPropagationCommunities, getMinimumSpanningTree, getModularity, getNeighbors, getNode, getOutDegree, getOutDegreeCentrality, getOutEdges, getPageRank, getParent, getPatches, getPort, getPorts, getPostorder, getPostorders, getPredecessors, getPreorder, getPreorders, getRelativeDistance, getRelativeDistanceMap, getRoots, getShortestPath, getShortestPaths, getSiblings, getSimplePath, getSimplePaths, getSinks, getSources, getStronglyConnectedComponents, getSubgraph, getSuccessors, getTopologicalSort, hasEdge, hasNode, hasPath, invalidateIndex, invertDiff, isAcyclic, isCompound, isConnected, isEmptyDiff, isIsomorphic, isLayoutEqual, isLeaf, isNonLayoutEqual, isTree, joinPaths, reverseGraph, takeSteps, takeUntilEdge, takeUntilEdgeCoverage, takeUntilNode, takeUntilNodeCoverage, toDiff, toPatches, updateEdge, updateEntities, updateNode };
+export { type AStarOptions, type AllPairsShortestPathsOptions, type CoverageStats, type DeleteNodeOptions, type EdgeChange, type EdgeConfig, type EntitiesConfig, type EntitiesUpdate, type EntityRect, type GirvanNewmanOptions, type Graph, type GraphConfig, type GraphDiff, type GraphEdge, type GraphEntity, type GraphFormatConverter, GraphInstance, type GraphNode, type GraphPatch, type GraphPath, type GraphPort, type GraphStep, type HITSResult, type IsomorphismOptions, type IterativeCentralityOptions, LAYOUT_KEYS, type LabelPropagationOptions, type MSTOptions, type NodeChange, type NodeConfig, type PathOptions, type PortConfig, type PortDirection, type SinglePathOptions, type TransitionOptions, type TraversalOptions, type VisualEdge, type VisualGraph, type VisualGraphConfig, type VisualGraphEntity, type VisualGraphFormatConverter, type VisualNode, type VisualPort, type WalkContext, type WalkOptions, type WeightedWalkOptions, addEdge, addEntities, addNode, applyPatches, areEntitiesEqual, bfs, createFormatConverter, createGraph, createGraphEdge, createGraphFromTransition, createGraphNode, createGraphPort, createVisualGraph, deleteEdge, deleteEntities, deleteNode, dfs, flatten, genCycles, genGirvanNewmanCommunities, genPostorders, genPredefinedWalk, genPreorders, genQuickRandomWalk, genRandomWalk, genShortestPaths, genSimplePaths, genWeightedRandomWalk, getAStarPath, getAllPairsShortestPaths, getAncestors, getArticulationPoints, getBetweennessCentrality, getBiconnectedComponents, getBridges, getChildren, getClosenessCentrality, getConnectedComponents, getCoverage, getCycles, getDegree, getDegreeCentrality, getDepth, getDescendants, getDiff, getEdge, getEdgesBetween, getEdgesByPort, getEdgesOf, getEigenvectorCentrality, getGirvanNewmanCommunities, getGreedyModularityCommunities, getHITS, getInDegree, getInDegreeCentrality, getInEdges, getLCA, getLabelPropagationCommunities, getMinimumSpanningTree, getModularity, getNeighbors, getNode, getOutDegree, getOutDegreeCentrality, getOutEdges, getPageRank, getParent, getPatches, getPort, getPorts, getPostorder, getPostorders, getPredecessors, getPreorder, getPreorders, getRelativeDistance, getRelativeDistanceMap, getRoots, getShortestPath, getShortestPaths, getSiblings, getSimplePath, getSimplePaths, getSinks, getSources, getStronglyConnectedComponents, getSubgraph, getSuccessors, getTopologicalSort, hasEdge, hasNode, hasPath, invalidateIndex, invertDiff, isAcyclic, isCompound, isConnected, isEmptyDiff, isIsomorphic, isLayoutEqual, isLeaf, isNonLayoutEqual, isTree, joinPaths, reverseGraph, takeSteps, takeUntilEdge, takeUntilEdgeCoverage, takeUntilNode, takeUntilNodeCoverage, toDiff, toPatches, updateEdge, updateEntities, updateNode };

package/dist/index.mjs

@@ -1,6 +1,6 @@
 import { o as invalidateIndex, t as getIndex } from "./indexing-DyfgLuzw.mjs";
-import { $ as createGraphPort, A as getBiconnectedComponents, B as getEigenvectorCentrality, C as hasPath, D as joinPaths, E as isTree, F as getLabelPropagationCommunities, G as GraphInstance, H as getInDegreeCentrality, I as getModularity, J as addNode, K as addEdge, L as getBetweennessCentrality, M as genGirvanNewmanCommunities, N as getGirvanNewmanCommunities, O as isIsomorphic, P as getGreedyModularityCommunities, Q as createGraphNode, R as getClosenessCentrality, S as getTopologicalSort, T as isConnected, U as getOutDegreeCentrality, V as getHITS, W as getPageRank, X as createGraphEdge, Y as createGraph, Z as createGraphFromTransition, _ as getShortestPath, a as genPreorders, at as getNode, b as getSimplePaths, c as getAStarPath, ct as updateEdge, d as getCycles, et as createVisualGraph, f as getMinimumSpanningTree, g as getPreorders, h as getPreorder, i as genPostorders, it as getEdge, j as getBridges, k as getArticulationPoints, l as getAllPairsShortestPaths, lt as updateEntities, m as getPostorders, n as dfs, nt as deleteEntities, o as genShortestPaths, ot as hasEdge, p as getPostorder, q as addEntities, r as genCycles, rt as deleteNode, s as genSimplePaths, st as hasNode, t as bfs, tt as deleteEdge, u as getConnectedComponents, ut as updateNode, v as getShortestPaths, w as isAcyclic, x as getStronglyConnectedComponents, y as getSimplePath, z as getDegreeCentrality } from "./algorithms-3xvCxHzo.mjs";
-import { getAncestors, getChildren, getDegree, getDepth, getDescendants, getEdgeBetween, getEdgesByPort, getEdgesOf, getInDegree, getInEdges, getLCA, getNeighbors, getOutDegree, getOutEdges, getParent, getPort, getPorts, getPredecessors, getRelativeDistance, getRelativeDistanceMap, getRoots, getSiblings, getSinks, getSources, getSuccessors, isCompound, isLeaf } from "./queries.mjs";
+import { $ as createGraphPort, A as getBiconnectedComponents, B as getEigenvectorCentrality, C as hasPath, D as joinPaths, E as isTree, F as getLabelPropagationCommunities, G as GraphInstance, H as getInDegreeCentrality, I as getModularity, J as addNode, K as addEdge, L as getBetweennessCentrality, M as genGirvanNewmanCommunities, N as getGirvanNewmanCommunities, O as isIsomorphic, P as getGreedyModularityCommunities, Q as createGraphNode, R as getClosenessCentrality, S as getTopologicalSort, T as isConnected, U as getOutDegreeCentrality, V as getHITS, W as getPageRank, X as createGraphEdge, Y as createGraph, Z as createGraphFromTransition, _ as getShortestPath, a as genPreorders, at as getNode, b as getSimplePaths, c as getAStarPath, ct as updateEdge, d as getCycles, et as createVisualGraph, f as getMinimumSpanningTree, g as getPreorders, h as getPreorder, i as genPostorders, it as getEdge, j as getBridges, k as getArticulationPoints, l as getAllPairsShortestPaths, lt as updateEntities, m as getPostorders, n as dfs, nt as deleteEntities, o as genShortestPaths, ot as hasEdge, p as getPostorder, q as addEntities, r as genCycles, rt as deleteNode, s as genSimplePaths, st as hasNode, t as bfs, tt as deleteEdge, u as getConnectedComponents, ut as updateNode, v as getShortestPaths, w as isAcyclic, x as getStronglyConnectedComponents, y as getSimplePath, z as getDegreeCentrality } from "./algorithms-C-S7u40k.mjs";
+import { getAncestors, getChildren, getDegree, getDepth, getDescendants, getEdgesBetween, getEdgesByPort, getEdgesOf, getInDegree, getInEdges, getLCA, getNeighbors, getOutDegree, getOutEdges, getParent, getPort, getPorts, getPredecessors, getRelativeDistance, getRelativeDistanceMap, getRoots, getSiblings, getSinks, getSources, getSuccessors, isCompound, isLeaf } from "./queries.mjs";
 import { n as createFormatConverter } from "./converter-B5CUD0r9.mjs";
 
 //#region src/equivalence.ts
@@ -905,4 +905,4 @@ function getCoverage(graph, steps, options) {
 }
 
 //#endregion
-export { GraphInstance, LAYOUT_KEYS, addEdge, addEntities, addNode, applyPatches, areEntitiesEqual, bfs, createFormatConverter, createGraph, createGraphEdge, createGraphFromTransition, createGraphNode, createGraphPort, createVisualGraph, deleteEdge, deleteEntities, deleteNode, dfs, flatten, genCycles, genGirvanNewmanCommunities, genPostorders, genPredefinedWalk, genPreorders, genQuickRandomWalk, genRandomWalk, genShortestPaths, genSimplePaths, genWeightedRandomWalk, getAStarPath, getAllPairsShortestPaths, getAncestors, getArticulationPoints, getBetweennessCentrality, getBiconnectedComponents, getBridges, getChildren, getClosenessCentrality, getConnectedComponents, getCoverage, getCycles, getDegree, getDegreeCentrality, getDepth, getDescendants, getDiff, getEdge, getEdgeBetween, getEdgesByPort, getEdgesOf, getEigenvectorCentrality, getGirvanNewmanCommunities, getGreedyModularityCommunities, getHITS, getInDegree, getInDegreeCentrality, getInEdges, getLCA, getLabelPropagationCommunities, getMinimumSpanningTree, getModularity, getNeighbors, getNode, getOutDegree, getOutDegreeCentrality, getOutEdges, getPageRank, getParent, getPatches, getPort, getPorts, getPostorder, getPostorders, getPredecessors, getPreorder, getPreorders, getRelativeDistance, getRelativeDistanceMap, getRoots, getShortestPath, getShortestPaths, getSiblings, getSimplePath, getSimplePaths, getSinks, getSources, getStronglyConnectedComponents, getSubgraph, getSuccessors, getTopologicalSort, hasEdge, hasNode, hasPath, invalidateIndex, invertDiff, isAcyclic, isCompound, isConnected, isEmptyDiff, isIsomorphic, isLayoutEqual, isLeaf, isNonLayoutEqual, isTree, joinPaths, reverseGraph, takeSteps, takeUntilEdge, takeUntilEdgeCoverage, takeUntilNode, takeUntilNodeCoverage, toDiff, toPatches, updateEdge, updateEntities, updateNode };
+export { GraphInstance, LAYOUT_KEYS, addEdge, addEntities, addNode, applyPatches, areEntitiesEqual, bfs, createFormatConverter, createGraph, createGraphEdge, createGraphFromTransition, createGraphNode, createGraphPort, createVisualGraph, deleteEdge, deleteEntities, deleteNode, dfs, flatten, genCycles, genGirvanNewmanCommunities, genPostorders, genPredefinedWalk, genPreorders, genQuickRandomWalk, genRandomWalk, genShortestPaths, genSimplePaths, genWeightedRandomWalk, getAStarPath, getAllPairsShortestPaths, getAncestors, getArticulationPoints, getBetweennessCentrality, getBiconnectedComponents, getBridges, getChildren, getClosenessCentrality, getConnectedComponents, getCoverage, getCycles, getDegree, getDegreeCentrality, getDepth, getDescendants, getDiff, getEdge, getEdgesBetween, getEdgesByPort, getEdgesOf, getEigenvectorCentrality, getGirvanNewmanCommunities, getGreedyModularityCommunities, getHITS, getInDegree, getInDegreeCentrality, getInEdges, getLCA, getLabelPropagationCommunities, getMinimumSpanningTree, getModularity, getNeighbors, getNode, getOutDegree, getOutDegreeCentrality, getOutEdges, getPageRank, getParent, getPatches, getPort, getPorts, getPostorder, getPostorders, getPredecessors, getPreorder, getPreorders, getRelativeDistance, getRelativeDistanceMap, getRoots, getShortestPath, getShortestPaths, getSiblings, getSimplePath, getSimplePaths, getSinks, getSources, getStronglyConnectedComponents, getSubgraph, getSuccessors, getTopologicalSort, hasEdge, hasNode, hasPath, invalidateIndex, invertDiff, isAcyclic, isCompound, isConnected, isEmptyDiff, isIsomorphic, isLayoutEqual, isLeaf, isNonLayoutEqual, isTree, joinPaths, reverseGraph, takeSteps, takeUntilEdge, takeUntilEdgeCoverage, takeUntilNode, takeUntilNodeCoverage, toDiff, toPatches, updateEdge, updateEntities, updateNode };

package/dist/queries.d.mts

@@ -1,4 +1,4 @@
-import { _ as GraphNode, b as GraphPort, p as GraphEdge, u as Graph } from "./types-BzckPChi.mjs";
+import { g as GraphNode, p as GraphEdge, u as Graph, y as GraphPort } from "./types-F3j-sr2X.mjs";
 
 //#region src/queries.d.ts
 
@@ -18,7 +18,7 @@ import { _ as GraphNode, b as GraphPort, p as GraphEdge, u as Graph } from "./ty
  * // => [edge e1, edge e2]
  * ```
  */
-declare function getEdgesOf<E>(graph: Graph<any, E>, nodeId: string): GraphEdge<E>[];
+declare function getEdgesOf<N, E>(graph: Graph<N, E>, nodeId: string): GraphEdge<E>[];
 /**
  * Returns incoming edges to a node.
  *
@@ -34,7 +34,7 @@ declare function getEdgesOf<E>(graph: Graph<any, E>, nodeId: string): GraphEdge<
  * // => []
  * ```
  */
-declare function getInEdges<E>(graph: Graph<any, E>, nodeId: string): GraphEdge<E>[];
+declare function getInEdges<N, E>(graph: Graph<N, E>, nodeId: string): GraphEdge<E>[];
 /**
  * Returns outgoing edges from a node.
  *
@@ -50,9 +50,9 @@ declare function getInEdges<E>(graph: Graph<any, E>, nodeId: string): GraphEdge<
  * // => []
  * ```
  */
-declare function getOutEdges<E>(graph: Graph<any, E>, nodeId: string): GraphEdge<E>[];
+declare function getOutEdges<N, E>(graph: Graph<N, E>, nodeId: string): GraphEdge<E>[];
 /**
- * Returns the edge from `sourceId` to `targetId`, or `undefined` if none exists.
+ * Returns all edges from `sourceId` to `targetId`.
  * For undirected graphs, checks both directions.
  *
  * @example
@@ -61,13 +61,13 @@ declare function getOutEdges<E>(graph: Graph<any, E>, nodeId: string): GraphEdge
  *   nodes: [{ id: 'a' }, { id: 'b' }],
  *   edges: [{ id: 'e1', sourceId: 'a', targetId: 'b' }],
  * });
- * getEdgeBetween(graph, 'a', 'b');
- * // => edge e1
- * getEdgeBetween(graph, 'b', 'a');
- * // => undefined (directed graph)
+ * getEdgesBetween(graph, 'a', 'b');
+ * // => [edge e1]
+ * getEdgesBetween(graph, 'b', 'a');
+ * // => [] (directed graph)
  * ```
  */
-declare function getEdgeBetween<E>(graph: Graph<any, E>, sourceId: string, targetId: string): GraphEdge<E> | undefined;
+declare function getEdgesBetween<N, E>(graph: Graph<N, E>, sourceId: string, targetId: string): GraphEdge<E>[];
 /**
  * Returns direct successor nodes (targets of outgoing edges).
  *
@@ -469,7 +469,7 @@ declare function getSinks<N>(graph: Graph<N>): GraphNode<N>[];
  * getPort(graph, 'a', 'missing'); // => undefined
  * ```
  */
-declare function getPort<P = any>(graph: Graph<any, any, any, P>, nodeId: string, portName: string): GraphPort<P> | undefined;
+declare function getPort<N, E, G, P>(graph: Graph<N, E, G, P>, nodeId: string, portName: string): GraphPort<P> | undefined;
 /**
  * Get all ports on a node. Returns `[]` if the node has no ports or doesn't exist.
  *
@@ -487,7 +487,7 @@ declare function getPort<P = any>(graph: Graph<any, any, any, P>, nodeId: string
  * getPorts(graph, 'a'); // => [port in, port out]
  * ```
  */
-declare function getPorts<P = any>(graph: Graph<any, any, any, P>, nodeId: string): GraphPort<P>[];
+declare function getPorts<N, E, G, P>(graph: Graph<N, E, G, P>, nodeId: string): GraphPort<P>[];
 /**
  * Get all edges connected to a specific port on a node.
  *
@@ -510,6 +510,6 @@ declare function getPorts<P = any>(graph: Graph<any, any, any, P>, nodeId: strin
  * getEdgesByPort(graph, 'a', 'out'); // => [edge e1]
  * ```
  */
-declare function getEdgesByPort<E = any>(graph: Graph<any, E>, nodeId: string, portName: string): GraphEdge<E>[];
+declare function getEdgesByPort<N, E>(graph: Graph<N, E>, nodeId: string, portName: string): GraphEdge<E>[];
 //#endregion
-export { getAncestors, getChildren, getDegree, getDepth, getDescendants, getEdgeBetween, getEdgesByPort, getEdgesOf, getInDegree, getInEdges, getLCA, getNeighbors, getOutDegree, getOutEdges, getParent, getPort, getPorts, getPredecessors, getRelativeDistance, getRelativeDistanceMap, getRoots, getSiblings, getSinks, getSources, getSuccessors, isCompound, isLeaf };
+export { getAncestors, getChildren, getDegree, getDepth, getDescendants, getEdgesBetween, getEdgesByPort, getEdgesOf, getInDegree, getInEdges, getLCA, getNeighbors, getOutDegree, getOutEdges, getParent, getPort, getPorts, getPredecessors, getRelativeDistance, getRelativeDistanceMap, getRoots, getSiblings, getSinks, getSources, getSuccessors, isCompound, isLeaf };

package/dist/queries.mjs

@@ -73,7 +73,7 @@ function getOutEdges(graph, nodeId) {
 	return (idx.outEdges.get(nodeId) ?? []).map((eid) => graph.edges[idx.edgeById.get(eid)]);
 }
 /**
-* Returns the edge from `sourceId` to `targetId`, or `undefined` if none exists.
+* Returns all edges from `sourceId` to `targetId`.
 * For undirected graphs, checks both directions.
 *
 * @example
@@ -82,28 +82,35 @@ function getOutEdges(graph, nodeId) {
 *   nodes: [{ id: 'a' }, { id: 'b' }],
 *   edges: [{ id: 'e1', sourceId: 'a', targetId: 'b' }],
 * });
-* getEdgeBetween(graph, 'a', 'b');
-* // => edge e1
-* getEdgeBetween(graph, 'b', 'a');
-* // => undefined (directed graph)
+* getEdgesBetween(graph, 'a', 'b');
+* // => [edge e1]
+* getEdgesBetween(graph, 'b', 'a');
+* // => [] (directed graph)
 * ```
 */
-function getEdgeBetween(graph, sourceId, targetId) {
+function getEdgesBetween(graph, sourceId, targetId) {
 	const idx = getIndex(graph);
+	const result = [];
+	const seen = /* @__PURE__ */ new Set();
 	const outIds = idx.outEdges.get(sourceId) ?? [];
 	for (const eid of outIds) {
 		const ai = idx.edgeById.get(eid);
 		const e = graph.edges[ai];
-		if (e.targetId === targetId) return e;
+		if (e.targetId === targetId) {
+			seen.add(eid);
+			result.push(e);
+		}
 	}
 	if (graph.type === "undirected") {
 		const outIds2 = idx.outEdges.get(targetId) ?? [];
 		for (const eid of outIds2) {
+			if (seen.has(eid)) continue;
 			const ai = idx.edgeById.get(eid);
 			const e = graph.edges[ai];
-			if (e.targetId === sourceId) return e;
+			if (e.targetId === sourceId) result.push(e);
 		}
 	}
+	return result;
 }
 /**
 * Returns direct successor nodes (targets of outgoing edges).
@@ -758,4 +765,4 @@ function getEdgesByPort(graph, nodeId, portName) {
 }
 
 //#endregion
-export { getAncestors, getChildren, getDegree, getDepth, getDescendants, getEdgeBetween, getEdgesByPort, getEdgesOf, getInDegree, getInEdges, getLCA, getNeighbors, getOutDegree, getOutEdges, getParent, getPort, getPorts, getPredecessors, getRelativeDistance, getRelativeDistanceMap, getRoots, getSiblings, getSinks, getSources, getSuccessors, isCompound, isLeaf };
+export { getAncestors, getChildren, getDegree, getDepth, getDescendants, getEdgesBetween, getEdgesByPort, getEdgesOf, getInDegree, getInEdges, getLCA, getNeighbors, getOutDegree, getOutEdges, getParent, getPort, getPorts, getPredecessors, getRelativeDistance, getRelativeDistanceMap, getRoots, getSiblings, getSinks, getSources, getSuccessors, isCompound, isLeaf };

package/dist/{types-BzckPChi.d.mts → types-F3j-sr2X.d.mts}

@@ -5,16 +5,14 @@ interface EntityRect {
   width: number;
   height: number;
 }
-/** Config-level base — shared optional visual/style props for nodes, edges, ports. */
-interface GraphEntityConfig {
+/** Shared optional visual/style props for nodes, edges, ports. */
+interface GraphEntity {
   x?: number;
   y?: number;
   width?: number;
   height?: number;
   style?: Record<string, string | number>;
 }
-/** Resolved entity base — optional visual props (non-visual graphs may omit). */
-interface GraphEntity extends GraphEntityConfig {}
 /** Visual entity base — required position/size. */
 interface VisualGraphEntity {
   x: number;
@@ -24,7 +22,7 @@ interface VisualGraphEntity {
   style?: Record<string, string | number>;
 }
 type PortDirection = 'in' | 'out' | 'inout';
-interface PortConfig<TPortData = any> extends GraphEntityConfig {
+interface PortConfig<TPortData = any> extends GraphEntity {
   name: string;
   direction?: PortDirection;
   label?: string;
@@ -36,7 +34,12 @@ interface GraphPort<TPortData = any> extends GraphEntity {
   label?: string;
   data: TPortData;
 }
-interface VisualPort<TPortData = any> extends Omit<GraphPort<TPortData>, keyof EntityRect>, VisualGraphEntity {}
+interface VisualPort<TPortData = any> extends GraphPort<TPortData> {
+  x: number;
+  y: number;
+  width: number;
+  height: number;
+}
 interface GraphConfig<TNodeData = any, TEdgeData = any, TGraphData = any, TPortData = any> {
   id?: string;
   type?: 'directed' | 'undirected';
@@ -47,17 +50,17 @@ interface GraphConfig<TNodeData = any, TEdgeData = any, TGraphData = any, TPortD
   direction?: 'up' | 'down' | 'left' | 'right';
   style?: Record<string, string | number>;
 }
-interface NodeConfig<TNodeData = any, TPortData = any> extends GraphEntityConfig {
+interface NodeConfig<TNodeData = any, TPortData = any> extends GraphEntity {
   id: string;
   parentId?: string | null;
   initialNodeId?: string;
-  label?: string;
+  label?: string | null;
   data?: TNodeData;
   ports?: PortConfig<TPortData>[];
   shape?: string;
   color?: string;
 }
-interface EdgeConfig<TEdgeData = any> extends GraphEntityConfig {
+interface EdgeConfig<TEdgeData = any> extends GraphEntity {
   /**
    * The id of the edge.
    */
@@ -102,7 +105,7 @@ interface GraphNode<TNodeData = any, TPortData = any> extends GraphEntity {
   id: string;
   parentId?: string | null;
   initialNodeId?: string | null;
-  label?: string;
+  label?: string | null;
   data: TNodeData;
   ports?: GraphPort<TPortData>[];
   shape?: string;
@@ -127,11 +130,19 @@ interface GraphEdge<TEdgeData = any> extends GraphEntity {
   data: TEdgeData;
   color?: string;
 }
-interface VisualNode<TNodeData = any, TPortData = any> extends Omit<GraphNode<TNodeData, TPortData>, keyof EntityRect>, VisualGraphEntity {
-  shape?: string;
+interface VisualNode<TNodeData = any, TPortData = any> extends GraphNode<TNodeData, TPortData> {
+  x: number;
+  y: number;
+  width: number;
+  height: number;
   ports?: VisualPort<TPortData>[];
 }
-interface VisualEdge<TEdgeData = any> extends Omit<GraphEdge<TEdgeData>, keyof EntityRect>, VisualGraphEntity {}
+interface VisualEdge<TEdgeData = any> extends GraphEdge<TEdgeData> {
+  x: number;
+  y: number;
+  width: number;
+  height: number;
+}
 interface VisualGraph<TNodeData = any, TEdgeData = any, TGraphData = any, TPortData = any> extends Omit<Graph<TNodeData, TEdgeData, TGraphData, TPortData>, 'nodes' | 'edges'> {
   nodes: VisualNode<TNodeData, TPortData>[];
   edges: VisualEdge<TEdgeData>[];
@@ -176,6 +187,8 @@ interface PathOptions<TEdgeData = any> {
   to?: string;
   /** Edge weight function. Default: `(e) => e.weight ?? 1`. */
   getWeight?: (edge: GraphEdge<TEdgeData>) => number;
+  /** Algorithm to use. Default: 'dijkstra'. Use 'bellman-ford' for negative weights. */
+  algorithm?: 'dijkstra' | 'bellman-ford';
 }
 interface SinglePathOptions<TEdgeData = any> {
   /** Source node ID. Default: graph.initialNodeId, else sole inDegree-0 node */
@@ -184,6 +197,8 @@ interface SinglePathOptions<TEdgeData = any> {
   to: string;
   /** Edge weight function. Default: `(e) => e.weight ?? 1`. */
   getWeight?: (edge: GraphEdge<TEdgeData>) => number;
+  /** Algorithm to use. Default: 'dijkstra'. Use 'bellman-ford' for negative weights. */
+  algorithm?: 'dijkstra' | 'bellman-ford';
 }
 interface AStarOptions<TEdgeData = any> {
   /** Source node ID. */
@@ -209,8 +224,8 @@ interface MSTOptions<TEdgeData = any> {
   getWeight?: (edge: GraphEdge<TEdgeData>) => number;
 }
 interface AllPairsShortestPathsOptions<TEdgeData = any> {
-  /** Algorithm to use. Default: 'dijkstra'. */
-  algorithm?: 'floyd-warshall' | 'dijkstra';
+  /** Algorithm to use. Default: 'dijkstra'. Use 'bellman-ford' for negative weights. */
+  algorithm?: 'floyd-warshall' | 'dijkstra' | 'bellman-ford';
   /** Edge weight function. Default: `(e) => e.weight ?? 1`. */
   getWeight?: (edge: GraphEdge<TEdgeData>) => number;
 }
@@ -337,4 +352,4 @@ interface TransitionOptions<TState, TEvent> {
   id?: string;
 }
 //#endregion
-export { TraversalOptions as A, WeightedWalkOptions as B, NodeChange as C, PortDirection as D, PortConfig as E, VisualGraphFormatConverter as F, VisualNode as I, VisualPort as L, VisualGraph as M, VisualGraphConfig as N, SinglePathOptions as O, VisualGraphEntity as P, WalkContext as R, MSTOptions as S, PathOptions as T, GraphNode as _, EdgeChange as a, GraphPort as b, EntitiesUpdate as c, GraphConfig as d, GraphDiff as f, GraphFormatConverter as g, GraphEntityConfig as h, DeleteNodeOptions as i, VisualEdge as j, TransitionOptions as k, EntityRect as l, GraphEntity as m, AllPairsShortestPathsOptions as n, EdgeConfig as o, GraphEdge as p, CoverageStats as r, EntitiesConfig as s, AStarOptions as t, Graph as u, GraphPatch as v, NodeConfig as w, GraphStep as x, GraphPath as y, WalkOptions as z };
+export { VisualEdge as A, NodeConfig as C, SinglePathOptions as D, PortDirection as E, VisualNode as F, VisualPort as I, WalkContext as L, VisualGraphConfig as M, VisualGraphEntity as N, TransitionOptions as O, VisualGraphFormatConverter as P, WalkOptions as R, NodeChange as S, PortConfig as T, GraphPatch as _, EdgeChange as a, GraphStep as b, EntitiesUpdate as c, GraphConfig as d, GraphDiff as f, GraphNode as g, GraphFormatConverter as h, DeleteNodeOptions as i, VisualGraph as j, TraversalOptions as k, EntityRect as l, GraphEntity as m, AllPairsShortestPathsOptions as n, EdgeConfig as o, GraphEdge as p, CoverageStats as r, EntitiesConfig as s, AStarOptions as t, Graph as u, GraphPath as v, PathOptions as w, MSTOptions as x, GraphPort as y, WeightedWalkOptions as z };

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@statelyai/graph",
   "type": "module",
-  "version": "0.9.0",
+  "version": "0.10.0",
   "description": "A TypeScript-first graph library with plain JSON-serializable objects",
   "author": "David Khourshid <david@stately.ai>",
   "license": "MIT",