@statelyai/graph 0.13.0 → 1.0.0

package/README.md

@@ -252,7 +252,7 @@ const imported = fromGEXF(gexfXmlString); // GEXF (Gephi)
 
 <!-- supported format adapters derived from src/formats/* subdirectories -->
 
-**Supported formats:** Cytoscape.js JSON, D3.js JSON, JSON Graph Format, GEXF, GraphML, GML, TGF, DOT, Mermaid (flowchart, state, sequence, class, ER, mindmap, block, Ishikawa), ELK, xyflow, adjacency list, and edge list.
+**Supported formats:** Cytoscape.js JSON, D3.js JSON, D2, JSON Graph Format, GEXF, GraphML, GML, TGF, DOT, Mermaid (flowchart, state, sequence, class, ER, mindmap, block, Ishikawa), ELK, xyflow, adjacency list, and edge list.
 
 Each bidirectional format also has a converter object:
 
@@ -277,6 +277,7 @@ source information instead of preserving it as metadata.
 | `adjacency-list`    | none      | none    | none    | partial    | Connectivity only; edge metadata is lost.                                  |
 | `cytoscape`         | full      | full    | full    | full       | Graph, node, and edge metadata round-trip through element data.            |
 | `d3`                | full      | full    | full    | full       | Graph, node, and edge metadata round-trip through the loose JSON shape.    |
+| `d2`                | full      | full    | full    | full       | D2 syntax, hierarchy, ports, styles, and connector modes round-trip.       |
 | `dot`               | partial   | partial | partial | partial    | Edge port ids round-trip, but `:port:compass` mapping is still incomplete. |
 | `edge-list`         | none      | none    | none    | partial    | Endpoints only.                                                            |
 | `elk`               | full      | full    | full    | full       | Metadata round-trips through reserved layout options.                      |
@@ -304,6 +305,7 @@ Format-specific docs live alongside the source:
 - [Adjacency list](./src/formats/adjacency-list/README.md)
 - [Cytoscape](./src/formats/cytoscape/README.md)
 - [D3](./src/formats/d3/README.md)
+- [D2](./src/formats/d2/README.md)
 - [DOT](./src/formats/dot/README.md)
 - [Edge list](./src/formats/edge-list/README.md)
 - [ELK](./src/formats/elk/README.md)

package/dist/{adjacency-list-Ca0VjKIf.mjs → adjacency-list-VsUaH9SJ.mjs}

@@ -20,7 +20,7 @@ function toAdjacencyList(graph) {
 	for (const node of graph.nodes) adj[node.id] = [];
 	for (const edge of graph.edges) {
 		adj[edge.sourceId]?.push(edge.targetId);
-		if (graph.type === "undirected") adj[edge.targetId]?.push(edge.sourceId);
+		if (graph.mode !== "directed") adj[edge.targetId]?.push(edge.sourceId);
 	}
 	return adj;
 }
@@ -70,7 +70,7 @@ function fromAdjacencyList(adj, options) {
 	}
 	return {
 		id: options?.id ?? "",
-		type: directed ? "directed" : "undirected",
+		mode: directed ? "directed" : "undirected",
 		initialNodeId: null,
 		nodes,
 		edges,

package/dist/{algorithms-BNDQcHU3.mjs → algorithms-Ba7o7niK.mjs}

@@ -1,4 +1,5 @@
-import { a as indexUpdateEdgeEndpoints, i as indexReparentNode, n as indexAddEdge, o as invalidateIndex, r as indexAddNode, t as getIndex } from "./indexing-DUl3kTqm.mjs";
+import { a as indexUpdateEdgeEndpoints, i as indexReparentNode, n as indexAddEdge, o as invalidateIndex, r as indexAddNode, t as getIndex } from "./indexing-DR8M1vBy.mjs";
+import { t as getEdgeMode } from "./mode-D8OnHFBk.mjs";
 
 //#region src/graph.ts
 /**
@@ -88,6 +89,7 @@ function createGraphEdge(config) {
 	};
 	if (config.sourcePort !== void 0) edge.sourcePort = config.sourcePort;
 	if (config.targetPort !== void 0) edge.targetPort = config.targetPort;
+	if (config.mode !== void 0) edge.mode = config.mode;
 	if (config.weight !== void 0) edge.weight = config.weight;
 	if (config.x !== void 0) edge.x = config.x;
 	if (config.y !== void 0) edge.y = config.y;
@@ -111,7 +113,7 @@ function createGraphEdge(config) {
 function createGraph(config) {
 	const graph = {
 		id: config?.id ?? "",
-		type: config?.type ?? "directed",
+		mode: config?.mode ?? "directed",
 		initialNodeId: config?.initialNodeId ?? null,
 		nodes: (config?.nodes ?? []).map(createGraphNode),
 		edges: (config?.edges ?? []).map(createGraphEdge),
@@ -244,7 +246,7 @@ function createGraphFromTransition(transition, options) {
 	}
 	return createGraph({
 		id: options.id ?? "",
-		type: "directed",
+		mode: "directed",
 		initialNodeId: initialStateId,
 		nodes,
 		edges
@@ -582,8 +584,9 @@ var GraphInstance = class GraphInstance {
 	get id() {
 		return this.graph.id;
 	}
-	get type() {
-		return this.graph.type;
+	/** Default directedness for all edges. */
+	get mode() {
+		return this.graph.mode;
 	}
 	get nodes() {
 		return this.graph.nodes;
@@ -703,9 +706,11 @@ function getNeighborIds$1(graph, nodeId) {
 		const ai = idx.edgeById.get(eid);
 		if (ai !== void 0) ids.push(graph.edges[ai].targetId);
 	}
-	if (graph.type === "undirected") for (const eid of idx.inEdges.get(nodeId) ?? []) {
+	for (const eid of idx.inEdges.get(nodeId) ?? []) {
 		const ai = idx.edgeById.get(eid);
-		if (ai !== void 0) ids.push(graph.edges[ai].sourceId);
+		if (ai === void 0) continue;
+		const edge = graph.edges[ai];
+		if (getEdgeMode(graph, edge) !== "directed") ids.push(edge.sourceId);
 	}
 	return ids;
 }
@@ -736,11 +741,11 @@ function getNeighborEdges(graph, nodeId) {
 			});
 		}
 	}
