@statelyai/graph 0.4.0 → 0.5.0

package/dist/formats/mermaid/index.mjs

@@ -1,4 +1,4 @@
-import { n as createFormatConverter } from "../../converter-C5DlzzHs.mjs";
+import { n as createFormatConverter } from "../../converter-B5CUD0r9.mjs";
 
 //#region src/formats/mermaid/shared.ts
 const MERMAID_TO_DIRECTION = {
@@ -146,6 +146,7 @@ function fromMermaidSequence(input) {
 	let autonumber = false;
 	let edgeCounter = 0;
 	let seqNum = 0;
+	let currentBox = null;
 	const blockStack = [];
 	function ensureNode(id, actorType = "participant") {
 		if (!nodeMap.has(id)) nodeMap.set(id, {
@@ -173,7 +174,7 @@ function fromMermaidSequence(input) {
 			autonumber = true;
 			continue;
 		}
-		const participantMatch = line.match(/^(participant|actor)\s+(\S+?)(?:\s+as\s+(.+))?$/);
+		const participantMatch = line.match(/^(participant|actor|boundary|control|entity|database|collections|queue)\s+(\S+?)(?:\s+as\s+(.+))?$/);
 		if (participantMatch) {
 			const actorType = participantMatch[1];
 			const id = participantMatch[2];
@@ -185,9 +186,10 @@ function fromMermaidSequence(input) {
 				node.data.alias = alias;
 				node.label = alias;
 			}
+			if (currentBox) node.data.box = { ...currentBox };
 			continue;
 		}
-		const createMatch = line.match(/^create\s+(participant|actor)\s+(\S+?)(?:\s+as\s+(.+))?$/);
+		const createMatch = line.match(/^create\s+(participant|actor|boundary|control|entity|database|collections|queue)\s+(\S+?)(?:\s+as\s+(.+))?$/);
 		if (createMatch) {
 			const actorType = createMatch[1];
 			const id = createMatch[2];
@@ -226,6 +228,22 @@ function fromMermaidSequence(input) {
 			});
 			continue;
 		}
+		const boxMatch = line.match(/^box\s*(.*)?$/);
+		if (boxMatch) {
+			const rest = (boxMatch[1] ?? "").trim();
+			let color;
+			let title;
+			const colorTitleMatch = rest.match(/^(rgb\([^)]*\)|#[a-fA-F0-9]+|[a-zA-Z]+)?\s*(.*)$/);
+			if (colorTitleMatch) {
+				color = colorTitleMatch[1]?.trim() || void 0;
+				title = colorTitleMatch[2]?.trim() || void 0;
+			}
+			currentBox = {
+				...color && { color },
+				...title && { title }
+			};
+			continue;
+		}
 		if (/^(loop|alt|opt|par|critical|break)\s+/.test(line) || line.startsWith("rect ")) {
 			const spaceIdx = line.indexOf(" ");
 			const keyword = line.slice(0, spaceIdx);
@@ -290,6 +308,10 @@ function fromMermaidSequence(input) {
 			continue;
 		}
 		if (line === "end") {
+			if (currentBox && blockStack.length === 0) {
+				currentBox = null;
+				continue;
+			}
 			if (blockStack.length > 0) {
 				const finished = blockStack.pop();
 				const block = buildBlock(finished);
@@ -300,6 +322,25 @@ function fromMermaidSequence(input) {
 			}
 			continue;
 		}
+		const noteMatch = line.match(/^Note\s+(left of|right of|over)\s+([^:]+):\s*(.*)$/i);
+		if (noteMatch) {
+			const posRaw = noteMatch[1].toLowerCase();
+			const position = posRaw === "left of" ? "left" : posRaw === "right of" ? "right" : "over";
+			const actorsPart = noteMatch[2].trim();
+			const text = noteMatch[3].trim();
+			const actorIds = actorsPart.split(",").map((s) => s.trim());
+			for (const actorId of actorIds) {
+				ensureNode(actorId);
+				const node = nodeMap.get(actorId);
+				if (!node.data.notes) node.data.notes = [];
+				node.data.notes.push({
+					position,
+					text,
+					...position === "over" && actorIds.length > 1 ? { over: actorIds } : {}
+				});
+			}
+			continue;
+		}
 		if (/^Note\s+(left|right|over)\s+/i.test(line)) continue;
 		const msgMatch = line.match(MESSAGE_RE);
 		if (msgMatch) {
@@ -443,12 +484,38 @@ function toMermaidSequence(graph) {
 	const lines = ["sequenceDiagram"];
 	const gd = graph.data;
 	if (gd?.autonumber) lines.push("    autonumber");
+	const boxGroups = /* @__PURE__ */ new Map();
+	const noBoxNodes = [];
 	for (const node of graph.nodes) {
+		const box = node.data?.box;
+		if (box) {
+			const key = JSON.stringify(box);
+			if (!boxGroups.has(key)) boxGroups.set(key, {
+				box,
+				nodes: []
+			});
+			boxGroups.get(key).nodes.push(node);
+		} else noBoxNodes.push(node);
+	}
+	function emitParticipant(node, indent$1) {
 		const d = node.data;
-		const keyword = d?.actorType === "actor" ? "actor" : "participant";
+		const keyword = d?.actorType ?? "participant";
 		const alias = d?.alias ? ` as ${escapeMermaidLabel(d.alias)}` : "";
-		if (d?.created) lines.push(`    create ${keyword} ${node.id}${alias}`);
-		else lines.push(`    ${keyword} ${node.id}${alias}`);
+		if (d?.created) lines.push(`${indent$1}create ${keyword} ${node.id}${alias}`);
+		else lines.push(`${indent$1}${keyword} ${node.id}${alias}`);
+	}
+	for (const { box, nodes: boxNodes } of boxGroups.values()) {
+		const colorStr = box.color ? ` ${box.color}` : "";
+		const titleStr = box.title ? ` ${box.title}` : "";
+		lines.push(`    box${colorStr}${titleStr}`);
+		for (const node of boxNodes) emitParticipant(node, "        ");
+		lines.push("    end");
+	}
+	for (const node of noBoxNodes) emitParticipant(node, "    ");
+	for (const node of graph.nodes) if (node.data?.notes) for (const note of node.data.notes) if (note.position === "over" && note.over && note.over.length > 1) lines.push(`    Note over ${note.over.join(",")}: ${escapeMermaidLabel(note.text)}`);
+	else {
+		const posStr = note.position === "left" ? "left of" : note.position === "right" ? "right of" : "over";
+		lines.push(`    Note ${posStr} ${node.id}: ${escapeMermaidLabel(note.text)}`);
 	}
 	const blocks = gd?.blocks ?? [];
 	const edgeIdSet = new Set(graph.edges.map((e) => e.id));
@@ -705,6 +772,32 @@ const SHAPE_OPENERS = [
 const SHAPE_TO_BRACKETS$1 = {};
 for (const [opener, closer, name] of SHAPE_OPENERS) SHAPE_TO_BRACKETS$1[name] = [opener, closer];
 function parseNodeDecl(text) {
+	let className;
+	const classIdx = text.indexOf(":::");
+	if (classIdx >= 0) {
+		className = text.slice(classIdx + 3).trim();
+		text = text.slice(0, classIdx);
+	}
+	const atMatch = text.match(/^([a-zA-Z_][\w]*)@\{(.+)\}$/s);
+	if (atMatch) {
+		const id = atMatch[1];
+		const body = atMatch[2].trim();
+		let shape = "rectangle";
+		let label = "";
+		for (const line of body.split(",")) {
+			const kv = line.match(/^\s*(\w+)\s*:\s*"?([^"]*)"?\s*$/);
+			if (kv) {
+				if (kv[1] === "shape") shape = kv[2].trim();
+				else if (kv[1] === "label") label = kv[2].trim();
+			}
+		}
+		return {
+			id,
+			label,
+			shape,
+			...className && { className }
+		};
+	}
 	for (const [opener, closer, shapeName] of SHAPE_OPENERS) {
 		const opIdx = text.indexOf(opener);
 		if (opIdx < 0) continue;
@@ -714,13 +807,15 @@ function parseNodeDecl(text) {
 		return {
 			id,
 			label: text.slice(opIdx + opener.length, text.length - closer.length).trim(),
-			shape: shapeName
+			shape: shapeName,
+			...className && { className }
 		};
 	}
 	if (/^[a-zA-Z_][\w]*$/.test(text)) return {
 		id: text,
 		label: "",
-		shape: "rectangle"
+		shape: "rectangle",
+		...className && { className }
 	};
 	return null;
 }
@@ -836,6 +931,12 @@ const EDGE_ARROWS = [
 		arrowType: "none",
 		endMarker: "arrow",
 		bidirectional: false
+	}],
+	[/^~~~$/, {
+		stroke: "invisible",
+		arrowType: "none",
+		endMarker: "arrow",
+		bidirectional: false
 	}]
 ];
 function findEdge(line) {
@@ -903,7 +1004,7 @@ function fromMermaidFlowchart(input) {
 	const classAssignments = {};
 	let edgeCounter = 0;
 	const parentStack = [null];
-	function ensureNode(id, label, shape) {
+	function ensureNode(id, label, shape, className) {
 		if (!nodeMap.has(id)) nodeMap.set(id, {
 			type: "node",
 			id,
@@ -916,6 +1017,10 @@ function fromMermaidFlowchart(input) {
 		const node = nodeMap.get(id);
 		if (label && !node.label) node.label = label;
 		if (shape && shape !== "rectangle" && !node.shape) node.shape = shape;
+		if (className) {
+			if (!classAssignments[id]) classAssignments[id] = [];
+			if (!classAssignments[id].includes(className)) classAssignments[id].push(className);
+		}
 		return node;
 	}
 	for (let i = 1; i < lines.length; i++) {
@@ -928,7 +1033,15 @@ function fromMermaidFlowchart(input) {
 			parentStack.push(subId);
 			continue;
 		}
-		if (/^direction\s+(TD|TB|BT|LR|RL)\s*$/.test(line)) continue;
+		const dirMatch = line.match(/^direction\s+(TD|TB|BT|LR|RL)\s*$/);
+		if (dirMatch) {
+			const parentId = parentStack[parentStack.length - 1];
+			if (parentId) {
+				const parentNode = nodeMap.get(parentId);
+				if (parentNode) parentNode.data.direction = MERMAID_TO_DIRECTION[dirMatch[1]];
+			}
+			continue;
+		}
 		if (line === "end") {
 			if (parentStack.length > 1) parentStack.pop();
 			continue;
@@ -992,11 +1105,11 @@ function fromMermaidFlowchart(input) {
 			if (!edgeResult) break;
 			foundEdge = true;
 			const sourceDecl = parseNodeDecl(edgeResult.sourceText);
-			if (sourceDecl) ensureNode(sourceDecl.id, sourceDecl.label, sourceDecl.shape);
+			if (sourceDecl) ensureNode(sourceDecl.id, sourceDecl.label, sourceDecl.shape, sourceDecl.className);
 			const targetDecl = parseNodeDecl(edgeResult.targetText);
 			let targetId;
 			if (targetDecl) {
-				ensureNode(targetDecl.id, targetDecl.label, targetDecl.shape);
+				ensureNode(targetDecl.id, targetDecl.label, targetDecl.shape, targetDecl.className);
 				targetId = targetDecl.id;
 				remaining = "";
 			} else {
@@ -1004,7 +1117,7 @@ function fromMermaidFlowchart(input) {
 				if (nextEdge) {
 					const tDecl = parseNodeDecl(nextEdge.sourceText);
 					if (tDecl) {
-						ensureNode(tDecl.id, tDecl.label, tDecl.shape);
+						ensureNode(tDecl.id, tDecl.label, tDecl.shape, tDecl.className);
 						targetId = tDecl.id;
 					} else {
 						targetId = nextEdge.sourceText;
@@ -1039,7 +1152,7 @@ function fromMermaidFlowchart(input) {
 		if (foundEdge) continue;
 		const nodeDecl = parseNodeDecl(line);
 		if (nodeDecl) {
-			ensureNode(nodeDecl.id, nodeDecl.label, nodeDecl.shape);
+			ensureNode(nodeDecl.id, nodeDecl.label, nodeDecl.shape, nodeDecl.className);
 			continue;
 		}
 		if (line.includes(";")) {
@@ -1108,6 +1221,10 @@ function toMermaidFlowchart(graph) {
 		for (const node of children) if (isParent.has(node.id)) {
 			const label = node.label ? `[${escapeMermaidLabel(node.label)}]` : "";
 			lines.push(`${indent}subgraph ${node.id}${label}`);
+			if (node.data?.direction) {
+				const subDir = DIRECTION_TO_MERMAID[node.data.direction] ?? "TD";
+				lines.push(`${indent}    direction ${subDir}`);
+			}
 			writeNodes(node.id, indent + "    ");
 			lines.push(`${indent}end`);
 		} else {
@@ -1120,12 +1237,18 @@ function toMermaidFlowchart(graph) {
 	for (const edge of graph.edges) {
 		const d = edge.data;
 		let arrow;
-		if (d?.bidirectional) arrow = d.stroke === "thick" ? "<==>" : d.stroke === "dotted" ? "<-.->" : "<-->";
+		if (d?.stroke === "invisible") arrow = "~~~";
+		else if (d?.bidirectional) arrow = d.stroke === "thick" ? "<==>" : d.stroke === "dotted" ? "<-.->" : "<-->";
 		else if (d?.stroke === "thick") arrow = d.arrowType === "none" ? "===" : "==>";
 		else if (d?.stroke === "dotted") arrow = d.arrowType === "none" ? "-.-" : "-.->";
-		else if (d?.endMarker === "circle") arrow = "--o";
-		else if (d?.endMarker === "cross") arrow = "--x";
-		else arrow = d?.arrowType === "none" ? "---" : "-->";
+		else {
+			let prefix = "";
+			if (d?.startMarker === "circle") prefix = "o";
+			else if (d?.startMarker === "cross") prefix = "x";
+			if (d?.endMarker === "circle") arrow = `${prefix}--o`;
+			else if (d?.endMarker === "cross") arrow = `${prefix}--x`;
+			else arrow = d?.arrowType === "none" ? `${prefix}---` : `${prefix}-->`;
+		}
 		let labelStr = "";
 		if (edge.label) labelStr = `|${escapeMermaidLabel(edge.label)}|`;
 		lines.push(`    ${edge.sourceId} ${arrow}${labelStr} ${edge.targetId}`);
@@ -1177,7 +1300,11 @@ function fromMermaidState(input) {
 	let edgeCounter = 0;
 	let startCounter = 0;
 	let endCounter = 0;
+	let graphDirection;
+	const classDefs = {};
+	const classAssignments = {};
 	const parentStack = [null];
+	const regionCounters = /* @__PURE__ */ new Map();
 	function ensureNode(id) {
 		if (!nodeMap.has(id)) nodeMap.set(id, {
 			type: "node",
@@ -1209,7 +1336,16 @@ function fromMermaidState(input) {
 	for (let i = 1; i < lines.length; i++) {
 		const line = lines[i].trim();
 		if (!line) continue;
-		if (/^direction\s+(TD|TB|BT|LR|RL)\s*$/.test(line)) continue;
+		const dirMatch = line.match(/^direction\s+(TD|TB|BT|LR|RL)\s*$/);
+		if (dirMatch) {
+			const dir = MERMAID_TO_DIRECTION[dirMatch[1]];
+			const currentParent = parentStack[parentStack.length - 1];
+			if (currentParent) {
+				const parentNode = nodeMap.get(currentParent);
+				if (parentNode) parentNode.data.direction = dir;
+			} else graphDirection = dir;
+			continue;
+		}
 		const compositeMatch = line.match(/^state\s+(\S+)\s*\{?\s*$/);
 		if (compositeMatch && line.includes("{")) {
 			const stateId = compositeMatch[1];
@@ -1235,7 +1371,66 @@ function fromMermaidState(input) {
 			continue;
 		}
 		if (line === "}" || line === "end") {
-			if (parentStack.length > 1) parentStack.pop();
+			if (parentStack.length > 1) {
+				const top = parentStack[parentStack.length - 1];
+				if (top && top.includes("_region_")) parentStack.pop();
+				parentStack.pop();
+			}
+			continue;
+		}
+		if (/^-{2,}$/.test(line)) {
+			const compositeParent = (() => {
+				for (let s = parentStack.length - 1; s >= 0; s--) {
+					const id = parentStack[s];
+					if (id && !id.includes("_region_")) return id;
+				}
+				return null;
+			})();
+			if (compositeParent) {
+				const parentNode = nodeMap.get(compositeParent);
+				parentNode.data.stateType = "parallel";
+				const regionIndex = regionCounters.get(compositeParent) ?? 0;
+				if (regionIndex === 0) {
+					const region0Id = `${compositeParent}_region_0`;
+					const region0 = {
+						type: "node",
+						id: region0Id,
+						parentId: compositeParent,
+						initialNodeId: null,
+						label: region0Id,
+						data: {}
+					};
+					nodeMap.set(region0Id, region0);
+					for (const node of nodeMap.values()) if (node.parentId === compositeParent && node.id !== region0Id) node.parentId = region0Id;
+					const region1Id = `${compositeParent}_region_1`;
+					const region1 = {
+						type: "node",
+						id: region1Id,
+						parentId: compositeParent,
+						initialNodeId: null,
+						label: region1Id,
+						data: {}
+					};
+					nodeMap.set(region1Id, region1);
+					if (parentStack[parentStack.length - 1] === compositeParent) parentStack.push(region1Id);
+					regionCounters.set(compositeParent, 2);
+				} else {
+					const top = parentStack[parentStack.length - 1];
+					if (top && top.includes("_region_")) parentStack.pop();
+					const nextRegionId = `${compositeParent}_region_${regionIndex}`;
+					const nextRegion = {
+						type: "node",
+						id: nextRegionId,
+						parentId: compositeParent,
+						initialNodeId: null,
+						label: nextRegionId,
+						data: {}
+					};
+					nodeMap.set(nextRegionId, nextRegion);
+					parentStack.push(nextRegionId);
+					regionCounters.set(compositeParent, regionIndex + 1);
+				}
+			}
 			continue;
 		}
 		const noteMatch = line.match(/^note\s+(left|right)\s+of\s+(\S+)\s*:\s*(.+)$/i);
@@ -1251,15 +1446,29 @@ function fromMermaidState(input) {
 			});
 			continue;
 		}
-		const transMatch = line.match(/^(\S+)\s*-->\s*(\S+)\s*(?::\s*(.+))?$/);
+		const transMatch = line.match(/^(\S+?)(?::::([\w]+))?\s*-->\s*(\S+?)(?::::([\w]+))?\s*(?::\s*(.+))?$/);
 		if (transMatch) {
 			let sourceId = transMatch[1];
-			let targetId = transMatch[2];
-			const label = transMatch[3]?.trim() ?? "";
+			const sourceClass = transMatch[2];
+			let targetId = transMatch[3];
+			const targetClass = transMatch[4];
+			const label = transMatch[5]?.trim() ?? "";
 			if (sourceId === "[*]") sourceId = resolveStarNode("source");
-			else ensureNode(sourceId);
+			else {
+				ensureNode(sourceId);
+				if (sourceClass) {
+					if (!classAssignments[sourceId]) classAssignments[sourceId] = [];
+					classAssignments[sourceId].push(sourceClass);
+				}
+			}
 			if (targetId === "[*]") targetId = resolveStarNode("target");
-			else ensureNode(targetId);
+			else {
+				ensureNode(targetId);
+				if (targetClass) {
+					if (!classAssignments[targetId]) classAssignments[targetId] = [];
+					classAssignments[targetId].push(targetClass);
+				}
+			}
 			const edgeId = generateEdgeId(sourceId, targetId, edgeCounter++);
 			edges.push({
 				type: "edge",
@@ -1271,7 +1480,7 @@ function fromMermaidState(input) {
 			});
 			continue;
 		}
-		const descMatch = line.match(/^(\S+)\s*:\s*(.+)$/);
+		const descMatch = line.match(/^([a-zA-Z_][\w]*)\s*:\s*([^:].*)$/);
 		if (descMatch) {
 			const stateId = descMatch[1];
 			const description = descMatch[2].trim();
@@ -1279,18 +1488,67 @@ function fromMermaidState(input) {
 			node.data.description = description;
 			continue;
 		}
-		if (/^[a-zA-Z_][\w]*$/.test(line)) {
-			ensureNode(line);
+		const classDefMatch = line.match(/^classDef\s+(\S+)\s+(.+)$/);
+		if (classDefMatch) {
+			const className = classDefMatch[1];
+			const propsStr = classDefMatch[2];
+			const props = {};
+			for (const pair of propsStr.split(",")) {
+				const [k, v] = pair.split(":").map((s) => s.trim());
+				if (k && v) props[k] = v;
+			}
+			classDefs[className] = props;
+			continue;
+		}
+		const classAssignMatch = line.match(/^class\s+(.+)\s+(\S+)\s*$/);
+		if (classAssignMatch) {
+			const nodeIds = classAssignMatch[1].split(",").map((s) => s.trim());
+			const className = classAssignMatch[2];
+			for (const nid of nodeIds) {
+				if (!classAssignments[nid]) classAssignments[nid] = [];
+				classAssignments[nid].push(className);
+			}
+			continue;
+		}
+		const bareMatch = line.match(/^([a-zA-Z_][\w]*)(?::::([\w]+))?$/);
+		if (bareMatch) {
+			const node = ensureNode(bareMatch[1]);
+			if (bareMatch[2]) {
+				if (!classAssignments[node.id]) classAssignments[node.id] = [];
+				classAssignments[node.id].push(bareMatch[2]);
+			}
 			continue;
 		}
 	}
+	for (const [nodeId, classes] of Object.entries(classAssignments)) {
+		const node = nodeMap.get(nodeId);
+		if (node) {
+			node.data.classes = classes;
+			for (const cls of classes) {
+				const def = classDefs[cls];
+				if (def) {
+					if (def.fill) node.color = def.fill;
+					const style = {};
+					for (const [k, v] of Object.entries(def)) style[k] = v;
+					if (Object.keys(style).length > 0) node.style = {
+						...node.style ?? {},
+						...style
+					};
+				}
+			}
+		}
+	}
 	return {
 		id: "",
 		type: "directed",
 		initialNodeId: null,
 		nodes: Array.from(nodeMap.values()),
 		edges,
-		data: { diagramType: "stateDiagram" }
+		data: {
+			diagramType: "stateDiagram",
+			...Object.keys(classDefs).length > 0 && { classDefs }
+		},
+		direction: graphDirection
 	};
 }
 /**
@@ -1302,6 +1560,10 @@ function fromMermaidState(input) {
 */
 function toMermaidState(graph) {
 	const lines = ["stateDiagram-v2"];
+	if (graph.direction) {
+		const mDir = DIRECTION_TO_MERMAID[graph.direction];
+		if (mDir) lines.push(`    direction ${mDir}`);
+	}
 	const childrenMap = /* @__PURE__ */ new Map();
 	for (const node of graph.nodes) {
 		const pid = node.parentId ?? null;
@@ -1314,11 +1576,22 @@ function toMermaidState(graph) {
 		const children = childrenMap.get(parentId) ?? [];
 		for (const node of children) {
 			if (node.data?.isStart || node.data?.isEnd) continue;
-			if (node.data?.stateType) lines.push(`${indent}state ${node.id} <<${node.data.stateType}>>`);
+			if (node.id.includes("_region_")) continue;
+			if (node.data?.stateType && node.data.stateType !== "parallel") lines.push(`${indent}state ${node.id} <<${node.data.stateType}>>`);
 			if (node.data?.description) lines.push(`${indent}state "${escapeMermaidLabel(node.data.description)}" as ${node.id}`);
 			if (isParent.has(node.id)) {
 				lines.push(`${indent}state ${node.id} {`);
-				writeNodes(node.id, indent + "    ");
+				if (node.data?.direction) {
+					const mDir = DIRECTION_TO_MERMAID[node.data.direction];
+					if (mDir) lines.push(`${indent}    direction ${mDir}`);
+				}
+				if (node.data?.stateType === "parallel") {
+					const regions = (childrenMap.get(node.id) ?? []).filter((r) => r.id.includes("_region_"));
+					for (let ri = 0; ri < regions.length; ri++) {
+						if (ri > 0) lines.push(`${indent}    --`);
+						writeNodes(regions[ri].id, indent + "    ");
+					}
+				} else writeNodes(node.id, indent + "    ");
 				lines.push(`${indent}}`);
 			}
 			if (node.data?.notes) for (const note of node.data.notes) lines.push(`${indent}note ${note.position} of ${node.id} : ${escapeMermaidLabel(note.text)}`);
@@ -1335,6 +1608,17 @@ function toMermaidState(graph) {
 		const label = edge.label ? ` : ${escapeMermaidLabel(edge.label)}` : "";
 		lines.push(`    ${sourceId} --> ${targetId}${label}`);
 	}
+	const gd = graph.data;
+	if (gd?.classDefs) for (const [name, props] of Object.entries(gd.classDefs)) {
+		const propsStr = Object.entries(props).map(([k, v]) => `${k}:${v}`).join(",");
+		lines.push(`    classDef ${name} ${propsStr}`);
+	}
+	const classMap = /* @__PURE__ */ new Map();
+	for (const node of graph.nodes) if (node.data?.classes?.length) for (const cls of node.data.classes) {
+		if (!classMap.has(cls)) classMap.set(cls, []);
+		classMap.get(cls).push(node.id);
+	}
+	for (const [cls, nodeIds] of classMap) lines.push(`    class ${nodeIds.join(",")} ${cls}`);
 	return lines.join("\n");
 }
 /**

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

@@ -1,4 +1,4 @@
-import { c as Graph, f as GraphFormatConverter } from "../../types-Bq_fmLwW.mjs";
+import { c as Graph, f as GraphFormatConverter } from "../../types-FBZCrmnG.mjs";
 
 //#region src/formats/tgf/index.d.ts
 

package/dist/formats/tgf/index.mjs

@@ -1,4 +1,4 @@
-import { n as createFormatConverter } from "../../converter-C5DlzzHs.mjs";
+import { n as createFormatConverter } from "../../converter-B5CUD0r9.mjs";
 
 //#region src/formats/tgf/index.ts
 /**

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

@@ -1,4 +1,4 @@
-import { D as VisualGraphFormatConverter, T as VisualGraph } from "../../types-Bq_fmLwW.mjs";
+import { D as VisualGraphFormatConverter, T as VisualGraph } from "../../types-FBZCrmnG.mjs";
 import { EdgeBase, NodeBase } from "@xyflow/system";
 
 //#region src/formats/xyflow/index.d.ts

package/dist/index.d.mts

@@ -1,4 +1,4 @@
-import { C as TraversalOptions, E as VisualGraphConfig, O as VisualNode, S as TransitionOptions, T as VisualGraph, _ as MSTOptions, a as EntitiesConfig, b as PathOptions, c as Graph, d as GraphEdge, f as GraphFormatConverter, g as GraphStep, h as GraphPath, i as EdgeConfig, l as GraphConfig, m as GraphPatch, n as DeleteNodeOptions, o as EntitiesUpdate, p as GraphNode, r as EdgeChange, s as EntityRect, t as AllPairsShortestPathsOptions, u as GraphDiff, v as NodeChange, w as VisualEdge, x as SinglePathOptions, y as NodeConfig } from "./types-Bq_fmLwW.mjs";
+import { C as TraversalOptions, E as VisualGraphConfig, O as VisualNode, S as TransitionOptions, T as VisualGraph, _ as MSTOptions, a as EntitiesConfig, b as PathOptions, c as Graph, d as GraphEdge, f as GraphFormatConverter, g as GraphStep, h as GraphPath, i as EdgeConfig, l as GraphConfig, m as GraphPatch, n as DeleteNodeOptions, o as EntitiesUpdate, p as GraphNode, r as EdgeChange, s as EntityRect, t as AllPairsShortestPathsOptions, u as GraphDiff, v as NodeChange, w as VisualEdge, x as SinglePathOptions, y as NodeConfig } from "./types-FBZCrmnG.mjs";
 import { bfs, dfs, genCycles, genPostorders, genPreorders, genShortestPaths, genSimplePaths, getAllPairsShortestPaths, getConnectedComponents, getCycles, getMinimumSpanningTree, getPostorder, getPostorders, getPreorder, getPreorders, getShortestPath, getShortestPaths, getSimplePath, getSimplePaths, getStronglyConnectedComponents, getTopologicalSort, hasPath, isAcyclic, isConnected, isTree, joinPaths } from "./algorithms.mjs";
 import { createFormatConverter } from "./formats/converter/index.mjs";
 import { getAncestors, getChildren, getDegree, getDepth, getDescendants, getEdgeBetween, getEdgesOf, getInDegree, getInEdges, getLCA, getNeighbors, getOutDegree, getOutEdges, getParent, getPredecessors, getRelativeDistance, getRelativeDistanceMap, getRoots, getSiblings, getSinks, getSources, getSuccessors, isCompound, isLeaf } from "./queries.mjs";

package/dist/index.mjs

@@ -1,7 +1,7 @@
-import { o as invalidateIndex, t as getIndex } from "./indexing-DitHphT7.mjs";
-import { A as addNode, B as hasNode, C as isAcyclic, D as GraphInstance, E as joinPaths, F as deleteEntities, H as updateEntities, I as deleteNode, L as getEdge, M as createGraphFromTransition, N as createVisualGraph, O as addEdge, P as deleteEdge, R as getNode, S as hasPath, T as isTree, U as updateNode, V as updateEdge, _ as getShortestPaths, a as genPreorders, b as getStronglyConnectedComponents, c as getAllPairsShortestPaths, d as getMinimumSpanningTree, f as getPostorder, g as getShortestPath, h as getPreorders, i as genPostorders, j as createGraph, k as addEntities, l as getConnectedComponents, m as getPreorder, n as dfs, o as genShortestPaths, p as getPostorders, r as genCycles, s as genSimplePaths, t as bfs, u as getCycles, v as getSimplePath, w as isConnected, x as getTopologicalSort, y as getSimplePaths, z as hasEdge } from "./algorithms-CnTmuX9t.mjs";
+import { o as invalidateIndex, t as getIndex } from "./indexing-DyfgLuzw.mjs";
+import { A as addNode, B as hasNode, C as isAcyclic, D as GraphInstance, E as joinPaths, F as deleteEntities, H as updateEntities, I as deleteNode, L as getEdge, M as createGraphFromTransition, N as createVisualGraph, O as addEdge, P as deleteEdge, R as getNode, S as hasPath, T as isTree, U as updateNode, V as updateEdge, _ as getShortestPaths, a as genPreorders, b as getStronglyConnectedComponents, c as getAllPairsShortestPaths, d as getMinimumSpanningTree, f as getPostorder, g as getShortestPath, h as getPreorders, i as genPostorders, j as createGraph, k as addEntities, l as getConnectedComponents, m as getPreorder, n as dfs, o as genShortestPaths, p as getPostorders, r as genCycles, s as genSimplePaths, t as bfs, u as getCycles, v as getSimplePath, w as isConnected, x as getTopologicalSort, y as getSimplePaths, z as hasEdge } from "./algorithms-DldwenLt.mjs";
 import { getAncestors, getChildren, getDegree, getDepth, getDescendants, getEdgeBetween, getEdgesOf, getInDegree, getInEdges, getLCA, getNeighbors, getOutDegree, getOutEdges, getParent, getPredecessors, getRelativeDistance, getRelativeDistanceMap, getRoots, getSiblings, getSinks, getSources, getSuccessors, isCompound, isLeaf } from "./queries.mjs";
-import { n as createFormatConverter } from "./converter-C5DlzzHs.mjs";
+import { n as createFormatConverter } from "./converter-B5CUD0r9.mjs";
 
 //#region src/diff.ts
 function nodeToConfig(node) {

package/dist/queries.d.mts

@@ -1,4 +1,4 @@
-import { c as Graph, d as GraphEdge, p as GraphNode } from "./types-Bq_fmLwW.mjs";
+import { c as Graph, d as GraphEdge, p as GraphNode } from "./types-FBZCrmnG.mjs";
 
 //#region src/queries.d.ts
 

package/dist/queries.mjs

@@ -1,4 +1,4 @@
-import { t as getIndex } from "./indexing-DitHphT7.mjs";
+import { t as getIndex } from "./indexing-DyfgLuzw.mjs";
 
 //#region src/queries.ts
 /**