@statelyai/graph 0.3.1 → 0.5.0

package/README.md

@@ -4,17 +4,6 @@ A TypeScript graph library built on plain JSON objects. Supports directed/undire
 
 Made from our experience at [stately.ai](https://stately.ai), where we build visual tools for complex systems.
 
-## Why this library?
-
-Graph file formats (GEXF, GraphML) define how to _store_ graphs. Visualization libraries (Cytoscape.js, D3) define how to _render_ them. Neither gives you a good way to _work with_ them in between.
-
-This library is the computational layer: plain JSON objects in, algorithms and mutations, plain JSON objects out. No classes, no DOM, no rendering engine — just data and functions.
-
-```
-GEXF file → fromGEXF() → Graph → run algorithms, mutate → toCytoscapeJSON() → render
-```
-
-Your `Graph` is a plain object that survives `JSON.stringify`, `structuredClone`, `postMessage`, and `localStorage` without adapters. Format converters are the I/O ports — read from any supported format, do your work, export to whatever your renderer or database expects.
 
 ## Install
 
@@ -126,6 +115,18 @@ const back = cytoscapeConverter.from(cyto);
 const myConverter = createFormatConverter(myToFn, myFromFn);
 ```
 
+## Why this library?
+
+Graph file formats (GEXF, GraphML) define how to _store_ graphs. Visualization libraries (Cytoscape.js, D3) define how to _render_ them. Neither gives you a good way to _work with_ them in between.
+
+This library is the computational layer: plain JSON objects in, algorithms and mutations, plain JSON objects out. No classes, no DOM, no rendering engine; just data and functions.
+
+```
+GEXF file → fromGEXF() → Graph → run algorithms, mutate → toCytoscapeJSON() → render
+```
+
+Your `Graph` is a plain object that survives `JSON.stringify`, `structuredClone`, `postMessage`, and `localStorage` without adapters. Format converters are the I/O ports: read from any supported format, do your work, export to whatever your renderer or database expects.
+
 ## API
 
 ### Graph Creation

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

@@ -1,12 +1,14 @@
-import { a as indexUpdateEdgeEndpoints, i as indexReparentNode, n as indexAddEdge, o as invalidateIndex, r as indexAddNode, t as getIndex } from "./indexing-eNDrXdDA.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) {
+	if (!config.id) throw new Error("Node id must be a non-empty string");
+	if (config.parentId === "") throw new Error("Node parentId must be a non-empty string");
 	const node = {
 		type: "node",
 		id: config.id,
-		parentId: config.parentId ?? null,
-		initialNodeId: config.initialNodeId ?? null,
+		...config.parentId !== void 0 && { parentId: config.parentId ?? null },
+		...config.initialNodeId !== void 0 && { initialNodeId: config.initialNodeId ?? null },
 		label: config.label ?? "",
 		data: config.data
 	};
@@ -20,6 +22,9 @@ function resolveNode(config) {
 	return node;
 }
 function resolveEdge(config) {
+	if (!config.id) throw new Error("Edge id must be a non-empty string");
+	if (!config.sourceId) throw new Error("Edge sourceId must be a non-empty string");
+	if (!config.targetId) throw new Error("Edge targetId must be a non-empty string");
 	const edge = {
 		type: "edge",
 		id: config.id,
@@ -251,10 +256,10 @@ function hasEdge(graph, id) {
 * ```
 */
 function addNode(graph, config) {
+	const node = resolveNode(config);
 	const idx = getIndex(graph);
 	if (idx.nodeById.has(config.id)) throw new Error(`Node "${config.id}" already exists`);
-	if (config.parentId != null && !idx.nodeById.has(config.parentId)) throw new Error(`Parent node "${config.parentId}" does not exist`);
-	const node = resolveNode(config);
+	if (config.parentId && !idx.nodeById.has(config.parentId)) throw new Error(`Parent node "${config.parentId}" does not exist`);
 	indexAddNode(idx, node, graph.nodes.push(node) - 1);
 	return node;
 }
@@ -270,11 +275,11 @@ function addNode(graph, config) {
 * ```
 */
 function addEdge(graph, config) {
+	const edge = resolveEdge(config);
 	const idx = getIndex(graph);
 	if (idx.edgeById.has(config.id)) throw new Error(`Edge "${config.id}" already exists`);
 	if (!idx.nodeById.has(config.sourceId)) throw new Error(`Source node "${config.sourceId}" does not exist`);
 	if (!idx.nodeById.has(config.targetId)) throw new Error(`Target node "${config.targetId}" does not exist`);
-	const edge = resolveEdge(config);
 	indexAddEdge(idx, edge, graph.edges.push(edge) - 1);
 	return edge;
 }

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-BDXC1O5b.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-NWSB2RWj.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-CchokMDg.mjs → converter-B5CUD0r9.mjs}

@@ -1,5 +1,5 @@
-import { n as toAdjacencyList, t as fromAdjacencyList } from "./adjacency-list-ITO40kmn.mjs";
-import { n as toEdgeList, t as fromEdgeList } from "./edge-list-CgX6bBIF.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-BDXC1O5b.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-ITO40kmn.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-BDXC1O5b.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-BDXC1O5b.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-CchokMDg.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-BDXC1O5b.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-CchokMDg.mjs";
+import { n as createFormatConverter } from "../../converter-B5CUD0r9.mjs";
 
 //#region src/formats/cytoscape/index.ts
 /**
@@ -22,7 +22,7 @@ function toCytoscapeJSON(graph) {
 	const graphData = {};
 	if (graph.id) graphData.id = graph.id;
 	graphData.type = graph.type;
-	if (graph.initialNodeId !== null) graphData.initialNodeId = graph.initialNodeId;
+	if (graph.initialNodeId) graphData.initialNodeId = graph.initialNodeId;
 	if (graph.data !== void 0) graphData.graphData = graph.data;
 	if (graph.direction) graphData.direction = graph.direction;
 	return {
@@ -30,9 +30,9 @@ function toCytoscapeJSON(graph) {
 		elements: {
 			nodes: graph.nodes.map((n) => {
 				const data = { id: n.id };
-				if (n.parentId !== null) data.parent = n.parentId;
+				if (n.parentId) data.parent = n.parentId;
 				if (n.label) data.label = n.label;
-				if (n.initialNodeId !== null) data.initialNodeId = n.initialNodeId;
+				if (n.initialNodeId) data.initialNodeId = n.initialNodeId;
 				if (n.data !== void 0) data.nodeData = n.data;
 				if (n.width !== void 0) data.width = n.width;
 				if (n.height !== void 0) data.height = n.height;

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

@@ -1,4 +1,4 @@
-import { c as Graph, f as GraphFormatConverter } from "../../types-BDXC1O5b.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-CchokMDg.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-BDXC1O5b.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-CchokMDg.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-BDXC1O5b.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-CgX6bBIF.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-BDXC1O5b.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-CchokMDg.mjs";
+import { n as createFormatConverter } from "../../converter-B5CUD0r9.mjs";
 import { XMLBuilder, XMLParser } from "fast-xml-parser";
 
 //#region src/formats/gexf/index.ts
@@ -32,11 +32,11 @@ function toGEXF(graph) {
 	}];
 	const nodes = graph.nodes.map((n) => {
 		const attvalues = [];
-		if (n.parentId !== null) attvalues.push({
+		if (n.parentId) attvalues.push({
 			"@_for": "a_parentId",
 			"@_value": n.parentId
 		});
-		if (n.initialNodeId !== null) attvalues.push({
+		if (n.initialNodeId) attvalues.push({
 			"@_for": "a_initialNodeId",
 			"@_value": n.initialNodeId
 		});
@@ -52,7 +52,7 @@ function toGEXF(graph) {
 			"@_id": n.id,
 			"@_label": n.label || n.id
 		};
-		if (n.parentId !== null) node["@_pid"] = n.parentId;
+		if (n.parentId) node["@_pid"] = n.parentId;
 		if (attvalues.length > 0) node.attvalues = { attvalue: attvalues };
 		if (n.color) {
 			const hex$1 = n.color.replace("#", "");
@@ -91,7 +91,7 @@ function toGEXF(graph) {
 		return edge;
 	});
 	const graphData = [];
-	if (graph.initialNodeId !== null) graphData.push({
+	if (graph.initialNodeId) graphData.push({
 		"@_for": "a_initialNodeId",
 		"@_value": graph.initialNodeId
 	});

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

@@ -1,4 +1,4 @@
-import { c as Graph, f as GraphFormatConverter } from "../../types-BDXC1O5b.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-CchokMDg.mjs";
+import { n as createFormatConverter } from "../../converter-B5CUD0r9.mjs";
 
 //#region src/formats/gml/index.ts
 /**
@@ -30,7 +30,7 @@ function toGML(graph) {
 	if (graph.id) lines.push(`  id ${gmlString(graph.id)}`);
 	const childrenMap = /* @__PURE__ */ new Map();
 	for (const node of graph.nodes) {
-		const pid = node.parentId;
+		const pid = node.parentId ?? null;
 		if (!childrenMap.has(pid)) childrenMap.set(pid, []);
 		childrenMap.get(pid).push(node);
 	}
@@ -38,7 +38,7 @@ function toGML(graph) {
 		lines.push(`${indent}node [`);
 		lines.push(`${indent}  id ${gmlString(node.id)}`);
 		if (node.label) lines.push(`${indent}  label ${gmlString(node.label)}`);
-		if (node.initialNodeId !== null) lines.push(`${indent}  initialNodeId ${gmlString(node.initialNodeId)}`);
+		if (node.initialNodeId) lines.push(`${indent}  initialNodeId ${gmlString(node.initialNodeId)}`);
 		if (node.data !== void 0) lines.push(`${indent}  data ${gmlString(JSON.stringify(node.data))}`);
 		if (node.shape) lines.push(`${indent}  shape ${gmlString(node.shape)}`);
 		if (node.color) lines.push(`${indent}  color ${gmlString(node.color)}`);

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

@@ -1,4 +1,4 @@
-import { c as Graph, f as GraphFormatConverter } from "../../types-BDXC1O5b.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-CchokMDg.mjs";
+import { n as createFormatConverter } from "../../converter-B5CUD0r9.mjs";
 import { XMLBuilder, XMLParser } from "fast-xml-parser";
 
 //#region src/formats/graphml/index.ts
@@ -72,7 +72,7 @@ function toGraphML(graph) {
 			"@_key": "label",
 			"#text": n.label
 		});
-		if (n.parentId !== null) data.push({
+		if (n.parentId) data.push({
 			"@_key": "parentId",
 			"#text": n.parentId
 		});

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

@@ -1,4 +1,4 @@
-import { c as Graph, f as GraphFormatConverter } from "../../types-BDXC1O5b.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-CchokMDg.mjs";
+import { n as createFormatConverter } from "../../converter-B5CUD0r9.mjs";
 
 //#region src/formats/jgf/index.ts
 /**
@@ -20,7 +20,7 @@ import { n as createFormatConverter } from "../../converter-CchokMDg.mjs";
 */
 function toJGF(graph) {
 	const metadata = {};
-	if (graph.initialNodeId !== null) metadata.initialNodeId = graph.initialNodeId;
+	if (graph.initialNodeId) metadata.initialNodeId = graph.initialNodeId;
 	if (graph.data !== void 0) metadata.data = graph.data;
 	if (graph.direction) metadata.direction = graph.direction;
 	return { graph: {
@@ -29,8 +29,8 @@ function toJGF(graph) {
 		...Object.keys(metadata).length > 0 && { metadata },
 		nodes: graph.nodes.map((n) => {
 			const meta = {};
-			if (n.parentId !== null) meta.parentId = n.parentId;
-			if (n.initialNodeId !== null) meta.initialNodeId = n.initialNodeId;
+			if (n.parentId) meta.parentId = n.parentId;
+			if (n.initialNodeId) meta.initialNodeId = n.initialNodeId;
 			if (n.data !== void 0) meta.data = n.data;
 			if (n.x !== void 0) meta.x = n.x;
 			if (n.y !== void 0) meta.y = n.y;