@statelyai/graph 0.13.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-BlM-qoJb.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-BNDQcHU3.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-Dspillnn.mjs → converter-DyCJJfTe.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-GeL1Cu-L.mjs";
+import { n as toEdgeList, t as fromEdgeList } from "./edge-list-BcZ0h6zz.mjs";
 
 //#region src/formats/converter/index.ts
 /**

package/dist/{edge-list-gKe8-iRa.mjs → edge-list-BcZ0h6zz.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

@@ -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,33 @@ 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",
+		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).",
+			"Only flat key/value vars round-trip; nested sub-blocks inside vars are dropped.",
+			"d2 has no native edge weight."
+		]
 	},
 	{
 		id: "dot",
@@ -94,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",
@@ -109,7 +143,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",
@@ -124,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",
@@ -137,9 +179,15 @@ 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."]
+		notes: [
+			"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."
+		]
 	},
 	{
 		id: "jgf",
@@ -154,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",
@@ -184,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",
@@ -302,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-CnZ01raw.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-Ca0VjKIf.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,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-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-Dspillnn.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-CnZ01raw.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-Dspillnn.mjs";
+import { n as createFormatConverter } from "../../converter-DyCJJfTe.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;
@@ -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;
@@ -92,7 +93,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 },
@@ -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

@@ -0,0 +1,109 @@
+import { d as Graph, g as GraphFormatConverter } from "../../types-DNYdIU21.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 };