@statelyai/graph 1.0.0 → 2.0.0

package/dist/algorithms.d.mts

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

package/dist/algorithms.mjs

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

package/dist/{converter-udLITX36.mjs → converter-DyCJJfTe.mjs}

@@ -1,5 +1,5 @@
-import { n as toAdjacencyList, t as fromAdjacencyList } from "./adjacency-list-VsUaH9SJ.mjs";
-import { n as toEdgeList, t as fromEdgeList } from "./edge-list-DP4otyPU.mjs";
+import { n as toAdjacencyList, t as fromAdjacencyList } from "./adjacency-list-GeL1Cu-L.mjs";
+import { n as toEdgeList, t as fromEdgeList } from "./edge-list-BcZ0h6zz.mjs";
 
 //#region src/formats/converter/index.ts
 /**

package/dist/format-support.mjs

@@ -34,7 +34,11 @@ const FORMAT_SUPPORT_MATRIX = [
 			weight: "full",
 			roundTrip: "full"
 		},
-		notes: ["Uses Cytoscape JSON element data with graph, node, and edge metadata stored in element data.", "Ports round-trip through element data as `ports`, `sourcePort`, and `targetPort`."]
+		notes: [
+			"Uses Cytoscape JSON element data with graph, node, and edge metadata stored in element data.",
+			"Ports round-trip through element data as `ports`, `sourcePort`, and `targetPort`.",
+			"Per-edge `mode` overrides (including bidirectional) round-trip through element data."
+		]
 	},
 	{
 		id: "d3",
@@ -49,7 +53,11 @@ const FORMAT_SUPPORT_MATRIX = [
 			weight: "full",
 			roundTrip: "full"
 		},
-		notes: ["Targets force-graph structures, but graph, node, and edge metadata can be preserved on the loose JSON shape.", "Ports round-trip through node/link objects."]
+		notes: [
+			"Targets force-graph structures, but graph, node, and edge metadata can be preserved on the loose JSON shape.",
+			"Ports round-trip through node/link objects.",
+			"Per-edge `mode` overrides (including bidirectional) round-trip through link objects."
+		]
 	},
 	{
 		id: "d2",
@@ -69,6 +77,7 @@ const FORMAT_SUPPORT_MATRIX = [
 			"sql_table/class fields map to ports; node.field connections round-trip as sourcePort/targetPort.",
 			"Per-edge connectors (->, <-, --, <->) map to edge.mode; the authored glyph is preserved in _d2.arrow.",
 			"vars/classes/imports are preserved on graph data; comments attach to the following entity (best-effort).",
+			"Only flat key/value vars round-trip; nested sub-blocks inside vars are dropped.",
 			"d2 has no native edge weight."
 		]
 	},
@@ -115,7 +124,11 @@ const FORMAT_SUPPORT_MATRIX = [
 			weight: "full",
 			roundTrip: "full"
 		},
-		notes: ["ELK-native layout fields are preserved directly; graph, node, port, and edge metadata round-trip through reserved layout options."]
+		notes: [
+			"ELK-native layout fields are preserved directly; graph, node, port, and edge metadata round-trip through reserved layout options.",
+			"Per-edge `mode` overrides (including bidirectional) round-trip through reserved layout options.",
+			"Port ids are emitted as `nodeId__portName` so they are document-unique as ELK requires; original port names round-trip through reserved layout options."
+		]
 	},
 	{
 		id: "gexf",
@@ -149,7 +162,11 @@ const FORMAT_SUPPORT_MATRIX = [
 			weight: "full",
 			roundTrip: "full"
 		},
-		notes: ["GML stores graph, node, and edge metadata directly or as JSON-stringified fields.", "Ports round-trip through JSON-stringified node metadata and edge fields."]
+		notes: [
+			"GML stores graph, node, and edge metadata directly or as JSON-stringified fields.",
+			"Ports round-trip through JSON-stringified node metadata and edge fields.",
+			"Per-edge `mode` overrides and graph-level bidirectional mode round-trip through a dialect `mode` key (GML `directed` is binary)."
+		]
 	},
 	{
 		id: "graphml",
@@ -162,11 +179,13 @@ const FORMAT_SUPPORT_MATRIX = [
 			visual: "partial",
 			style: "partial",
 			weight: "full",
-			roundTrip: "partial"
+			roundTrip: "full"
 		},
 		notes: [
-			"GraphML attribute fidelity is good, but not every extension is represented.",
-			"Ports round-trip through node and edge `<data>` fields.",
+			"Emit is own-dialect: a flat structure with hierarchy, ports, and metadata in `<data>` fields; the emitter does not write nested `<graph>` or native `<port>` elements.",
+			"Import handles both dialects: own-dialect `<data>` fields plus standard nested `<graph>` hierarchy, native `<port>` elements (imported as direction `inout`), and `sourceport`/`targetport` edge attributes. `<data>` fields take precedence.",
+			"Multi-graph documents import the first `<graph>` element only.",
+			"Vendor extensions (e.g. yEd visual attributes) are not represented.",
 			"Per-edge directedness round-trips via the `directed` edge attribute; bidirectional maps to directed."
 		]
 	},
@@ -183,7 +202,11 @@ const FORMAT_SUPPORT_MATRIX = [
 			weight: "full",
 			roundTrip: "full"
 		},
-		notes: ["JGF preserves graph, node, and edge metadata via `metadata` objects.", "Ports round-trip through node and edge metadata."]
+		notes: [
+			"JGF preserves graph, node, and edge metadata via `metadata` objects.",
+			"Ports round-trip through node and edge metadata.",
+			"Per-edge `mode` overrides and graph-level bidirectional mode round-trip through `metadata` (JGF `directed` is binary)."
+		]
 	},
 	{
 		id: "tgf",
@@ -213,7 +236,7 @@ const FORMAT_SUPPORT_MATRIX = [
 			weight: "full",
 			roundTrip: "full"
 		},
-		notes: ["xyflow-native fields are preserved directly; graph, node, edge, style, weight, and port metadata round-trip through reserved data fields."]
+		notes: ["xyflow-native fields are preserved directly; graph, node, edge, style, weight, port, and per-edge `mode` metadata round-trip through reserved data fields."]
 	},
 	{
 		id: "mermaid/block",
@@ -331,9 +354,13 @@ const FORMAT_SUPPORT_MATRIX = [
 			visual: "partial",
 			style: "partial",
 			weight: "none",
-			roundTrip: "full"
+			roundTrip: "partial"
 		},
-		notes: ["State-specific syntax such as notes, classes, descriptions, directions, hierarchy, and parallel regions round-trips through node and graph data."]
+		notes: [
+			"State-specific syntax such as notes, classes, descriptions, directions, hierarchy, and parallel regions round-trips through node and graph data.",
+			"Isolated plain states emit as bare state lines, and node labels emit via the `state \"label\" as id` description form — a distinct label is lost when a description is also present.",
+			"`graph.initialNodeId` round-trips as a top-level `[*] -->` transition."
+		]
 	}
 ];
 function getFormatSupportEntry(id) {

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

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

package/dist/formats/adjacency-list/index.mjs

@@ -1,3 +1,3 @@
-import { n as toAdjacencyList, t as fromAdjacencyList } from "../../adjacency-list-VsUaH9SJ.mjs";
+import { n as toAdjacencyList, t as fromAdjacencyList } from "../../adjacency-list-GeL1Cu-L.mjs";
 
 export { fromAdjacencyList, toAdjacencyList };

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

@@ -1,2 +1,2 @@
-import { n as createFormatConverter, r as edgeListConverter, t as adjacencyListConverter } from "../../index-D9Kj6Fe3.mjs";
+import { n as createFormatConverter, r as edgeListConverter, t as adjacencyListConverter } from "../../index-D51lJnt2.mjs";
 export { adjacencyListConverter, createFormatConverter, edgeListConverter };

package/dist/formats/converter/index.mjs

@@ -1,3 +1,3 @@
-import { n as createFormatConverter, r as edgeListConverter, t as adjacencyListConverter } from "../../converter-udLITX36.mjs";
+import { n as createFormatConverter, r as edgeListConverter, t as adjacencyListConverter } from "../../converter-DyCJJfTe.mjs";
 
 export { adjacencyListConverter, createFormatConverter, edgeListConverter };

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

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

package/dist/formats/cytoscape/index.mjs

@@ -1,4 +1,4 @@
-import { n as createFormatConverter } from "../../converter-udLITX36.mjs";
+import { n as createFormatConverter } from "../../converter-DyCJJfTe.mjs";
 
 //#region src/formats/cytoscape/index.ts
 /**
@@ -55,6 +55,7 @@ function toCytoscapeJSON(graph) {
 					target: e.targetId
 				};
 				if (e.label) data.label = e.label;
+				if (e.mode) data.mode = e.mode;
 				if (e.data !== void 0) data.edgeData = e.data;
 				if (e.weight !== void 0) data.weight = e.weight;
 				if (e.x !== void 0) data.x = e.x;
@@ -121,6 +122,7 @@ function fromCytoscapeJSON(cyto) {
 			sourceId: e.data.source,
 			targetId: e.data.target,
 			label: e.data.label ?? "",
+			...e.data.mode && { mode: e.data.mode },
 			data: e.data.edgeData,
 			...e.data.weight !== void 0 && { weight: e.data.weight },
 			...e.data.x !== void 0 && { x: e.data.x },

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

@@ -1,4 +1,4 @@
-import { h as GraphFormatConverter, u as Graph } from "../../types-3-FS9NV2.mjs";
+import { d as Graph, g as GraphFormatConverter } from "../../types-DNYdIU21.mjs";
 
 //#region src/formats/d2/shared.d.ts
 type D2Arrow = '->' | '<-' | '--' | '<->';

package/dist/formats/d2/index.mjs

@@ -1,4 +1,4 @@
-import { n as createFormatConverter } from "../../converter-udLITX36.mjs";
+import { n as createFormatConverter } from "../../converter-DyCJJfTe.mjs";
 
 //#region src/formats/d2/shared.ts
 /** Map a d2 connector glyph to a graph edge mode. */