-	if (graph.type === "undirected") for (const eid of idx.inEdges.get(nodeId) ?? []) {
+	for (const eid of idx.inEdges.get(nodeId) ?? []) {
 		const ai = idx.edgeById.get(eid);
 		if (ai !== void 0) {
 			const edge = graph.edges[ai];
-			result.push({
+			if (getEdgeMode(graph, edge) !== "directed") result.push({
 				neighborId: edge.sourceId,
 				edge
 			});
@@ -844,7 +849,6 @@ function bellmanFord(graph, sourceId, getWeight) {
 	const dist = /* @__PURE__ */ new Map();
 	const prev = /* @__PURE__ */ new Map();
 	const effectiveWeight = getWeight ?? ((edge) => edge.weight ?? 1);
-	const isUndirected = graph.type === "undirected";
 	for (const node of graph.nodes) {
 		dist.set(node.id, Infinity);
 		prev.set(node.id, []);
@@ -857,7 +861,7 @@ function bellmanFord(graph, sourceId, getWeight) {
 			toId: edge.targetId,
 			edge
 		});
-		if (isUndirected) directedEdges.push({
+		if (getEdgeMode(graph, edge) !== "directed") directedEdges.push({
 			fromId: edge.targetId,
 			toId: edge.sourceId,
 			edge
@@ -1021,7 +1025,7 @@ function getCycles(graph) {
 	return [...genCycles(graph)];
 }
 function* genCycles(graph) {
-	if (graph.type === "undirected") yield* genCyclesUndirected(graph);
+	if (graph.mode !== "directed") yield* genCyclesUndirected(graph);
 	else yield* genCyclesDirected(graph);
 }
 function* genCyclesDirected(graph) {
@@ -1160,7 +1164,7 @@ function floydWarshallAllPaths(graph, getWeight) {
 			from: source,
 			edge
 		});
-		if (graph.type === "undirected") {
+		if (getEdgeMode(graph, edge) !== "directed") {
 			if (edgeWeight < dist[target][source]) {
 				dist[target][source] = edgeWeight;
 				prev[target][source] = [{
@@ -1318,7 +1322,7 @@ function* dfs(graph, startId) {
 	}
 }
 function isAcyclic(graph) {
-	if (graph.type === "undirected") return isAcyclicUndirected(graph);
+	if (graph.mode !== "directed") return isAcyclicUndirected(graph);
 	const WHITE = 0;
 	const GRAY = 1;
 	const BLACK = 2;
@@ -1576,7 +1580,7 @@ function getMinimumSpanningTree(graph, opts) {
 	const mstEdges = algorithm === "kruskal" ? kruskalMST(graph, getWeight) : primMST(graph, getWeight);
 	return createGraph({
 		id: graph.id,
-		type: graph.type,
+		mode: graph.mode,
 		initialNodeId: graph.initialNodeId ?? void 0,
 		nodes: graph.nodes.map((node) => ({
 			id: node.id,
@@ -1611,7 +1615,7 @@ function primMST(graph, getWeight) {
 				edge
 			});
 		}
-		if (graph.type === "undirected") for (const eid of idx.inEdges.get(nodeId) ?? []) {
+		if (graph.mode !== "directed") for (const eid of idx.inEdges.get(nodeId) ?? []) {
 			const ai = idx.edgeById.get(eid);
 			if (ai === void 0) continue;
 			const edge = graph.edges[ai];
@@ -1626,7 +1630,7 @@ function primMST(graph, getWeight) {
 	addEdgesOf(startId);
 	while (candidates.size > 0 && inMST.size < graph.nodes.length) {
 		const { edge } = candidates.pop();
-		const targetId = graph.type === "undirected" && inMST.has(edge.targetId) ? edge.sourceId : edge.targetId;
+		const targetId = graph.mode !== "directed" && inMST.has(edge.targetId) ? edge.sourceId : edge.targetId;
 		if (inMST.has(targetId)) continue;
 		inMST.add(targetId);
 		mstEdges.push(edge);
@@ -1675,7 +1679,7 @@ function getNeighborIds(graph, nodeId) {
 		const edgeIndex = idx.edgeById.get(edgeId);
 		if (edgeIndex !== void 0) neighbors.push(graph.edges[edgeIndex].targetId);
 	}
-	if (graph.type === "undirected") for (const edgeId of idx.inEdges.get(nodeId) ?? []) {
+	if (graph.mode !== "directed") for (const edgeId of idx.inEdges.get(nodeId) ?? []) {
 		const edgeIndex = idx.edgeById.get(edgeId);
 		if (edgeIndex !== void 0) neighbors.push(graph.edges[edgeIndex].sourceId);
 	}
@@ -1688,7 +1692,7 @@ function getIncomingIds(graph, nodeId) {
 		const edgeIndex = idx.edgeById.get(edgeId);
 		if (edgeIndex !== void 0) incoming.push(graph.edges[edgeIndex].sourceId);
 	}
-	if (graph.type === "undirected") for (const edgeId of idx.outEdges.get(nodeId) ?? []) {
+	if (graph.mode !== "directed") for (const edgeId of idx.outEdges.get(nodeId) ?? []) {
 		const edgeIndex = idx.edgeById.get(edgeId);
 		if (edgeIndex !== void 0) incoming.push(graph.edges[edgeIndex].targetId);
 	}
@@ -1741,7 +1745,7 @@ function getDegreeCentrality(graph) {
 	for (const node of graph.nodes) {
 		const outDegree = idx.outEdges.get(node.id)?.length ?? 0;
 		const inDegree = idx.inEdges.get(node.id)?.length ?? 0;
-		const degree = graph.type === "undirected" ? new Set([...idx.outEdges.get(node.id) ?? [], ...idx.inEdges.get(node.id) ?? []]).size : outDegree + inDegree;
+		const degree = graph.mode !== "directed" ? new Set([...idx.outEdges.get(node.id) ?? [], ...idx.inEdges.get(node.id) ?? []]).size : outDegree + inDegree;
 		scores[node.id] = degree * scale;
 	}
 	return scores;
@@ -1841,9 +1845,9 @@ function getBetweennessCentrality(graph) {
 	}
 	const order = graph.nodes.length;
 	if (order <= 2) return scores;
-	const scale = graph.type === "undirected" ? 1 / ((order - 1) * (order - 2) / 2) : 1 / ((order - 1) * (order - 2));
+	const scale = graph.mode !== "directed" ? 1 / ((order - 1) * (order - 2) / 2) : 1 / ((order - 1) * (order - 2));
 	for (const nodeId of Object.keys(scores)) {
-		if (graph.type === "undirected") scores[nodeId] /= 2;
+		if (graph.mode !== "directed") scores[nodeId] /= 2;
 		scores[nodeId] *= scale;
 	}
 	return scores;
@@ -2314,11 +2318,11 @@ function getDegreeSignature(graph, nodeId) {
 	const idx = getIndex(graph);
 	const outDegree = idx.outEdges.get(nodeId)?.length ?? 0;
 	const inDegree = idx.inEdges.get(nodeId)?.length ?? 0;
-	if (graph.type === "undirected") return `u:${new Set([...idx.outEdges.get(nodeId) ?? [], ...idx.inEdges.get(nodeId) ?? []]).size}`;
+	if (graph.mode !== "directed") return `u:${new Set([...idx.outEdges.get(nodeId) ?? [], ...idx.inEdges.get(nodeId) ?? []]).size}`;
 	return `d:${inDegree}:${outDegree}`;
 }
 function getEdgesBetween(graph, sourceId, targetId) {
-	if (graph.type === "undirected") return graph.edges.filter((edge) => edge.sourceId === sourceId && edge.targetId === targetId || edge.sourceId === targetId && edge.targetId === sourceId);
+	if (graph.mode !== "directed") return graph.edges.filter((edge) => edge.sourceId === sourceId && edge.targetId === targetId || edge.sourceId === targetId && edge.targetId === sourceId);
 	return graph.edges.filter((edge) => edge.sourceId === sourceId && edge.targetId === targetId);
 }
 function edgesAreCompatible(edgesA, edgesB, edgeMatch) {
@@ -2339,7 +2343,7 @@ function edgesAreCompatible(edgesA, edgesB, edgeMatch) {
 * node and edge payloads.
 */
 function isIsomorphic(graphA, graphB, options) {
-	if (graphA.type !== graphB.type) return false;
+	if (graphA.mode !== graphB.mode) return false;
 	if (graphA.nodes.length !== graphB.nodes.length) return false;
 	if (graphA.edges.length !== graphB.edges.length) return false;
 	const nodeMatch = options?.nodeMatch;

package/dist/{algorithms-BlM-qoJb.d.mts → algorithms-fTqmvhzP.d.mts}

@@ -1,4 +1,4 @@
-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-CnZ01raw.mjs";
+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-3-FS9NV2.mjs";
 
 //#region src/algorithms/traversal.d.ts
 declare function bfs<N>(graph: Graph<N>, startId: string): Generator<GraphNode<N>>;

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-BlM-qoJb.mjs";
+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 };

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-BNDQcHU3.mjs";
+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";
 
 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/{converter-Dspillnn.mjs → converter-udLITX36.mjs}

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

package/dist/{edge-list-gKe8-iRa.mjs → edge-list-DP4otyPU.mjs}

@@ -59,7 +59,7 @@ function fromEdgeList(edges, options) {
 	}));
 	return {
 		id: options?.id ?? "",
-		type: directed ? "directed" : "undirected",
+		mode: directed ? "directed" : "undirected",
 		initialNodeId: null,
 		nodes,
 		edges: edgeObjects,

package/dist/format-support.mjs

@@ -51,6 +51,27 @@ const FORMAT_SUPPORT_MATRIX = [
 		},
 		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."]
 	},
+	{
+		id: "d2",
+		importPath: "@statelyai/graph/d2",
+		features: {
+			directed: "full",
+			undirected: "full",
+			hierarchy: "full",
+			ports: "full",
+			visual: "full",
+			style: "full",
+			weight: "none",
+			roundTrip: "full"
+		},
+		notes: [
+			"Containers map to hierarchy; dot vs block declaration form is preserved per node.",
+			"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).",
+			"d2 has no native edge weight."
+		]
+	},
 	{
 		id: "dot",
 		importPath: "@statelyai/graph/dot",
@@ -109,7 +130,11 @@ const FORMAT_SUPPORT_MATRIX = [
 			weight: "full",
 			roundTrip: "full"
 		},
-		notes: ["Custom attributes preserve graph, node, and edge metadata beyond the standard viz module.", "Ports round-trip via custom node/edge attributes."]
+		notes: [
+			"Custom attributes preserve graph, node, and edge metadata beyond the standard viz module.",
+			"Ports round-trip via custom node/edge attributes.",
+			"Per-edge directedness round-trips via the `type` edge attribute; bidirectional maps to directed."
+		]
 	},
 	{
 		id: "gml",
@@ -139,7 +164,11 @@ const FORMAT_SUPPORT_MATRIX = [
 			weight: "full",
 			roundTrip: "partial"
 		},
-		notes: ["GraphML attribute fidelity is good, but not every extension is represented.", "Ports round-trip through node and edge `<data>` fields."]
+		notes: [
+			"GraphML attribute fidelity is good, but not every extension is represented.",
+			"Ports round-trip through node and edge `<data>` fields.",
+			"Per-edge directedness round-trips via the `directed` edge attribute; bidirectional maps to directed."
+		]
 	},
 	{
 		id: "jgf",

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

@@ -1,4 +1,4 @@
-import { u as Graph } from "../../types-CnZ01raw.mjs";
+import { u as Graph } from "../../types-3-FS9NV2.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-Ca0VjKIf.mjs";
+import { n as toAdjacencyList, t as fromAdjacencyList } from "../../adjacency-list-VsUaH9SJ.mjs";
 
 export { fromAdjacencyList, toAdjacencyList };

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

@@ -1,61 +1,2 @@
-import { h as GraphFormatConverter, u as Graph } from "../../types-CnZ01raw.mjs";
-
-//#region src/formats/converter/index.d.ts
-
-/**
- * Create a `GraphFormatConverter` from a pair of `to`/`from` functions.
- *
- * @example
- * ```ts
- * import { createFormatConverter } from '@statelyai/graph';
- *
- * const yamlConverter = createFormatConverter(
- *   (graph) => toYAML(graph),
- *   (yaml) => fromYAML(yaml),
- * );
- *
- * const yaml = yamlConverter.to(graph);
- * const graph = yamlConverter.from(yaml);
- * ```
- */
-declare function createFormatConverter<TSerial, N = any, E = any, G = any>(to: (graph: Graph<N, E, G>) => TSerial, from: (input: TSerial) => Graph<N, E, G>): GraphFormatConverter<TSerial, N, E, G>;
-/**
- * Bidirectional converter for adjacency-list format (`Record<string, string[]>`).
- *
- * @example
- * ```ts
- * import { adjacencyListConverter, createGraph } from '@statelyai/graph';
- *
- * const graph = createGraph({
- *   nodes: { a: {}, b: {} },
- *   edges: [{ source: 'a', target: 'b' }],
- * });
- *
- * const adj = adjacencyListConverter.to(graph);
- * // { a: ['b'], b: [] }
- *
- * const roundTripped = adjacencyListConverter.from(adj);
- * ```
- */
-declare const adjacencyListConverter: GraphFormatConverter<Record<string, string[]>>;
-/**
- * Bidirectional converter for edge-list format (`[source, target][]`).
- *
- * @example
- * ```ts
- * import { edgeListConverter, createGraph } from '@statelyai/graph';
- *
- * const graph = createGraph({
- *   nodes: { a: {}, b: {} },
- *   edges: [{ source: 'a', target: 'b' }],
- * });
- *
- * const edges = edgeListConverter.to(graph);
- * // [['a', 'b']]
- *
- * const roundTripped = edgeListConverter.from(edges);
- * ```
- */
-declare const edgeListConverter: GraphFormatConverter<[string, string][]>;
-//#endregion
+import { n as createFormatConverter, r as edgeListConverter, t as adjacencyListConverter } from "../../index-D9Kj6Fe3.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-Dspillnn.mjs";
+import { n as createFormatConverter, r as edgeListConverter, t as adjacencyListConverter } from "../../converter-udLITX36.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-CnZ01raw.mjs";
+import { h as GraphFormatConverter, u as Graph } from "../../types-3-FS9NV2.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-Dspillnn.mjs";
+import { n as createFormatConverter } from "../../converter-udLITX36.mjs";
 
 //#region src/formats/cytoscape/index.ts
 /**
@@ -21,7 +21,7 @@ import { n as createFormatConverter } from "../../converter-Dspillnn.mjs";
 function toCytoscapeJSON(graph) {
 	const graphData = {};
 	if (graph.id) graphData.id = graph.id;
-	graphData.type = graph.type;
+	graphData.mode = graph.mode;
 	if (graph.initialNodeId) graphData.initialNodeId = graph.initialNodeId;
 	if (graph.data !== void 0) graphData.graphData = graph.data;
 	if (graph.direction) graphData.direction = graph.direction;
@@ -92,7 +92,7 @@ function fromCytoscapeJSON(cyto) {
 	if (!Array.isArray(cyto.elements.edges)) throw new Error("Cytoscape: \"elements.edges\" must be an array");
 	return {
 		id: cyto.data?.id ?? "",
-		type: cyto.data?.type === "undirected" ? "undirected" : "directed",
+		mode: cyto.data?.mode ?? "directed",
 		initialNodeId: cyto.data?.initialNodeId ?? null,
 		data: cyto.data?.graphData,
 		...cyto.data?.direction && { direction: cyto.data.direction },

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

@@ -0,0 +1,109 @@
+import { h as GraphFormatConverter, u as Graph } from "../../types-3-FS9NV2.mjs";
+
+//#region src/formats/d2/shared.d.ts
+type D2Arrow = '->' | '<-' | '--' | '<->';
+/** Descriptor for a typed/block label (`|md ...|`, `|js ...|`, block strings). */
+interface D2LabelBlock {
+  kind: 'md' | 'code' | 'latex' | 'block';
+  /** Language tag for code blocks (e.g. `js`, `go`). */
+  lang?: string;
+  /** The fence delimiter used (`|`, `||`, `` |` ``, etc.), preserved for emit. */
+  fence: string;
+}
+interface D2GridSpec {
+  rows?: number;
+  columns?: number;
+  gap?: number;
+  verticalGap?: number;
+  horizontalGap?: number;
+}
+/** Source-level abstractions preserved from the original d2 text. */
+interface D2Source {
+  /** `vars: { ... }` blocks, stored as nested key/value maps. */
+  vars?: Record<string, any>;
+  /** `classes: { name: { ...style } }` definitions. */
+  classes?: Record<string, Record<string, string | number | boolean>>;
+  /** `@path` import references in declaration order. */
+  imports?: string[];
+}
+interface D2GraphData {
+  diagramType: 'd2';
+  source?: D2Source;
+  /** Comments before any statement / at file top. */
+  leadingComments?: string[];
+  /** Comments after the last statement. */
+  trailingComments?: string[];
+}
+interface D2NodeData {
+  /** Whether the author declared this node via dot-path or a `{ }` block. */
+  declarationForm?: 'dot' | 'block';
+  /** Relative positioning keyword/target (`near: top-center`, `near: a.b`). */
+  near?: string;
+  /** Icon URL. */
+  icon?: string;
+  tooltip?: string;
+  link?: string;
+  /** Names of `classes` applied to this node via `class:`. */
+  classes?: string[];
+  /** Typed/block label descriptor; absent for plain labels. */
+  labelBlock?: D2LabelBlock;
+  /** Grid layout spec for grid containers. */
+  grid?: D2GridSpec;
+  /**
+   * Source-order list of direct child node IDs and edge IDs, used by
+   * sequence diagrams (and any ordering-sensitive container) to replay
+   * statement order on emit.
+   */
+  order?: string[];
+  /** Comments immediately preceding this node's declaration. */
+  commentsBefore?: string[];
+  /** Reserved keywords with no canonical/typed home, preserved verbatim. */
+  reserved?: Record<string, string | number | boolean>;
+}
+interface D2ArrowheadSpec {
+  shape?: string;
+  label?: string;
+}
+interface D2EdgeData {
+  /** Authored connector glyph, for faithful re-emit (incl. reversed `<-`). */
+  arrow: D2Arrow;
+  sourceArrowhead?: D2ArrowheadSpec;
+  targetArrowhead?: D2ArrowheadSpec;
+  classes?: string[];
+  labelBlock?: D2LabelBlock;
+  commentsBefore?: string[];
+  reserved?: Record<string, string | number | boolean>;
+}
+interface D2PortData {
+  /** SQL column type (`int`, `varchar`, ...) or class member type. */
+  typeName?: string;
+  /** SQL constraints (`primary_key`, `foreign_key`, `unique`). */
+  constraint?: string[];
+  /** Class member visibility marker (`+`, `-`, `#`). */
+  visibility?: string;
+  /** True when this port came from a `shape: class` member rather than sql_table. */
+  classMember?: boolean;
+}
+type D2Graph = Graph<D2NodeData, D2EdgeData, D2GraphData, D2PortData>;
+//#endregion
+//#region src/formats/d2/parser.d.ts
+declare function fromD2(input: string): D2Graph;
+//#endregion
+//#region src/formats/d2/emitter.d.ts
+declare function toD2(graph: D2Graph): string;
+//#endregion
+//#region src/formats/d2/index.d.ts
+/**
+ * Bidirectional converter for [d2](https://d2lang.com/) diagram syntax.
+ *
+ * @example
+ * ```ts
+ * import { d2Converter } from '@statelyai/graph/d2';
+ *
+ * const graph = d2Converter.from('a -> b: hello');
+ * const text = d2Converter.to(graph);
+ * ```
+ */
+declare const d2Converter: GraphFormatConverter<string, D2NodeData, D2EdgeData, D2GraphData>;
+//#endregion
+export { type D2Arrow, type D2ArrowheadSpec, type D2EdgeData, type D2Graph, type D2GraphData, type D2GridSpec, type D2LabelBlock, type D2NodeData, type D2PortData, type D2Source, d2Converter, fromD2, toD2 };