@statelyai/graph 0.11.1 → 0.13.0

package/dist/formats/jgf/index.mjs

@@ -23,6 +23,7 @@ function toJGF(graph) {
 	if (graph.initialNodeId) metadata.initialNodeId = graph.initialNodeId;
 	if (graph.data !== void 0) metadata.data = graph.data;
 	if (graph.direction) metadata.direction = graph.direction;
+	if (graph.style !== void 0) metadata.style = graph.style;
 	return { graph: {
 		id: graph.id || void 0,
 		directed: graph.type === "directed",
@@ -38,6 +39,8 @@ function toJGF(graph) {
 			if (n.height !== void 0) meta.height = n.height;
 			if (n.shape) meta.shape = n.shape;
 			if (n.color) meta.color = n.color;
+			if (n.style !== void 0) meta.style = n.style;
+			if (n.ports !== void 0) meta.ports = n.ports;
 			return {
 				id: n.id,
 				...n.label && { label: n.label },
@@ -47,7 +50,15 @@ function toJGF(graph) {
 		edges: graph.edges.map((e) => {
 			const meta = {};
 			if (e.data !== void 0) meta.data = e.data;
+			if (e.weight !== void 0) meta.weight = e.weight;
+			if (e.x !== void 0) meta.x = e.x;
+			if (e.y !== void 0) meta.y = e.y;
+			if (e.width !== void 0) meta.width = e.width;
+			if (e.height !== void 0) meta.height = e.height;
 			if (e.color) meta.color = e.color;
+			if (e.style !== void 0) meta.style = e.style;
+			if (e.sourcePort !== void 0) meta.sourcePort = e.sourcePort;
+			if (e.targetPort !== void 0) meta.targetPort = e.targetPort;
 			return {
 				id: e.id,
 				source: e.sourceId,
@@ -86,6 +97,7 @@ function fromJGF(jgf) {
 		initialNodeId: g.metadata?.initialNodeId ?? null,
 		data: g.metadata?.data,
 		...g.metadata?.direction && { direction: g.metadata.direction },
+		...g.metadata?.style !== void 0 && { style: g.metadata.style },
 		nodes: g.nodes.map((n) => ({
 			type: "node",
 			id: n.id,
@@ -98,7 +110,9 @@ function fromJGF(jgf) {
 			...n.metadata?.width !== void 0 && { width: n.metadata.width },
 			...n.metadata?.height !== void 0 && { height: n.metadata.height },
 			...n.metadata?.shape && { shape: n.metadata.shape },
-			...n.metadata?.color && { color: n.metadata.color }
+			...n.metadata?.color && { color: n.metadata.color },
+			...n.metadata?.style !== void 0 && { style: n.metadata.style },
+			...n.metadata?.ports !== void 0 && { ports: n.metadata.ports }
 		})),
 		edges: g.edges.map((e, i) => ({
 			type: "edge",
@@ -107,7 +121,15 @@ function fromJGF(jgf) {
 			targetId: e.target,
 			label: e.label ?? "",
 			data: e.metadata?.data,
-			...e.metadata?.color && { color: e.metadata.color }
+			...e.metadata?.weight !== void 0 && { weight: e.metadata.weight },
+			...e.metadata?.x !== void 0 && { x: e.metadata.x },
+			...e.metadata?.y !== void 0 && { y: e.metadata.y },
+			...e.metadata?.width !== void 0 && { width: e.metadata.width },
+			...e.metadata?.height !== void 0 && { height: e.metadata.height },
+			...e.metadata?.color && { color: e.metadata.color },
+			...e.metadata?.style !== void 0 && { style: e.metadata.style },
+			...e.metadata?.sourcePort !== void 0 && { sourcePort: e.metadata.sourcePort },
+			...e.metadata?.targetPort !== void 0 && { targetPort: e.metadata.targetPort }
 		}))
 	};
 }

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

@@ -165,6 +165,7 @@ interface StateNodeData {
   notes?: Array<{
     position: 'left' | 'right';
     text: string;
+    format?: 'inline' | 'block';
   }>;
   isStart?: boolean;
   isEnd?: boolean;

package/dist/formats/mermaid/index.mjs

@@ -1415,10 +1415,16 @@ function fromMermaidState(input) {
 	const parentStack = [null];
 	const regionCounters = /* @__PURE__ */ new Map();
 	function ensureNode(id) {
-		if (!nodeMap.has(id)) nodeMap.set(id, {
+		const parentId = parentStack[parentStack.length - 1];
+		const existing = nodeMap.get(id);
+		if (existing) {
+			if (parentId && existing.parentId === null && existing.id !== parentId) existing.parentId = parentId;
+			return existing;
+		}
+		nodeMap.set(id, {
 			type: "node",
 			id,
-			parentId: parentStack[parentStack.length - 1],
+			parentId,
 			initialNodeId: null,
 			label: id,
 			data: {}
@@ -1462,6 +1468,15 @@ function fromMermaidState(input) {
 			parentStack.push(stateId);
 			continue;
 		}
+		const compositeStateAsMatch = line.match(/^state\s+"([^"]+)"\s+as\s+(\S+)\s*\{\s*$/);
+		if (compositeStateAsMatch) {
+			const description = compositeStateAsMatch[1];
+			const stateId = compositeStateAsMatch[2];
+			const node = ensureNode(stateId);
+			node.data.description = description;
+			parentStack.push(stateId);
+			continue;
+		}
 		const stereotypeMatch = line.match(/^state\s+(\S+)\s+<<(choice|fork|join)>>\s*$/);
 		if (stereotypeMatch) {
 			const stateId = stereotypeMatch[1];
@@ -1542,16 +1557,27 @@ function fromMermaidState(input) {
 			}
 			continue;
 		}
-		const noteMatch = line.match(/^note\s+(left|right)\s+of\s+(\S+)\s*:\s*(.+)$/i);
+		const noteMatch = line.match(/^note\s+(left|right)\s+of\s+(\S+)\s*(?::\s*(.*))?$/i);
 		if (noteMatch) {
 			const position = noteMatch[1].toLowerCase();
 			const stateId = noteMatch[2];
-			const text = noteMatch[3].trim();
+			const inlineText = noteMatch[3]?.trim();
+			const text = inlineText && inlineText.length > 0 ? inlineText : (() => {
+				const content = [];
+				while (i + 1 < lines.length) {
+					i++;
+					const noteLine = lines[i].trim();
+					if (/^end\s+note$/i.test(noteLine)) break;
+					content.push(noteLine);
+				}
+				return content.join("\n").trim();
+			})();
 			const node = ensureNode(stateId);
 			if (!node.data.notes) node.data.notes = [];
 			node.data.notes.push({
 				position,
-				text
+				text,
+				format: inlineText && inlineText.length > 0 ? "inline" : "block"
 			});
 			continue;
 		}
@@ -1687,9 +1713,9 @@ function toMermaidState(graph) {
 			if (node.data?.isStart || node.data?.isEnd) continue;
 			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} {`);
+				const stateDecl = node.data?.description ? `state "${escapeMermaidLabel(node.data.description)}" as ${node.id} {` : `state ${node.id} {`;
+				lines.push(`${indent}${stateDecl}`);
 				if (node.data?.direction) {
 					const mDir = DIRECTION_TO_MERMAID[node.data.direction];
 					if (mDir) lines.push(`${indent}    direction ${mDir}`);
@@ -1702,8 +1728,12 @@ function toMermaidState(graph) {
 					}
 				} 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)}`);
+			} else if (node.data?.description) lines.push(`${indent}state "${escapeMermaidLabel(node.data.description)}" as ${node.id}`);
+			if (node.data?.notes) for (const note of node.data.notes) if (note.format === "block" || note.text.includes("\n")) {
+				lines.push(`${indent}note ${note.position} of ${node.id}`);
+				for (const noteLine of note.text.split("\n")) lines.push(`${indent}    ${escapeMermaidLabel(noteLine)}`);
+				lines.push(`${indent}end note`);
+			} else lines.push(`${indent}note ${note.position} of ${node.id} : ${escapeMermaidLabel(note.text)}`);
 		}
 	}
 	writeNodes(null, "    ");

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

@@ -9,6 +9,7 @@ type XYFlowEdge<TEdgeData extends Record<string, unknown> = Record<string, unkno
 interface XYFlow<TNodeData extends Record<string, unknown> = Record<string, unknown>, TEdgeData extends Record<string, unknown> = Record<string, unknown>> {
   nodes: XYFlowNode<TNodeData>[];
   edges: XYFlowEdge<TEdgeData>[];
+  data?: Record<string, unknown>;
 }
 /**
  * Converts a visual graph to xyflow (React Flow / Svelte Flow) format.

package/dist/formats/xyflow/index.mjs

@@ -1,4 +1,27 @@
 //#region src/formats/xyflow/index.ts
+const STATELYAI_METADATA_KEY = "__statelyai";
+function toDataObject(value) {
+	return value && typeof value === "object" && !Array.isArray(value) ? { ...value } : {};
+}
+function withMetadata(value, metadata) {
+	return {
+		...toDataObject(value),
+		[STATELYAI_METADATA_KEY]: {
+			...value !== void 0 && { data: value },
+			...metadata
+		}
+	};
+}
+function readMetadata(value) {
+	if (!value || typeof value !== "object") return void 0;
+	const metadata = value[STATELYAI_METADATA_KEY];
+	return metadata && typeof metadata === "object" ? metadata : void 0;
+}
+function readUserData(value) {
+	const metadata = readMetadata(value);
+	if (metadata && "data" in metadata) return metadata.data;
+	return value;
+}
 /**
 * Converts a visual graph to xyflow (React Flow / Svelte Flow) format.
 *
@@ -21,6 +44,14 @@
 */
 function toXYFlow(graph) {
 	return {
+		data: { [STATELYAI_METADATA_KEY]: { graph: {
+			id: graph.id,
+			type: graph.type,
+			initialNodeId: graph.initialNodeId,
+			data: graph.data,
+			direction: graph.direction,
+			style: graph.style
+		} } },
 		nodes: graph.nodes.map((n) => {
 			const node = {
 				id: n.id,
@@ -28,12 +59,18 @@ function toXYFlow(graph) {
 					x: n.x,
 					y: n.y
 				},
-				data: n.data ?? {}
+				data: withMetadata(n.data, { node: {
+					initialNodeId: n.initialNodeId,
+					label: n.label,
+					color: n.color,
+					style: n.style,
+					ports: n.ports
+				} })
 			};
 			if (n.parentId) node.parentId = n.parentId;
 			if (n.shape) node.type = n.shape;
-			if (n.width) node.width = n.width;
-			if (n.height) node.height = n.height;
+			if (n.width !== void 0) node.width = n.width;
+			if (n.height !== void 0) node.height = n.height;
 			return node;
 		}),
 		edges: graph.edges.map((e) => {
@@ -44,11 +81,17 @@ function toXYFlow(graph) {
 			};
 			if (e.sourcePort) edge.sourceHandle = e.sourcePort;
 			if (e.targetPort) edge.targetHandle = e.targetPort;
-			if (e.data !== void 0) edge.data = e.data;
-			if (e.label) edge.data = {
-				...edge.data,
-				label: e.label
-			};
+			edge.data = withMetadata(e.data, { edge: {
+				label: e.label,
+				weight: e.weight,
+				color: e.color,
+				style: e.style,
+				x: e.x,
+				y: e.y,
+				width: e.width,
+				height: e.height
+			} });
+			if (e.label) edge.data.label = e.label;
 			return edge;
 		})
 	};
@@ -73,39 +116,53 @@ function fromXYFlow(flow) {
 	if (!flow || typeof flow !== "object") throw new Error("XYFlow: expected an object");
 	if (!Array.isArray(flow.nodes)) throw new Error("XYFlow: \"nodes\" must be an array");
 	if (!Array.isArray(flow.edges)) throw new Error("XYFlow: \"edges\" must be an array");
+	const graphMetadata = readMetadata(flow.data)?.graph;
 	return {
-		id: "",
-		type: "directed",
-		initialNodeId: null,
-		data: void 0,
-		direction: "down",
-		nodes: flow.nodes.map((n) => ({
-			type: "node",
-			id: n.id,
-			parentId: n.parentId ?? null,
-			initialNodeId: null,
-			label: "",
-			data: n.data,
-			x: n.position.x,
-			y: n.position.y,
-			width: n.measured?.width ?? n.width ?? n.initialWidth ?? 0,
-			height: n.measured?.height ?? n.height ?? n.initialHeight ?? 0,
-			...n.type && { shape: n.type }
-		})),
-		edges: flow.edges.map((e, i) => ({
-			type: "edge",
-			id: e.id ?? `e${i}`,
-			sourceId: e.source,
-			targetId: e.target,
-			label: e.data?.label?.toString() ?? "",
-			...e.sourceHandle && { sourcePort: e.sourceHandle },
-			...e.targetHandle && { targetPort: e.targetHandle },
-			data: e.data,
-			x: 0,
-			y: 0,
-			width: 0,
-			height: 0
-		}))
+		id: graphMetadata?.id?.toString() ?? "",
+		type: graphMetadata?.type === "undirected" ? "undirected" : "directed",
+		initialNodeId: graphMetadata && "initialNodeId" in graphMetadata ? graphMetadata.initialNodeId : null,
+		data: graphMetadata && "data" in graphMetadata ? graphMetadata.data : void 0,
+		direction: graphMetadata?.direction ?? "down",
+		...graphMetadata?.style !== void 0 && { style: graphMetadata.style },
+		nodes: flow.nodes.map((n) => {
+			const metadata = readMetadata(n.data)?.node;
+			return {
+				type: "node",
+				id: n.id,
+				parentId: n.parentId ?? null,
+				initialNodeId: metadata && "initialNodeId" in metadata ? metadata.initialNodeId : null,
+				label: metadata && "label" in metadata ? metadata.label : "",
+				data: readUserData(n.data),
+				x: n.position.x,
+				y: n.position.y,
+				width: n.measured?.width ?? n.width ?? n.initialWidth ?? 0,
+				height: n.measured?.height ?? n.height ?? n.initialHeight ?? 0,
+				...n.type && { shape: n.type },
+				...metadata?.color !== void 0 && { color: metadata.color },
+				...metadata?.style !== void 0 && { style: metadata.style },
+				...metadata?.ports !== void 0 && { ports: metadata.ports }
+			};
+		}),
+		edges: flow.edges.map((e, i) => {
+			const metadata = readMetadata(e.data)?.edge;
+			return {
+				type: "edge",
+				id: e.id ?? `e${i}`,
+				sourceId: e.source,
+				targetId: e.target,
+				label: metadata && "label" in metadata ? metadata.label : e.data?.label?.toString() ?? "",
+				...e.sourceHandle && { sourcePort: e.sourceHandle },
+				...e.targetHandle && { targetPort: e.targetHandle },
+				data: readUserData(e.data),
+				x: metadata?.x ?? 0,
+				y: metadata?.y ?? 0,
+				width: metadata?.width ?? 0,
+				height: metadata?.height ?? 0,
+				...metadata?.weight !== void 0 && { weight: metadata.weight },
+				...metadata?.color !== void 0 && { color: metadata.color },
+				...metadata?.style !== void 0 && { style: metadata.style }
+			};
+		})
 	};
 }
 /**

package/dist/index.d.mts

@@ -11,7 +11,7 @@ import { getAncestors, getChildren, getDegree, getDepth, getDescendants, getEdge
  * @example
  * ```ts
  * const port = createGraphPort({ name: 'output', direction: 'out' });
- * // { name: 'output', direction: 'out', data: undefined }
+ * // { name: 'output', direction: 'out', data: null }
  * ```
  */
 declare function createGraphPort<P = any>(config: PortConfig<P>): GraphPort<P>;
@@ -31,7 +31,7 @@ declare function createGraphNode<N = any, P = any>(config: NodeConfig<N, P>): Gr
  * @example
  * ```ts
  * const edge = createGraphEdge({ id: 'e1', sourceId: 'a', targetId: 'b' });
- * // { type: 'edge', id: 'e1', sourceId: 'a', targetId: 'b', label: null, data: undefined }
+ * // { type: 'edge', id: 'e1', sourceId: 'a', targetId: 'b', label: null, data: null }
  * ```
  */
 declare function createGraphEdge<T = any>(config: EdgeConfig<T>): GraphEdge<T>;

package/dist/index.mjs

@@ -1,5 +1,5 @@
-import { o as invalidateIndex, t as getIndex } from "./indexing-CJc-ul8e.mjs";
-import { $ as createGraphPort, A as isAcyclic, B as getShortestPaths, C as getPreorder, D as getConnectedComponents, E as dfs, F as genSimplePaths, G as GraphInstance, H as getSimplePaths, I as getAStarPath, J as addNode, K as addEdge, L as getAllPairsShortestPaths, M as isTree, N as genCycles, O as getTopologicalSort, P as genShortestPaths, Q as createGraphNode, R as getCycles, S as getPostorders, T as bfs, U as getStronglyConnectedComponents, V as getSimplePath, W as joinPaths, X as createGraphEdge, Y as createGraph, Z as createGraphFromTransition, _ as getPageRank, a as genGirvanNewmanCommunities, at as getNode, b as genPreorders, c as getLabelPropagationCommunities, ct as updateEdge, d as getClosenessCentrality, et as createVisualGraph, f as getDegreeCentrality, g as getOutDegreeCentrality, h as getInDegreeCentrality, i as getBridges, it as getEdge, j as isConnected, k as hasPath, l as getModularity, lt as updateEntities, m as getHITS, n as getArticulationPoints, nt as deleteEntities, o as getGirvanNewmanCommunities, ot as hasEdge, p as getEigenvectorCentrality, q as addEntities, r as getBiconnectedComponents, rt as deleteNode, s as getGreedyModularityCommunities, st as hasNode, t as isIsomorphic, tt as deleteEdge, u as getBetweennessCentrality, ut as updateNode, v as getMinimumSpanningTree, w as getPreorders, x as getPostorder, y as genPostorders, z as getShortestPath } from "./algorithms-BHHg7lGq.mjs";
+import { o as invalidateIndex, t as getIndex } from "./indexing-DUl3kTqm.mjs";
+import { $ as createGraphPort, A as isAcyclic, B as getShortestPaths, C as getPreorder, D as getConnectedComponents, E as dfs, F as genSimplePaths, G as GraphInstance, H as getSimplePaths, I as getAStarPath, J as addNode, K as addEdge, L as getAllPairsShortestPaths, M as isTree, N as genCycles, O as getTopologicalSort, P as genShortestPaths, Q as createGraphNode, R as getCycles, S as getPostorders, T as bfs, U as getStronglyConnectedComponents, V as getSimplePath, W as joinPaths, X as createGraphEdge, Y as createGraph, Z as createGraphFromTransition, _ as getPageRank, a as genGirvanNewmanCommunities, at as getNode, b as genPreorders, c as getLabelPropagationCommunities, ct as updateEdge, d as getClosenessCentrality, et as createVisualGraph, f as getDegreeCentrality, g as getOutDegreeCentrality, h as getInDegreeCentrality, i as getBridges, it as getEdge, j as isConnected, k as hasPath, l as getModularity, lt as updateEntities, m as getHITS, n as getArticulationPoints, nt as deleteEntities, o as getGirvanNewmanCommunities, ot as hasEdge, p as getEigenvectorCentrality, q as addEntities, r as getBiconnectedComponents, rt as deleteNode, s as getGreedyModularityCommunities, st as hasNode, t as isIsomorphic, tt as deleteEdge, u as getBetweennessCentrality, ut as updateNode, v as getMinimumSpanningTree, w as getPreorders, x as getPostorder, y as genPostorders, z as getShortestPath } from "./algorithms-BNDQcHU3.mjs";
 import { getAncestors, getChildren, getDegree, getDepth, getDescendants, getEdgesBetween, getEdgesByPort, getEdgesOf, getInDegree, getInEdges, getLCA, getNeighbors, getOutDegree, getOutEdges, getParent, getPort, getPorts, getPredecessors, getRelativeDistance, getRelativeDistanceMap, getRoots, getSiblings, getSinks, getSources, getSuccessors, isCompound, isLeaf } from "./queries.mjs";
 import { n as createFormatConverter } from "./converter-Dspillnn.mjs";
 

package/dist/{indexing-CJc-ul8e.mjs → indexing-DUl3kTqm.mjs}

@@ -20,8 +20,10 @@ const indexes = /* @__PURE__ */ new WeakMap();
 */
 function getIndex(graph) {
 	let idx = indexes.get(graph);
-	if (!idx || idx.nodeCount !== graph.nodes.length || idx.edgeCount !== graph.edges.length) {
-		idx = buildIndex(graph);
+	const sameStructure = idx && idx.nodeCount === graph.nodes.length && idx.edgeCount === graph.edges.length;
+	const signature = idx !== void 0 && sameStructure && idx.nodesRef === graph.nodes && idx.edgesRef === graph.edges ? getIndexSignature(graph) : void 0;
+	if (!idx || idx.nodeCount !== graph.nodes.length || idx.edgeCount !== graph.edges.length || signature !== void 0 && idx.signature !== signature) {
+		idx = buildIndex(graph, signature ?? getIndexSignature(graph));
 		indexes.set(graph, idx);
 	}
 	return idx;
@@ -42,7 +44,12 @@ function getIndex(graph) {
 function invalidateIndex(graph) {
 	indexes.delete(graph);
 }
-function buildIndex(graph) {
+function getIndexSignature(graph) {
+	const nodeParts = graph.nodes.map((node) => `${node.id}\u0000${node.parentId ?? ""}`);
+	const edgeParts = graph.edges.map((edge) => `${edge.id}\u0000${edge.sourceId}\u0000${edge.targetId}`);
+	return `${nodeParts.join("
")}\u0002${edgeParts.join("
")}`;
+}
+function buildIndex(graph, signature) {
 	const nodeById = /* @__PURE__ */ new Map();
 	const edgeById = /* @__PURE__ */ new Map();
 	const outEdges = /* @__PURE__ */ new Map();
@@ -70,7 +77,10 @@ function buildIndex(graph) {
 		inEdges,
 		childNodes,
 		nodeCount: graph.nodes.length,
-		edgeCount: graph.edges.length
+		edgeCount: graph.edges.length,
+		signature,
+		nodesRef: graph.nodes,
+		edgesRef: graph.edges
 	};
 }
 function indexAddNode(idx, node, arrayIndex) {
@@ -81,12 +91,14 @@ function indexAddNode(idx, node, arrayIndex) {
 	if (!idx.childNodes.has(parent)) idx.childNodes.set(parent, []);
 	idx.childNodes.get(parent).push(node.id);
 	idx.nodeCount++;
+	idx.signature = "";
 }
 function indexAddEdge(idx, edge, arrayIndex) {
 	idx.edgeById.set(edge.id, arrayIndex);
 	idx.outEdges.get(edge.sourceId)?.push(edge.id);
 	idx.inEdges.get(edge.targetId)?.push(edge.id);
 	idx.edgeCount++;
+	idx.signature = "";
 }
 /** Update childNodes index when a node's parentId changes. */
 function indexReparentNode(idx, nodeId, oldParentId, newParentId) {
@@ -98,6 +110,7 @@ function indexReparentNode(idx, nodeId, oldParentId, newParentId) {
 	const np = newParentId ?? null;
 	if (!idx.childNodes.has(np)) idx.childNodes.set(np, []);
 	idx.childNodes.get(np).push(nodeId);
+	idx.signature = "";
 }
 /** Update adjacency lists when an edge's sourceId/targetId changes. */
 function indexUpdateEdgeEndpoints(idx, edgeId, oldSourceId, oldTargetId, newSourceId, newTargetId) {
@@ -117,6 +130,7 @@ function indexUpdateEdgeEndpoints(idx, edgeId, oldSourceId, oldTargetId, newSour
 		}
 		idx.inEdges.get(newTargetId)?.push(edgeId);
 	}
+	idx.signature = "";
 }
 
 //#endregion

package/dist/queries.mjs

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

package/dist/schemas.d.mts

@@ -1,13 +1,14 @@
+import { g as GraphNode, p as GraphEdge, u as Graph, y as GraphPort } from "./types-CnZ01raw.mjs";
 import * as z from "zod";
 
 //#region src/schemas.d.ts
 declare const PortSchema: z.ZodObject<{
   name: z.ZodString;
-  direction: z.ZodOptional<z.ZodEnum<{
+  direction: z.ZodEnum<{
     in: "in";
     out: "out";
     inout: "inout";
-  }>>;
+  }>;
   label: z.ZodOptional<z.ZodString>;
   data: z.ZodAny;
   x: z.ZodOptional<z.ZodNumber>;
@@ -32,11 +33,11 @@ declare const NodeSchema: z.ZodObject<{
   style: z.ZodOptional<z.ZodRecord<z.ZodString, z.ZodUnion<readonly [z.ZodString, z.ZodNumber]>>>;
   ports: z.ZodOptional<z.ZodArray<z.ZodObject<{
     name: z.ZodString;
-    direction: z.ZodOptional<z.ZodEnum<{
+    direction: z.ZodEnum<{
       in: "in";
       out: "out";
       inout: "inout";
-    }>>;
+    }>;
     label: z.ZodOptional<z.ZodString>;
     data: z.ZodAny;
     x: z.ZodOptional<z.ZodNumber>;
@@ -86,11 +87,11 @@ declare const GraphSchema: z.ZodObject<{
     style: z.ZodOptional<z.ZodRecord<z.ZodString, z.ZodUnion<readonly [z.ZodString, z.ZodNumber]>>>;
     ports: z.ZodOptional<z.ZodArray<z.ZodObject<{
       name: z.ZodString;
-      direction: z.ZodOptional<z.ZodEnum<{
+      direction: z.ZodEnum<{
         in: "in";
         out: "out";
         inout: "inout";
-      }>>;
+      }>;
       label: z.ZodOptional<z.ZodString>;
       data: z.ZodAny;
       x: z.ZodOptional<z.ZodNumber>;
@@ -126,5 +127,19 @@ declare const GraphSchema: z.ZodObject<{
   }>>;
   style: z.ZodOptional<z.ZodRecord<z.ZodString, z.ZodUnion<readonly [z.ZodString, z.ZodNumber]>>>;
 }, z.core.$strip>;
+interface GraphValidationIssue {
+  code: string;
+  message: string;
+  path: Array<string | number>;
+}
+declare function isGraphPort(value: unknown): value is GraphPort;
+declare function isGraphNode(value: unknown): value is GraphNode;
+declare function isGraphEdge(value: unknown): value is GraphEdge;
+declare function isGraph(value: unknown): value is Graph;
+declare function getGraphPortIssues(value: unknown): GraphValidationIssue[];
+declare function getGraphNodeIssues(value: unknown): GraphValidationIssue[];
+declare function getGraphEdgeIssues(value: unknown): GraphValidationIssue[];
+declare function getGraphIssues(value: unknown): GraphValidationIssue[];
+declare function validateGraph(value: unknown): GraphValidationIssue[];
 //#endregion
-export { EdgeSchema, GraphSchema, NodeSchema, PortSchema };
+export { EdgeSchema, GraphSchema, GraphValidationIssue, NodeSchema, PortSchema, getGraphEdgeIssues, getGraphIssues, getGraphNodeIssues, getGraphPortIssues, isGraph, isGraphEdge, isGraphNode, isGraphPort, validateGraph };