@@ -800,6 +800,17 @@ function fromD2(input) {
 //#endregion
 //#region src/formats/d2/emitter.ts
 const STRUCTURED_SHAPES = new Set(["sql_table", "class"]);
+/**
+* Parser-shaped node data, tolerating graphs not produced by `fromD2` whose
+* `data` may be `undefined`, `null`, or an arbitrary user object.
+*/
+function nodeData(node) {
+	return node.data ?? {};
+}
+/** Parser-shaped edge data; see {@link nodeData}. */
+function edgeData(edge) {
+	return edge.data ?? {};
+}
 function splitId(id) {
 	const out = [];
 	let buf = "";
@@ -835,7 +846,7 @@ function emitComments(comments, ind, lines) {
 }
 function nodeAttrLines(node, ind) {
 	const lines = [];
-	const d = node.data;
+	const d = nodeData(node);
 	if (node.shape) lines.push(`${indent(ind)}shape: ${escapeD2Label(node.shape)}`);
 	if (d.near) lines.push(`${indent(ind)}near: ${escapeD2Label(d.near)}`);
 	if (d.icon) lines.push(`${indent(ind)}icon: ${d.icon}`);
@@ -869,7 +880,8 @@ function portLines(node, ind) {
 }
 function labelHeader(node) {
 	if (node.label == null || node.label === "") return "";
-	if (node.data.labelBlock) return emitLabelBlock(node.label, node.data.labelBlock);
+	const labelBlock = nodeData(node).labelBlock;
+	if (labelBlock) return emitLabelBlock(node.label, labelBlock);
 	return escapeD2Label(node.label);
 }
 /** Whether a node carries its own attributes/ports/label (needs a line of its own). */
@@ -883,7 +895,7 @@ function hasOwnContent(node) {
 */
 function isPurePrefix(ctx, node) {
 	const children = ctx.childrenOf.get(node.id) ?? [];
-	return node.data.declarationForm !== "block" && children.length > 0 && !hasOwnContent(node);
+	return nodeData(node).declarationForm !== "block" && children.length > 0 && !hasOwnContent(node);
 }
 /**
 * Emit the items (child nodes + owned edges) of a scope, in `data.order` when
@@ -893,7 +905,7 @@ function isPurePrefix(ctx, node) {
 function emitScope(ctx, container, containerId, scopeSegs, ind, lines) {
 	const children = ctx.childrenOf.get(containerId) ?? [];
 	const ownedEdges = container ? ctx.edgesByOwner.get(container.id) ?? [] : [];
-	const order = container?.data.order;
+	const order = container ? nodeData(container).order : void 0;
 	if (order) {
 		const childById = new Map(children.map((c) => [c.id, c]));
 		const edgeById = new Map(ownedEdges.map((e) => [e.id, e]));
@@ -918,7 +930,7 @@ function emitItem(ctx, node, scopeSegs, ind, lines) {
 		emitScope(ctx, node, node.id, scopeSegs, ind, lines);
 		return;
 	}
-	emitComments(node.data.commentsBefore, ind, lines);
+	emitComments(nodeData(node).commentsBefore, ind, lines);
 	const label = labelHeader(node);
 	const structured = node.shape && STRUCTURED_SHAPES.has(node.shape);
 	const attrLines = nodeAttrLines(node, ind + 1);
@@ -946,8 +958,9 @@ function endpointRef(nodeId$1, port, scopeSegs) {
 }
 function emitEdge(ctx, edge, ind, lines, scoped) {
 	ctx.emittedEdges.add(edge.id);
-	emitComments(edge.data.commentsBefore, ind, lines);
-	const arrow = edge.data.arrow ?? modeToArrow(edge);
+	const d = edgeData(edge);
+	emitComments(d.commentsBefore, ind, lines);
+	const arrow = d.arrow ?? modeToArrow(edge);
 	const owner = scoped ? ctx.ownerOfEdge.get(edge.id) : void 0;
 	const scopeSegs = owner ? splitId(owner) : [];
 	let sId = edge.sourceId;
@@ -962,7 +975,7 @@ function emitEdge(ctx, edge, ind, lines, scoped) {
 	const right = endpointRef(tId, tPort, scopeSegs);
 	let line = `${indent(ind)}${left} ${arrow} ${right}`;
 	if (edge.label != null && edge.label !== "") {
-		const lbl = edge.data.labelBlock ? emitLabelBlock(edge.label, edge.data.labelBlock) : escapeD2Label(edge.label);
+		const lbl = d.labelBlock ? emitLabelBlock(edge.label, d.labelBlock) : escapeD2Label(edge.label);
 		line += `: ${lbl}`;
 	}
 	const blockLines = edgeBlockLines(edge);
@@ -975,10 +988,11 @@ function emitEdge(ctx, edge, ind, lines, scoped) {
 function edgeBlockLines(edge) {
 	const out = [];
 	if (edge.style) for (const [k, v] of Object.entries(edge.style)) out.push(`style.${k}: ${styleValueToD2(v)}`);
-	const { sourceArrowhead, targetArrowhead } = edge.data;
+	const d = edgeData(edge);
+	const { sourceArrowhead, targetArrowhead } = d;
 	if (sourceArrowhead?.shape) out.push(`source-arrowhead.shape: ${sourceArrowhead.shape}`);
 	if (targetArrowhead?.shape) out.push(`target-arrowhead.shape: ${targetArrowhead.shape}`);
-	if (edge.data.reserved) for (const [k, v] of Object.entries(edge.data.reserved)) out.push(`${k}: ${styleValueToD2(v)}`);
+	if (d.reserved) for (const [k, v] of Object.entries(d.reserved)) out.push(`${k}: ${styleValueToD2(v)}`);
 	return out;
 }
 function modeToArrow(edge) {
@@ -999,7 +1013,7 @@ function buildEdgeOwnership(graph) {
 	const ownerOfEdge = /* @__PURE__ */ new Map();
 	const edgeById = new Map(graph.edges.map((e) => [e.id, e]));
 	for (const node of graph.nodes) {
-		const order = node.data.order;
+		const order = nodeData(node).order;
 		if (!order) continue;
 		for (const refId of order) {
 			const edge = edgeById.get(refId);

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

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

package/dist/formats/d3/index.mjs

@@ -1,4 +1,4 @@
-import { n as createFormatConverter } from "../../converter-udLITX36.mjs";
+import { n as createFormatConverter } from "../../converter-DyCJJfTe.mjs";
 
 //#region src/formats/d3/index.ts
 /**
@@ -49,6 +49,7 @@ function toD3Graph(graph) {
 			};
 			if (e.id) link.id = e.id;
 			if (e.label) link.label = e.label;
+			if (e.mode) link.mode = e.mode;
 			if (e.data !== void 0) link.data = e.data;
 			if (e.weight !== void 0) link.weight = e.weight;
 			if (e.x !== void 0) link.x = e.x;
@@ -109,6 +110,7 @@ function fromD3Graph(d3) {
 			sourceId: typeof l.source === "string" ? l.source : l.source.id,
 			targetId: typeof l.target === "string" ? l.target : l.target.id,
 			label: l.label ?? "",
+			...l.mode && { mode: l.mode },
 			data: l.data,
 			...l.weight !== void 0 && { weight: l.weight },
 			...l.x !== void 0 && { x: l.x },

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

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

package/dist/formats/dot/index.mjs

@@ -1,15 +1,31 @@
-import { n as createFormatConverter } from "../../converter-udLITX36.mjs";
+import { n as createFormatConverter } from "../../converter-DyCJJfTe.mjs";
 import parse from "dotparser";
 
 //#region src/formats/dot/index.ts
+/** DOT reserved keywords — must be quoted when used as identifiers. */
+const DOT_KEYWORDS = new Set([
+	"node",
+	"edge",
+	"graph",
+	"digraph",
+	"subgraph",
+	"strict"
+]);
 /** Escape a DOT identifier */
 function escapeId(id) {
-	if (/^[a-zA-Z_][a-zA-Z0-9_]*$/.test(id)) return id;
+	if (/^[a-zA-Z_][a-zA-Z0-9_]*$/.test(id) && !DOT_KEYWORDS.has(id.toLowerCase())) return id;
 	return `"${id.replace(/\\/g, "\\\\").replace(/"/g, "\\\"")}"`;
 }
 /** Escape a DOT label string */
 function escapeLabel(label) {
-	return label.replace(/\\/g, "\\\\").replace(/"/g, "\\\"");
+	return label.replace(/\\/g, "\\\\").replace(/"/g, "\\\"").replace(/\n/g, "\\n");
+}
+/**
+* Invert {@link escapeLabel}. dotparser unescapes `\"` itself but passes
+* `\\` and `\n` through verbatim.
+*/
+function unescapeLabel(label) {
+	return label.replace(/\\(\\|n)/g, (_, ch) => ch === "n" ? "\n" : "\\");
 }
 function formatEndpoint(id, port) {
 	return `${escapeId(id)}${port ? `:${escapeId(port)}` : ""}`;
@@ -112,7 +128,7 @@ function nodeFromAttrs(id, attrs, defaults, parentId) {
 		...defaults,
 		...attrs
 	};
-	const label = merged["label"] ?? "";
+	const label = unescapeLabel(merged["label"] ?? "");
 	const rawShape = merged["shape"];
 	const shape = rawShape ? DOT_TO_SHAPE[rawShape] ?? rawShape : void 0;
 	const color = merged["fillcolor"] ?? merged["color"] ?? void 0;
@@ -235,7 +251,7 @@ function fromDOT(dot) {
 							id: `e${edgeIdx++}`,
 							sourceId: source.id,
 							targetId: target.id,
-							label: mergedEdgeAttrs["label"] ?? "",
+							label: unescapeLabel(mergedEdgeAttrs["label"] ?? ""),
 							data: void 0,
 							...source.port && { sourcePort: source.port },
 							...target.port && { targetPort: target.port },
@@ -251,7 +267,7 @@ function fromDOT(dot) {
 				let subLabel = "";
 				for (const child of stmt.children) if (child.type === "attr_stmt" && child.target === "graph") {
 					const ga = attrsToMap(child.attr_list);
-					if (ga["label"]) subLabel = ga["label"];
+					if (ga["label"]) subLabel = unescapeLabel(ga["label"]);
 				}
 				const subNode = {
 					type: "node",

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

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

package/dist/formats/edge-list/index.mjs

@@ -1,3 +1,3 @@
-import { n as toEdgeList, t as fromEdgeList } from "../../edge-list-DP4otyPU.mjs";
+import { n as toEdgeList, t as fromEdgeList } from "../../edge-list-BcZ0h6zz.mjs";
 
 export { fromEdgeList, toEdgeList };

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

@@ -1,4 +1,4 @@
-import { F as VisualGraphFormatConverter, M as VisualGraph } from "../../types-3-FS9NV2.mjs";
+import { L as VisualGraphFormatConverter, P as VisualGraph } from "../../types-DNYdIU21.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/elk/index.mjs

@@ -1,4 +1,4 @@
-import { getChildren } from "../../queries.mjs";
+import { n as getChildren } from "../../queries-KirMDR7e.mjs";
 
 //#region src/formats/elk/index.ts
 const STATELYAI_METADATA_KEY = "statelyai.metadata";
@@ -33,8 +33,8 @@ const ELK_TO_DIRECTION = {
 function convertEdge(edge) {
 	const elkEdge = {
 		id: edge.id,
-		sources: [edge.sourcePort ?? edge.sourceId],
-		targets: [edge.targetPort ?? edge.targetId]
+		sources: [edge.sourcePort != null ? `${edge.sourceId}__${edge.sourcePort}` : edge.sourceId],
+		targets: [edge.targetPort != null ? `${edge.targetId}__${edge.targetPort}` : edge.targetId]
 	};
 	if (edge.label) elkEdge.labels = [{ text: edge.label }];
 	return addMetadata(elkEdge, { edge: {
@@ -43,6 +43,7 @@ function convertEdge(edge) {
 		sourcePort: edge.sourcePort,
 		targetPort: edge.targetPort,
 		label: edge.label,
+		mode: edge.mode,
 		data: edge.data,
 		weight: edge.weight,
 		color: edge.color,
@@ -53,9 +54,9 @@ function convertEdge(edge) {
 		height: edge.height
 	} });
 }
-function convertPort(port) {
+function convertPort(nodeId, port) {
 	const elkPort = {
-		id: port.name,
+		id: `${nodeId}__${port.name}`,
 		x: port.x,
 		y: port.y,
 		width: port.width,
@@ -64,6 +65,7 @@ function convertPort(port) {
 	if (port.label) elkPort.labels = [{ text: port.label }];
 	if (port.direction !== "inout") elkPort.layoutOptions = { "org.eclipse.elk.port.side": port.direction === "in" ? "WEST" : "EAST" };
 	return addMetadata(elkPort, { port: {
+		name: port.name,
 		data: port.data,
 		style: port.style
 	} });
@@ -77,7 +79,7 @@ function convertNode(graph, node) {
 		height: node.height
 	};
 	if (node.label) elkNode.labels = [{ text: node.label }];
-	if (node.ports && node.ports.length > 0) elkNode.ports = node.ports.map(convertPort);
+	if (node.ports && node.ports.length > 0) elkNode.ports = node.ports.map((port) => convertPort(node.id, port));
 	addMetadata(elkNode, { node: {
 		initialNodeId: node.initialNodeId,
 		data: node.data,
@@ -166,14 +168,18 @@ function flattenElkNodes(elkNode, parentId, nodes, edges, edgeIdx, portOwner) {
 			...metadata?.style !== void 0 && { style: metadata.style }
 		};
 		if (child.ports && child.ports.length > 0) node.ports = child.ports.map((elkPort) => {
-			portOwner.set(elkPort.id, child.id);
 			const metadata$1 = readMetadata(elkPort)?.port;
+			const portName = metadata$1?.name ?? elkPort.id;
+			portOwner.set(elkPort.id, {
+				nodeId: child.id,
+				portName
+			});
 			const sideOpt = elkPort.layoutOptions?.["org.eclipse.elk.port.side"];
 			let direction = "inout";
 			if (sideOpt === "WEST") direction = "in";
 			else if (sideOpt === "EAST") direction = "out";
 			return {
-				name: elkPort.id,
+				name: portName,
 				direction,
 				label: elkPort.labels?.[0]?.text,
 				data: metadata$1 && "data" in metadata$1 ? metadata$1.data : void 0,
@@ -189,27 +195,28 @@ function flattenElkNodes(elkNode, parentId, nodes, edges, edgeIdx, portOwner) {
 	}
 	if (elkNode.edges) for (const elkEdge of elkNode.edges) for (const source of elkEdge.sources) for (const target of elkEdge.targets) {
 		const metadata = readMetadata(elkEdge)?.edge;
-		const sourceNodeId = portOwner.get(source);
-		const targetNodeId = portOwner.get(target);
+		const sourceOwner = portOwner.get(source);
+		const targetOwner = portOwner.get(target);
 		const edge = {
 			type: "edge",
 			id: elkEdge.id ?? `e${edgeIdx.value++}`,
-			sourceId: metadata?.sourceId ?? sourceNodeId ?? source,
-			targetId: metadata?.targetId ?? targetNodeId ?? target,
+			sourceId: metadata?.sourceId ?? sourceOwner?.nodeId ?? source,
+			targetId: metadata?.targetId ?? targetOwner?.nodeId ?? target,
 			label: metadata && "label" in metadata ? metadata.label : elkEdge.labels?.[0]?.text ?? "",
 			data: metadata && "data" in metadata ? metadata.data : void 0,
 			x: metadata?.x ?? 0,
 			y: metadata?.y ?? 0,
 			width: metadata?.width ?? 0,
 			height: metadata?.height ?? 0,
+			...metadata?.mode !== void 0 && { mode: metadata.mode },
 			...metadata?.weight !== void 0 && { weight: metadata.weight },
 			...metadata?.color !== void 0 && { color: metadata.color },
 			...metadata?.style !== void 0 && { style: metadata.style }
 		};
 		if (metadata && "sourcePort" in metadata) edge.sourcePort = metadata.sourcePort;
-		else if (sourceNodeId) edge.sourcePort = source;
+		else if (sourceOwner) edge.sourcePort = sourceOwner.portName;
 		if (metadata && "targetPort" in metadata) edge.targetPort = metadata.targetPort;
-		else if (targetNodeId) edge.targetPort = target;
+		else if (targetOwner) edge.targetPort = targetOwner.portName;
 		edges.push(edge);
 	}
 }

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

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