@statelyai/graph 0.12.0 → 0.13.0

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

@@ -4,11 +4,11 @@ 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>;
@@ -33,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>;
@@ -87,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>;
@@ -140,5 +140,6 @@ 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, GraphValidationIssue, NodeSchema, PortSchema, getGraphEdgeIssues, getGraphIssues, getGraphNodeIssues, getGraphPortIssues, isGraph, isGraphEdge, isGraphNode, isGraphPort };
+export { EdgeSchema, GraphSchema, GraphValidationIssue, NodeSchema, PortSchema, getGraphEdgeIssues, getGraphIssues, getGraphNodeIssues, getGraphPortIssues, isGraph, isGraphEdge, isGraphNode, isGraphPort, validateGraph };

package/dist/schemas.mjs

@@ -9,7 +9,7 @@ const PortDirectionSchema = z.enum([
 ]);
 const PortSchema = z.object({
 	name: z.string(),
-	direction: PortDirectionSchema.optional(),
+	direction: PortDirectionSchema,
 	label: z.string().optional(),
 	data: z.any(),
 	x: z.number().optional(),
@@ -85,7 +85,7 @@ function isGraphEdge(value) {
 	return EdgeSchema.safeParse(value).success;
 }
 function isGraph(value) {
-	return GraphSchema.safeParse(value).success;
+	return validateGraph(value).length === 0;
 }
 function getGraphPortIssues(value) {
 	return getValidationIssues(PortSchema, value);
@@ -97,8 +97,131 @@ function getGraphEdgeIssues(value) {
 	return getValidationIssues(EdgeSchema, value);
 }
 function getGraphIssues(value) {
-	return getValidationIssues(GraphSchema, value);
+	return validateGraph(value);
+}
+function createIssue(code, message, path) {
+	return {
+		code,
+		message,
+		path
+	};
+}
+function getDuplicateIndexes(items, getKey) {
+	const indexesByKey = /* @__PURE__ */ new Map();
+	items.forEach((item, index) => {
+		const key = getKey(item);
+		if (key == null) return;
+		const indexes = indexesByKey.get(key) ?? [];
+		indexes.push(index);
+		indexesByKey.set(key, indexes);
+	});
+	for (const [key, indexes] of indexesByKey) if (indexes.length < 2) indexesByKey.delete(key);
+	return indexesByKey;
+}
+function getGraphInvariantIssues(graph) {
+	const issues = [];
+	const nodeIndexes = /* @__PURE__ */ new Map();
+	const nodesById = /* @__PURE__ */ new Map();
+	for (const [id, indexes] of getDuplicateIndexes(graph.nodes, (node) => node.id)) for (const index of indexes) issues.push(createIssue("duplicate_node_id", `Duplicate node id "${id}"`, [
+		"nodes",
+		index,
+		"id"
+	]));
+	for (const [id, indexes] of getDuplicateIndexes(graph.edges, (edge) => edge.id)) for (const index of indexes) issues.push(createIssue("duplicate_edge_id", `Duplicate edge id "${id}"`, [
+		"edges",
+		index,
+		"id"
+	]));
+	graph.nodes.forEach((node, index) => {
+		nodeIndexes.set(node.id, index);
+		nodesById.set(node.id, node);
+	});
+	if (graph.initialNodeId && !nodeIndexes.has(graph.initialNodeId)) issues.push(createIssue("missing_initial_node", `Initial node "${graph.initialNodeId}" does not exist`, ["initialNodeId"]));
+	graph.nodes.forEach((node, index) => {
+		if (node.id === "") issues.push(createIssue("empty_node_id", "Node id must be a non-empty string", [
+			"nodes",
+			index,
+			"id"
+		]));
+		if (node.parentId === "") issues.push(createIssue("empty_parent_id", "Node parentId must be a non-empty string", [
+			"nodes",
+			index,
+			"parentId"
+		]));
+		else if (node.parentId != null && !nodeIndexes.has(node.parentId)) issues.push(createIssue("missing_parent", `Parent node "${node.parentId}" does not exist`, [
+			"nodes",
+			index,
+			"parentId"
+		]));
+		if (node.initialNodeId && !nodeIndexes.has(node.initialNodeId)) issues.push(createIssue("missing_node_initial", `Initial node "${node.initialNodeId}" does not exist`, [
+			"nodes",
+			index,
+			"initialNodeId"
+		]));
+		for (const [name, indexes] of getDuplicateIndexes(node.ports ?? [], (port) => port.name)) for (const portIndex of indexes) issues.push(createIssue("duplicate_port_name", `Duplicate port name "${name}" on node "${node.id}"`, [
+			"nodes",
+			index,
+			"ports",
+			portIndex,
+			"name"
+		]));
+	});
+	for (const node of graph.nodes) {
+		const seen = /* @__PURE__ */ new Set();
+		let current = node.parentId;
+		while (current != null) {
+			if (current === node.id || seen.has(current)) {
+				issues.push(createIssue("parent_cycle", `Node "${node.id}" is part of a parent cycle`, [
+					"nodes",
+					nodeIndexes.get(node.id) ?? 0,
+					"parentId"
+				]));
+				break;
+			}
+			seen.add(current);
+			current = nodesById.get(current)?.parentId;
+		}
+	}
+	graph.edges.forEach((edge, index) => {
+		if (edge.id === "") issues.push(createIssue("empty_edge_id", "Edge id must be a non-empty string", [
+			"edges",
+			index,
+			"id"
+		]));
+		const source = nodesById.get(edge.sourceId);
+		const target = nodesById.get(edge.targetId);
+		if (!source) issues.push(createIssue("missing_source_node", `Source node "${edge.sourceId}" does not exist`, [
+			"edges",
+			index,
+			"sourceId"
+		]));
+		if (!target) issues.push(createIssue("missing_target_node", `Target node "${edge.targetId}" does not exist`, [
+			"edges",
+			index,
+			"targetId"
+		]));
+		if (source && edge.sourcePort !== void 0 && !source.ports?.some((port) => port.name === edge.sourcePort)) issues.push(createIssue("missing_source_port", `Port "${edge.sourcePort}" does not exist on source node "${edge.sourceId}"`, [
+			"edges",
+			index,
+			"sourcePort"
+		]));
+		if (target && edge.targetPort !== void 0 && !target.ports?.some((port) => port.name === edge.targetPort)) issues.push(createIssue("missing_target_port", `Port "${edge.targetPort}" does not exist on target node "${edge.targetId}"`, [
+			"edges",
+			index,
+			"targetPort"
+		]));
+	});
+	return issues;
+}
+function validateGraph(value) {
+	const shapeResult = GraphSchema.safeParse(value);
+	if (!shapeResult.success) return shapeResult.error.issues.map((issue) => ({
+		code: issue.code,
+		message: issue.message,
+		path: issue.path.map((segment) => typeof segment === "symbol" ? String(segment) : segment)
+	}));
+	return getGraphInvariantIssues(shapeResult.data);
 }
 
 //#endregion
-export { EdgeSchema, GraphSchema, NodeSchema, PortSchema, getGraphEdgeIssues, getGraphIssues, getGraphNodeIssues, getGraphPortIssues, isGraph, isGraphEdge, isGraphNode, isGraphPort };
+export { EdgeSchema, GraphSchema, NodeSchema, PortSchema, getGraphEdgeIssues, getGraphIssues, getGraphNodeIssues, getGraphPortIssues, isGraph, isGraphEdge, isGraphNode, isGraphPort, validateGraph };

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@statelyai/graph",
   "type": "module",
-  "version": "0.12.0",
+  "version": "0.13.0",
   "description": "A TypeScript-first graph library with plain JSON-serializable objects",
   "author": "David Khourshid <david@stately.ai>",
   "license": "MIT",

package/schemas/graph.schema.json

@@ -150,6 +150,7 @@
               },
               "required": [
                 "name",
+                "direction",
                 "data"
               ],
               "additionalProperties": false

package/schemas/node.schema.json

@@ -125,6 +125,7 @@
         },
         "required": [
           "name",
+          "direction",
           "data"
         ],
         "additionalProperties": false