@statelyai/graph 0.3.1 → 0.5.0

package/dist/formats/xyflow/index.mjs

@@ -0,0 +1,133 @@
+//#region src/formats/xyflow/index.ts
+/**
+* Converts a visual graph to xyflow (React Flow / Svelte Flow) format.
+*
+* @example
+* ```ts
+* import { createVisualGraph } from '@statelyai/graph';
+* import { toXYFlow } from '@statelyai/graph/formats/xyflow';
+*
+* const graph = createVisualGraph({
+*   nodes: [
+*     { id: 'a', x: 0, y: 0, width: 100, height: 50 },
+*     { id: 'b', x: 200, y: 100, width: 100, height: 50 },
+*   ],
+*   edges: [{ id: 'e0', sourceId: 'a', targetId: 'b' }],
+* });
+*
+* const flow = toXYFlow(graph);
+* // { nodes: [...], edges: [...] }
+* ```
+*/
+function toXYFlow(graph) {
+	return {
+		nodes: graph.nodes.map((n) => {
+			const node = {
+				id: n.id,
+				position: {
+					x: n.x,
+					y: n.y
+				},
+				data: n.data ?? {}
+			};
+			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;
+			return node;
+		}),
+		edges: graph.edges.map((e) => {
+			const edge = {
+				id: e.id,
+				source: e.sourceId,
+				target: e.targetId
+			};
+			if (e.data !== void 0) edge.data = e.data;
+			if (e.label) edge.data = {
+				...edge.data,
+				label: e.label
+			};
+			return edge;
+		})
+	};
+}
+/**
+* Parses an xyflow (React Flow / Svelte Flow) object into a visual graph.
+*
+* @example
+* ```ts
+* import { fromXYFlow } from '@statelyai/graph/formats/xyflow';
+*
+* const graph = fromXYFlow({
+*   nodes: [
+*     { id: 'a', position: { x: 0, y: 0 }, data: {} },
+*     { id: 'b', position: { x: 200, y: 100 }, data: {} },
+*   ],
+*   edges: [{ id: 'e0', source: 'a', target: 'b' }],
+* });
+* ```
+*/
+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");
+	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() ?? "",
+			data: e.data,
+			x: 0,
+			y: 0,
+			width: 0,
+			height: 0
+		}))
+	};
+}
+/**
+* Bidirectional converter for xyflow (React Flow / Svelte Flow) format.
+*
+* @example
+* ```ts
+* import { createVisualGraph } from '@statelyai/graph';
+* import { xyflowConverter } from '@statelyai/graph/formats/xyflow';
+*
+* const graph = createVisualGraph({
+*   nodes: [
+*     { id: 'a', x: 0, y: 0, width: 100, height: 50 },
+*     { id: 'b', x: 200, y: 100, width: 100, height: 50 },
+*   ],
+*   edges: [{ id: 'e0', sourceId: 'a', targetId: 'b' }],
+* });
+*
+* const flow = xyflowConverter.to(graph);
+* const roundTripped = xyflowConverter.from(flow);
+* ```
+*/
+const xyflowConverter = {
+	to: toXYFlow,
+	from: fromXYFlow
+};
+
+//#endregion
+export { fromXYFlow, toXYFlow, xyflowConverter };

package/dist/index.d.mts

