@statelyai/graph 0.4.0 → 0.5.0

package/dist/{algorithms-CnTmuX9t.mjs → algorithms-DldwenLt.mjs}

@@ -1,4 +1,4 @@
-import { a as indexUpdateEdgeEndpoints, i as indexReparentNode, n as indexAddEdge, o as invalidateIndex, r as indexAddNode, t as getIndex } from "./indexing-DitHphT7.mjs";
+import { a as indexUpdateEdgeEndpoints, i as indexReparentNode, n as indexAddEdge, o as invalidateIndex, r as indexAddNode, t as getIndex } from "./indexing-DyfgLuzw.mjs";
 
 //#region src/graph.ts
 function resolveNode(config) {

package/dist/algorithms.d.mts

@@ -1,4 +1,4 @@
-import { C as TraversalOptions, _ as MSTOptions, b as PathOptions, c as Graph, h as GraphPath, p as GraphNode, t as AllPairsShortestPathsOptions, x as SinglePathOptions } from "./types-Bq_fmLwW.mjs";
+import { C as TraversalOptions, _ as MSTOptions, b as PathOptions, c as Graph, h as GraphPath, p as GraphNode, t as AllPairsShortestPathsOptions, x as SinglePathOptions } from "./types-FBZCrmnG.mjs";
 
 //#region src/algorithms.d.ts
 

package/dist/algorithms.mjs

@@ -1,3 +1,3 @@
-import { C as isAcyclic, E as joinPaths, S as hasPath, T as isTree, _ 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, 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 } from "./algorithms-CnTmuX9t.mjs";
+import { C as isAcyclic, E as joinPaths, S as hasPath, T as isTree, _ 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, 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 } from "./algorithms-DldwenLt.mjs";
 
 export { 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 };

package/dist/{converter-C5DlzzHs.mjs → converter-B5CUD0r9.mjs}

@@ -1,5 +1,5 @@
-import { n as toAdjacencyList, t as fromAdjacencyList } from "./adjacency-list-Bv4tfiM3.mjs";
-import { n as toEdgeList, t as fromEdgeList } from "./edge-list-R1SUbHwe.mjs";
+import { n as toAdjacencyList, t as fromAdjacencyList } from "./adjacency-list-fldj-QAL.mjs";
+import { n as toEdgeList, t as fromEdgeList } from "./edge-list-Br05wXMg.mjs";
 
 //#region src/formats/converter/index.ts
 /**

package/dist/formats/adjacency-list/index.d.mts

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

package/dist/formats/adjacency-list/index.mjs

@@ -1,3 +1,3 @@
-import { n as toAdjacencyList, t as fromAdjacencyList } from "../../adjacency-list-Bv4tfiM3.mjs";
+import { n as toAdjacencyList, t as fromAdjacencyList } from "../../adjacency-list-fldj-QAL.mjs";
 
 export { fromAdjacencyList, toAdjacencyList };

package/dist/formats/converter/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/converter/index.d.ts
 
@@ -18,7 +18,7 @@ import { c as Graph, f as GraphFormatConverter } from "../../types-Bq_fmLwW.mjs"
  * const graph = yamlConverter.from(yaml);
  * ```
  */
-declare function createFormatConverter<TSerial>(to: (graph: Graph) => TSerial, from: (input: TSerial) => Graph): GraphFormatConverter<TSerial>;
+declare function createFormatConverter<TSerial, N = any, E = any, G = any>(to: (graph: Graph<N, E, G>) => TSerial, from: (input: TSerial) => Graph<N, E, G>): GraphFormatConverter<TSerial, N, E, G>;
 /**
  * Bidirectional converter for adjacency-list format (`Record<string, string[]>`).
  *

package/dist/formats/converter/index.mjs

@@ -1,3 +1,3 @@
-import { n as createFormatConverter, r as edgeListConverter, t as adjacencyListConverter } from "../../converter-C5DlzzHs.mjs";
+import { n as createFormatConverter, r as edgeListConverter, t as adjacencyListConverter } from "../../converter-B5CUD0r9.mjs";
 
 export { adjacencyListConverter, createFormatConverter, edgeListConverter };

package/dist/formats/cytoscape/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/cytoscape/index.d.ts
 interface CytoscapeNode {

package/dist/formats/cytoscape/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/cytoscape/index.ts
 /**

package/dist/formats/d3/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/d3/index.d.ts
 interface D3Node {

package/dist/formats/d3/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/d3/index.ts
 /**

package/dist/formats/dot/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/dot/index.d.ts
 

package/dist/formats/dot/index.mjs

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

package/dist/formats/edge-list/index.d.mts

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

package/dist/formats/edge-list/index.mjs

@@ -1,3 +1,3 @@
-import { n as toEdgeList, t as fromEdgeList } from "../../edge-list-R1SUbHwe.mjs";
+import { n as toEdgeList, t as fromEdgeList } from "../../edge-list-Br05wXMg.mjs";
 
 export { fromEdgeList, toEdgeList };

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

@@ -0,0 +1,61 @@
+import { D as VisualGraphFormatConverter, T as VisualGraph } from "../../types-FBZCrmnG.mjs";
+import { ElkEdge, ElkEdgeSection, ElkExtendedEdge, ElkGraphElement, ElkLabel, ElkNode, ElkNode as ElkNode$1, ElkPoint, ElkPort, ElkPrimitiveEdge, ElkShape, LayoutOptions } from "elkjs/lib/elk-api";
+
+//#region src/formats/elk/index.d.ts
+
+/**
+ * Converts a visual graph to ELK JSON format.
+ *
+ * @example
+ * ```ts
+ * import { createVisualGraph } from '@statelyai/graph';
+ * import { toELK } from '@statelyai/graph/elk';
+ *
+ * const graph = createVisualGraph({
+ *   nodes: [
+ *     { id: 'a', x: 0, y: 0, width: 100, height: 50 },
+ *     { id: 'b', x: 200, y: 0, width: 100, height: 50 },
+ *   ],
+ *   edges: [{ id: 'e1', sourceId: 'a', targetId: 'b' }],
+ * });
+ *
+ * const elk = toELK(graph);
+ * // { id: '', children: [...], edges: [...] }
+ * ```
+ */
+declare function toELK(graph: VisualGraph): ElkNode$1;
+/**
+ * Parses an ELK JSON node into a visual graph.
+ *
+ * @example
+ * ```ts
+ * import { fromELK } from '@statelyai/graph/elk';
+ *
+ * const graph = fromELK({
+ *   id: 'root',
+ *   children: [
+ *     { id: 'a', x: 0, y: 0, width: 100, height: 50 },
+ *     { id: 'b', x: 200, y: 0, width: 100, height: 50 },
+ *   ],
+ *   edges: [{ id: 'e1', sources: ['a'], targets: ['b'] }],
+ * });
+ *
+ * graph.nodes; // [{id: 'a', x: 0, y: 0, ...}, {id: 'b', x: 200, ...}]
+ * graph.edges; // [{sourceId: 'a', targetId: 'b', ...}]
+ * ```
+ */
+declare function fromELK(elkRoot: ElkNode$1): VisualGraph;
+/**
+ * Bidirectional converter for ELK JSON format.
+ *
+ * @example
+ * ```ts
+ * import { elkConverter } from '@statelyai/graph/elk';
+ *
+ * const elk = elkConverter.to(graph);
+ * const roundTripped = elkConverter.from(elk);
+ * ```
+ */
+declare const elkConverter: VisualGraphFormatConverter<ElkNode$1>;
+//#endregion
+export { type ElkEdge, type ElkEdgeSection, type ElkExtendedEdge, type ElkGraphElement, type ElkLabel, type ElkNode, type ElkPoint, type ElkPort, type ElkPrimitiveEdge, type ElkShape, type LayoutOptions, elkConverter, fromELK, toELK };

package/dist/formats/elk/index.mjs

@@ -0,0 +1,176 @@
+import { getChildren } from "../../queries.mjs";
+
+//#region src/formats/elk/index.ts
+const DIRECTION_TO_ELK = {
+	down: "DOWN",
+	up: "UP",
+	right: "RIGHT",
+	left: "LEFT"
+};
+const ELK_TO_DIRECTION = {
+	DOWN: "down",
+	UP: "up",
+	RIGHT: "right",
+	LEFT: "left"
+};
+function convertEdge(edge) {
+	const elkEdge = {
+		id: edge.id,
+		sources: [edge.sourceId],
+		targets: [edge.targetId]
+	};
+	if (edge.label) elkEdge.labels = [{ text: edge.label }];
+	return elkEdge;
+}
+function convertNode(graph, node) {
+	const elkNode = {
+		id: node.id,
+		x: node.x,
+		y: node.y,
+		width: node.width,
+		height: node.height
+	};
+	if (node.label) elkNode.labels = [{ text: node.label }];
+	const children = getChildren(graph, node.id);
+	if (children.length > 0) {
+		elkNode.children = children.map((child) => convertNode(graph, child));
+		const descendantIds = /* @__PURE__ */ new Set();
+		collectDescendants(graph, node.id, descendantIds);
+		const innerEdges = graph.edges.filter((e) => descendantIds.has(e.sourceId) && descendantIds.has(e.targetId));
+		if (innerEdges.length > 0) elkNode.edges = innerEdges.map(convertEdge);
+	}
+	return elkNode;
+}
+function collectDescendants(graph, nodeId, set) {
+	const children = getChildren(graph, nodeId);
+	for (const child of children) {
+		set.add(child.id);
+		collectDescendants(graph, child.id, set);
+	}
+}
+/**
+* Converts a visual graph to ELK JSON format.
+*
+* @example
+* ```ts
+* import { createVisualGraph } from '@statelyai/graph';
+* import { toELK } from '@statelyai/graph/elk';
+*
+* const graph = createVisualGraph({
+*   nodes: [
+*     { id: 'a', x: 0, y: 0, width: 100, height: 50 },
+*     { id: 'b', x: 200, y: 0, width: 100, height: 50 },
+*   ],
+*   edges: [{ id: 'e1', sourceId: 'a', targetId: 'b' }],
+* });
+*
+* const elk = toELK(graph);
+* // { id: '', children: [...], edges: [...] }
+* ```
+*/
+function toELK(graph) {
+	const root = { id: graph.id };
+	const elkDir = DIRECTION_TO_ELK[graph.direction];
+	if (elkDir) root.layoutOptions = { "elk.direction": elkDir };
+	const roots = getChildren(graph, null);
+	if (roots.length > 0) root.children = roots.map((node) => convertNode(graph, node));
+	const allInnerEdgeIds = /* @__PURE__ */ new Set();
+	for (const node of graph.nodes) if (getChildren(graph, node.id).length > 0) {
+		const descendantIds = /* @__PURE__ */ new Set();
+		collectDescendants(graph, node.id, descendantIds);
+		for (const edge of graph.edges) if (descendantIds.has(edge.sourceId) && descendantIds.has(edge.targetId)) allInnerEdgeIds.add(edge.id);
+	}
+	const rootEdges = graph.edges.filter((e) => !allInnerEdgeIds.has(e.id));
+	if (rootEdges.length > 0) root.edges = rootEdges.map(convertEdge);
+	return root;
+}
+function flattenElkNodes(elkNode, parentId, nodes, edges, edgeIdx) {
+	if (elkNode.children) for (const child of elkNode.children) {
+		const label = child.labels?.[0]?.text ?? "";
+		const node = {
+			type: "node",
+			id: child.id,
+			parentId,
+			initialNodeId: null,
+			label,
+			data: void 0,
+			x: child.x ?? 0,
+			y: child.y ?? 0,
+			width: child.width ?? 0,
+			height: child.height ?? 0
+		};
+		nodes.push(node);
+		flattenElkNodes(child, child.id, nodes, edges, edgeIdx);
+	}
+	if (elkNode.edges) for (const elkEdge of elkNode.edges) for (const source of elkEdge.sources) for (const target of elkEdge.targets) {
+		const edge = {
+			type: "edge",
+			id: elkEdge.id ?? `e${edgeIdx.value++}`,
+			sourceId: source,
+			targetId: target,
+			label: elkEdge.labels?.[0]?.text ?? "",
+			data: void 0,
+			x: 0,
+			y: 0,
+			width: 0,
+			height: 0
+		};
+		edges.push(edge);
+	}
+}
+/**
+* Parses an ELK JSON node into a visual graph.
+*
+* @example
+* ```ts
+* import { fromELK } from '@statelyai/graph/elk';
+*
+* const graph = fromELK({
+*   id: 'root',
+*   children: [
+*     { id: 'a', x: 0, y: 0, width: 100, height: 50 },
+*     { id: 'b', x: 200, y: 0, width: 100, height: 50 },
+*   ],
+*   edges: [{ id: 'e1', sources: ['a'], targets: ['b'] }],
+* });
+*
+* graph.nodes; // [{id: 'a', x: 0, y: 0, ...}, {id: 'b', x: 200, ...}]
+* graph.edges; // [{sourceId: 'a', targetId: 'b', ...}]
+* ```
+*/
+function fromELK(elkRoot) {
+	const nodes = [];
+	const edges = [];
+	flattenElkNodes(elkRoot, null, nodes, edges, { value: 0 });
+	const seenEdges = /* @__PURE__ */ new Map();
+	for (const edge of edges) if (!seenEdges.has(edge.id)) seenEdges.set(edge.id, edge);
+	const elkDir = elkRoot.layoutOptions?.["elk.direction"];
+	const direction = (elkDir ? ELK_TO_DIRECTION[elkDir] : void 0) ?? "down";
+	return {
+		id: elkRoot.id,
+		type: "directed",
+		initialNodeId: null,
+		nodes,
+		edges: [...seenEdges.values()],
+		data: void 0,
+		direction
+	};
+}
+/**
+* Bidirectional converter for ELK JSON format.
+*
+* @example
+* ```ts
+* import { elkConverter } from '@statelyai/graph/elk';
+*
+* const elk = elkConverter.to(graph);
+* const roundTripped = elkConverter.from(elk);
+* ```
+*/
+const elkConverter = {
+	to: toELK,
+	from: fromELK
+};
+
+//#endregion
+export { elkConverter, fromELK, toELK };

package/dist/formats/gexf/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/gexf/index.d.ts
 declare function toGEXF(graph: Graph): string;

package/dist/formats/gexf/index.mjs

@@ -1,4 +1,4 @@
-import { n as createFormatConverter } from "../../converter-C5DlzzHs.mjs";
+import { n as createFormatConverter } from "../../converter-B5CUD0r9.mjs";
 import { XMLBuilder, XMLParser } from "fast-xml-parser";
 
 //#region src/formats/gexf/index.ts

package/dist/formats/gml/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/gml/index.d.ts
 

package/dist/formats/gml/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/gml/index.ts
 /**

package/dist/formats/graphml/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/graphml/index.d.ts
 declare function toGraphML(graph: Graph): string;

package/dist/formats/graphml/index.mjs

@@ -1,4 +1,4 @@
-import { n as createFormatConverter } from "../../converter-C5DlzzHs.mjs";
+import { n as createFormatConverter } from "../../converter-B5CUD0r9.mjs";
 import { XMLBuilder, XMLParser } from "fast-xml-parser";
 
 //#region src/formats/graphml/index.ts

package/dist/formats/jgf/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/jgf/index.d.ts
 interface JGFNode {

package/dist/formats/jgf/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/jgf/index.ts
 /**