@@ -1,4 +1,4 @@
-import { C as TraversalOptions, D as VisualNode, E as VisualGraphConfig, 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-BDXC1O5b.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,13 +1,13 @@
-import { o as invalidateIndex, t as getIndex } from "./indexing-eNDrXdDA.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-NWSB2RWj.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-CchokMDg.mjs";
+import { n as createFormatConverter } from "./converter-B5CUD0r9.mjs";
 
 //#region src/diff.ts
 function nodeToConfig(node) {
 	const config = { id: node.id };
-	if (node.parentId !== null) config.parentId = node.parentId;
-	if (node.initialNodeId !== null) config.initialNodeId = node.initialNodeId;
+	if (node.parentId) config.parentId = node.parentId;
+	if (node.initialNodeId) config.initialNodeId = node.initialNodeId;
 	if (node.label !== "") config.label = node.label;
 	if (node.data !== void 0) config.data = node.data;
 	if (node.x !== void 0) config.x = node.x;

package/dist/{indexing-eNDrXdDA.mjs → indexing-DyfgLuzw.mjs}

@@ -53,7 +53,7 @@ function buildIndex(graph) {
 		nodeById.set(n.id, i);
 		outEdges.set(n.id, []);
 		inEdges.set(n.id, []);
-		const parent = n.parentId;
+		const parent = n.parentId ?? null;
 		if (!childNodes.has(parent)) childNodes.set(parent, []);
 		childNodes.get(parent).push(n.id);
 	}
@@ -77,7 +77,7 @@ function indexAddNode(idx, node, arrayIndex) {
 	idx.nodeById.set(node.id, arrayIndex);
 	idx.outEdges.set(node.id, []);
 	idx.inEdges.set(node.id, []);
-	const parent = node.parentId;
+	const parent = node.parentId ?? null;
 	if (!idx.childNodes.has(parent)) idx.childNodes.set(parent, []);
 	idx.childNodes.get(parent).push(node.id);
 	idx.nodeCount++;
@@ -90,13 +90,14 @@ function indexAddEdge(idx, edge, arrayIndex) {
 }
 /** Update childNodes index when a node's parentId changes. */
 function indexReparentNode(idx, nodeId, oldParentId, newParentId) {
-	const oldSiblings = idx.childNodes.get(oldParentId);
+	const oldSiblings = idx.childNodes.get(oldParentId ?? null);
 	if (oldSiblings) {
 		const pos = oldSiblings.indexOf(nodeId);
 		if (pos !== -1) oldSiblings.splice(pos, 1);
 	}
-	if (!idx.childNodes.has(newParentId)) idx.childNodes.set(newParentId, []);
-	idx.childNodes.get(newParentId).push(nodeId);
+	const np = newParentId ?? null;
+	if (!idx.childNodes.has(np)) idx.childNodes.set(np, []);
+	idx.childNodes.get(np).push(nodeId);
 }
 /** Update adjacency lists when an edge's sourceId/targetId changes. */
 function indexUpdateEdgeEndpoints(idx, edgeId, oldSourceId, oldTargetId, newSourceId, newTargetId) {

package/dist/queries.d.mts

@@ -1,4 +1,4 @@
-import { c as Graph, d as GraphEdge, p as GraphNode } from "./types-BDXC1O5b.mjs";
+import { c as Graph, d as GraphEdge, p as GraphNode } from "./types-FBZCrmnG.mjs";
 
 //#region src/queries.d.ts
 
@@ -238,7 +238,7 @@ declare function getAncestors<N>(graph: Graph<N>, nodeId: string): GraphNode<N>[
  */
 declare function getDescendants<N>(graph: Graph<N>, nodeId: string): GraphNode<N>[];
 /**
- * Returns all root nodes (nodes with no parent, i.e. `parentId === null`).
+ * Returns all root nodes (nodes with no parent).
  *
  * @example
  * ```ts

package/dist/queries.mjs

@@ -1,4 +1,4 @@
-import { t as getIndex } from "./indexing-eNDrXdDA.mjs";
+import { t as getIndex } from "./indexing-DyfgLuzw.mjs";
 
 //#region src/queries.ts
 /**
@@ -293,7 +293,7 @@ function getParent(graph, nodeId) {
 	const ni = idx.nodeById.get(nodeId);
 	if (ni === void 0) return void 0;
 	const node = graph.nodes[ni];
-	if (node.parentId === null) return void 0;
+	if (!node.parentId) return void 0;
 	const pi = idx.nodeById.get(node.parentId);
 	return pi !== void 0 ? graph.nodes[pi] : void 0;
 }
@@ -319,7 +319,7 @@ function getAncestors(graph, nodeId) {
 	let ni = idx.nodeById.get(nodeId);
 	if (ni === void 0) return result;
 	let current = graph.nodes[ni];
-	while (current && current.parentId !== null) {
+	while (current && current.parentId) {
 		const pi = idx.nodeById.get(current.parentId);
 		if (pi === void 0) break;
 		const p = graph.nodes[pi];
@@ -361,7 +361,7 @@ function getDescendants(graph, nodeId) {
 	return result;
 }
 /**
-* Returns all root nodes (nodes with no parent, i.e. `parentId === null`).
+* Returns all root nodes (nodes with no parent).
 *
 * @example
 * ```ts
@@ -440,7 +440,7 @@ function getDepth(graph, nodeId) {
 	let ni = idx.nodeById.get(nodeId);
 	if (ni === void 0) return -1;
 	let current = graph.nodes[ni];
-	while (current.parentId !== null) {
+	while (current.parentId) {
 		d++;
 		const pi = idx.nodeById.get(current.parentId);
 		if (pi === void 0) break;
@@ -470,7 +470,7 @@ function getSiblings(graph, nodeId) {
 	const ni = idx.nodeById.get(nodeId);
 	if (ni === void 0) return [];
 	const node = graph.nodes[ni];
-	return (idx.childNodes.get(node.parentId) ?? []).filter((id) => id !== nodeId).map((id) => graph.nodes[idx.nodeById.get(id)]).filter(Boolean);
+	return (idx.childNodes.get(node.parentId ?? null) ?? []).filter((id) => id !== nodeId).map((id) => graph.nodes[idx.nodeById.get(id)]).filter(Boolean);
 }
 /**
 * Least Common Ancestor -- deepest proper ancestor of all given nodes.
@@ -500,7 +500,7 @@ function getLCA(graph, ...nodeIds) {
 		let ni$1 = idx.nodeById.get(id);
 		if (ni$1 === void 0) return result;
 		let current = graph.nodes[ni$1];
-		while (current.parentId !== null) {
+		while (current.parentId) {
 			result.push(current.parentId);
 			const pi = idx.nodeById.get(current.parentId);
 			if (pi === void 0) break;
@@ -564,7 +564,7 @@ function getRelativeDistanceMap(graph, parentId) {
 	let sourceId = null;
 	if (parentId !== null) {
 		const pi = idx.nodeById.get(parentId);
-		if (pi !== void 0) sourceId = graph.nodes[pi].initialNodeId;
+		if (pi !== void 0) sourceId = graph.nodes[pi].initialNodeId ?? null;
 	} else sourceId = graph.initialNodeId;
 	if (!sourceId) return {};
 	const siblingSet = new Set(idx.childNodes.get(parentId) ?? []);
@@ -637,7 +637,7 @@ function getRelativeDistance(graph, nodeId) {
 	const ni = getIndex(graph).nodeById.get(nodeId);
 	if (ni === void 0) return void 0;
 	const node = graph.nodes[ni];
-	return getRelativeDistanceMap(graph, node.parentId)[nodeId];
+	return getRelativeDistanceMap(graph, node.parentId ?? null)[nodeId];
 }
 /**
 * Nodes with no incoming edges (inDegree 0).

package/dist/schemas.d.mts

@@ -4,10 +4,17 @@ import * as z from "zod";
 declare const NodeSchema: z.ZodObject<{
   type: z.ZodLiteral<"node">;
   id: z.ZodString;
-  parentId: z.ZodNullable<z.ZodString>;
-  initialNodeId: z.ZodNullable<z.ZodString>;
+  parentId: z.ZodOptional<z.ZodNullable<z.ZodString>>;
+  initialNodeId: z.ZodOptional<z.ZodNullable<z.ZodString>>;
   label: z.ZodString;
   data: z.ZodAny;
+  x: z.ZodOptional<z.ZodNumber>;
+  y: z.ZodOptional<z.ZodNumber>;
+  width: z.ZodOptional<z.ZodNumber>;
+  height: z.ZodOptional<z.ZodNumber>;
+  shape: z.ZodOptional<z.ZodString>;
+  color: z.ZodOptional<z.ZodString>;
+  style: z.ZodOptional<z.ZodRecord<z.ZodString, z.ZodUnion<readonly [z.ZodString, z.ZodNumber]>>>;
 }, z.core.$strip>;
 declare const EdgeSchema: z.ZodObject<{
   type: z.ZodLiteral<"edge">;
@@ -16,6 +23,12 @@ declare const EdgeSchema: z.ZodObject<{
   targetId: z.ZodString;
   label: z.ZodString;
   data: z.ZodAny;
+  x: z.ZodOptional<z.ZodNumber>;
+  y: z.ZodOptional<z.ZodNumber>;
+  width: z.ZodOptional<z.ZodNumber>;
+  height: z.ZodOptional<z.ZodNumber>;
+  color: z.ZodOptional<z.ZodString>;
+  style: z.ZodOptional<z.ZodRecord<z.ZodString, z.ZodUnion<readonly [z.ZodString, z.ZodNumber]>>>;
 }, z.core.$strip>;
 declare const GraphSchema: z.ZodObject<{
   id: z.ZodString;
@@ -27,10 +40,17 @@ declare const GraphSchema: z.ZodObject<{
   nodes: z.ZodArray<z.ZodObject<{
     type: z.ZodLiteral<"node">;
     id: z.ZodString;
-    parentId: z.ZodNullable<z.ZodString>;
-    initialNodeId: z.ZodNullable<z.ZodString>;
+    parentId: z.ZodOptional<z.ZodNullable<z.ZodString>>;
+    initialNodeId: z.ZodOptional<z.ZodNullable<z.ZodString>>;
     label: z.ZodString;
     data: z.ZodAny;
+    x: z.ZodOptional<z.ZodNumber>;
+    y: z.ZodOptional<z.ZodNumber>;
+    width: z.ZodOptional<z.ZodNumber>;
+    height: z.ZodOptional<z.ZodNumber>;
+    shape: z.ZodOptional<z.ZodString>;
+    color: z.ZodOptional<z.ZodString>;
+    style: z.ZodOptional<z.ZodRecord<z.ZodString, z.ZodUnion<readonly [z.ZodString, z.ZodNumber]>>>;
   }, z.core.$strip>>;
   edges: z.ZodArray<z.ZodObject<{
     type: z.ZodLiteral<"edge">;
@@ -39,8 +59,21 @@ declare const GraphSchema: z.ZodObject<{
     targetId: z.ZodString;
     label: z.ZodString;
     data: z.ZodAny;
+    x: z.ZodOptional<z.ZodNumber>;
+    y: z.ZodOptional<z.ZodNumber>;
+    width: z.ZodOptional<z.ZodNumber>;
+    height: z.ZodOptional<z.ZodNumber>;
+    color: z.ZodOptional<z.ZodString>;
+    style: z.ZodOptional<z.ZodRecord<z.ZodString, z.ZodUnion<readonly [z.ZodString, z.ZodNumber]>>>;
   }, z.core.$strip>>;
   data: z.ZodAny;
+  direction: z.ZodOptional<z.ZodEnum<{
+    up: "up";
+    down: "down";
+    left: "left";
+    right: "right";
+  }>>;
+  style: z.ZodOptional<z.ZodRecord<z.ZodString, z.ZodUnion<readonly [z.ZodString, z.ZodNumber]>>>;
 }, z.core.$strip>;
 //#endregion
 export { EdgeSchema, GraphSchema, NodeSchema };

package/dist/schemas.mjs

@@ -1,13 +1,21 @@
 import * as z from "zod";
 
 //#region src/schemas.ts
+const StyleSchema = z.record(z.string(), z.union([z.string(), z.number()]));
 const NodeSchema = z.object({
 	type: z.literal("node"),
 	id: z.string(),
-	parentId: z.string().nullable(),
-	initialNodeId: z.string().nullable(),
+	parentId: z.string().nullable().optional(),
+	initialNodeId: z.string().nullable().optional(),
 	label: z.string(),
-	data: z.any()
+	data: z.any(),
+	x: z.number().optional(),
+	y: z.number().optional(),
+	width: z.number().optional(),
+	height: z.number().optional(),
+	shape: z.string().optional(),
+	color: z.string().optional(),
+	style: StyleSchema.optional()
 });
 const EdgeSchema = z.object({
 	type: z.literal("edge"),
@@ -15,7 +23,13 @@ const EdgeSchema = z.object({
 	sourceId: z.string(),
 	targetId: z.string(),
 	label: z.string(),
-	data: z.any()
+	data: z.any(),
+	x: z.number().optional(),
+	y: z.number().optional(),
+	width: z.number().optional(),
+	height: z.number().optional(),
+	color: z.string().optional(),
+	style: StyleSchema.optional()
 });
 const GraphSchema = z.object({
 	id: z.string(),
@@ -23,7 +37,14 @@ const GraphSchema = z.object({
 	initialNodeId: z.string().nullable(),
 	nodes: z.array(NodeSchema),
 	edges: z.array(EdgeSchema),
-	data: z.any()
+	data: z.any(),
+	direction: z.enum([
+		"up",
+		"down",
+		"left",
+		"right"
+	]).optional(),
+	style: StyleSchema.optional()
 });
 
 //#endregion

package/dist/{types-BDXC1O5b.d.mts → types-FBZCrmnG.d.mts}

@@ -67,8 +67,8 @@ interface Graph<TNodeData = any, TEdgeData = any, TGraphData = any> {
 interface GraphNode<TNodeData = any> {
   type: 'node';
   id: string;
-  parentId: string | null;
-  initialNodeId: string | null;
+  parentId?: string | null;
+  initialNodeId?: string | null;
   label: string;
   data: TNodeData;
   x?: number;
@@ -228,11 +228,22 @@ type GraphPatch<TNodeData = any, TEdgeData = any> = {
  * };
  * ```
  */
-interface GraphFormatConverter<TSerial> {
+interface GraphFormatConverter<TSerial, N = any, E = any, G = any> {
   /** Convert a Graph to the serialized format. */
-  to(graph: Graph): TSerial;
+  to(graph: Graph<N, E, G>): TSerial;
   /** Convert from the serialized format to a Graph. */
-  from(input: TSerial): Graph;
+  from(input: TSerial): Graph<N, E, G>;
+}
+/**
+ * A bidirectional converter between `VisualGraph` and a serialized format.
+ *
+ * Use this for formats that carry position/size data (e.g. xyflow, cytoscape).
+ */
+interface VisualGraphFormatConverter<TSerial, N = any, E = any, G = any> {
+  /** Convert a VisualGraph to the serialized format. */
+  to(graph: VisualGraph<N, E, G>): TSerial;
+  /** Convert from the serialized format to a VisualGraph. */
+  from(input: TSerial): VisualGraph<N, E, G>;
 }
 interface TransitionOptions<TState, TEvent> {
   /** Initial state to begin BFS exploration from. */
@@ -251,4 +262,4 @@ interface TransitionOptions<TState, TEvent> {
   id?: string;
 }
 //#endregion
-export { TraversalOptions as C, VisualNode as D, VisualGraphConfig as E, TransitionOptions as S, VisualGraph as T, MSTOptions as _, EntitiesConfig as a, PathOptions as b, Graph as c, GraphEdge as d, GraphFormatConverter as f, GraphStep as g, GraphPath as h, EdgeConfig as i, GraphConfig as l, GraphPatch as m, DeleteNodeOptions as n, EntitiesUpdate as o, GraphNode as p, EdgeChange as r, EntityRect as s, AllPairsShortestPathsOptions as t, GraphDiff as u, NodeChange as v, VisualEdge as w, SinglePathOptions as x, NodeConfig as y };
+export { TraversalOptions as C, VisualGraphFormatConverter as D, VisualGraphConfig as E, VisualNode as O, TransitionOptions as S, VisualGraph as T, MSTOptions as _, EntitiesConfig as a, PathOptions as b, Graph as c, GraphEdge as d, GraphFormatConverter as f, GraphStep as g, GraphPath as h, EdgeConfig as i, GraphConfig as l, GraphPatch as m, DeleteNodeOptions as n, EntitiesUpdate as o, GraphNode as p, EdgeChange as r, EntityRect as s, AllPairsShortestPathsOptions as t, GraphDiff as u, NodeChange as v, VisualEdge as w, SinglePathOptions as x, NodeConfig as y };

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@statelyai/graph",
   "type": "module",
-  "version": "0.3.1",
+  "version": "0.5.0",
   "description": "A TypeScript-first graph library with plain JSON-serializable objects",
   "author": "David Khourshid <david@stately.ai>",
   "license": "MIT",
@@ -30,12 +30,14 @@
     "./d3": "./dist/formats/d3/index.mjs",
     "./dot": "./dist/formats/dot/index.mjs",
     "./edge-list": "./dist/formats/edge-list/index.mjs",
+    "./elk": "./dist/formats/elk/index.mjs",
     "./gexf": "./dist/formats/gexf/index.mjs",
     "./gml": "./dist/formats/gml/index.mjs",
     "./graphml": "./dist/formats/graphml/index.mjs",
     "./jgf": "./dist/formats/jgf/index.mjs",
     "./mermaid": "./dist/formats/mermaid/index.mjs",
     "./tgf": "./dist/formats/tgf/index.mjs",
+    "./xyflow": "./dist/formats/xyflow/index.mjs",
     "./queries": "./dist/queries.mjs",
     "./schemas": "./dist/schemas.mjs",
     "./package.json": "./package.json"
@@ -53,11 +55,13 @@
     "@types/d3-array": "^3.2.2",
     "@types/d3-force": "^3.0.10",
     "@types/node": "^25.0.3",
+    "@xyflow/system": "^0.0.75",
     "bumpp": "^10.3.2",
     "cytoscape": "^3.33.1",
     "d3-array": "^3.2.4",
     "d3-force": "^3.0.0",
     "dotparser": "^1.1.1",
+    "elkjs": "^0.11.1",
     "fast-xml-parser": "^5.3.4",
     "tsdown": "^0.18.1",
     "tsx": "^4.21.0",
@@ -70,6 +74,7 @@
     "cytoscape": "^3.0.0",
     "d3-force": "^3.0.0",
     "dotparser": "^1.0.0",
+    "elkjs": "^0.9.0 || ^0.10.0 || ^0.11.0",
     "fast-xml-parser": "^5.0.0",
     "zod": "^4.0.0"
   },
@@ -83,6 +88,9 @@
     "dotparser": {
       "optional": true
     },
+    "elkjs": {
+      "optional": true
+    },
     "fast-xml-parser": {
       "optional": true
     },

package/schemas/edge.schema.json

@@ -18,7 +18,38 @@
     "label": {
       "type": "string"
     },
-    "data": {}
+    "data": {},
+    "x": {
+      "type": "number"
+    },
+    "y": {
+      "type": "number"
+    },
+    "width": {
+      "type": "number"
+    },
+    "height": {
+      "type": "number"
+    },
+    "color": {
+      "type": "string"
+    },
+    "style": {
+      "type": "object",
+      "propertyNames": {
+        "type": "string"
+      },
+      "additionalProperties": {
+        "anyOf": [
+          {
+            "type": "string"
+          },
+          {
+            "type": "number"
+          }
+        ]
+      }
+    }
   },
   "required": [
     "type",