@statelyai/graph 0.6.0 → 0.7.0

package/dist/{algorithms-oVD9PYil.mjs → algorithms-Dw5jEwDK.mjs}

@@ -1,7 +1,16 @@
 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) {
+/**
+* Create a resolved graph node from a config. Fills in defaults.
+*
+* @example
+* ```ts
+* const node = createGraphNode({ id: 'a', data: { label: 'hi' } });
+* // { type: 'node', id: 'a', label: '', data: { label: 'hi' } }
+* ```
+*/
+function createGraphNode(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 = {
@@ -21,7 +30,16 @@ function resolveNode(config) {
 	if (config.style !== void 0) node.style = config.style;
 	return node;
 }
-function resolveEdge(config) {
+/**
+* Create a resolved graph edge from a config. Fills in defaults.
+*
+* @example
+* ```ts
+* const edge = createGraphEdge({ id: 'e1', sourceId: 'a', targetId: 'b' });
+* // { type: 'edge', id: 'e1', sourceId: 'a', targetId: 'b', label: null, data: undefined }
+* ```
+*/
+function createGraphEdge(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");
@@ -58,8 +76,8 @@ function createGraph(config) {
 		id: config?.id ?? "",
 		type: config?.type ?? "directed",
 		initialNodeId: config?.initialNodeId ?? null,
-		nodes: (config?.nodes ?? []).map(resolveNode),
-		edges: (config?.edges ?? []).map(resolveEdge),
+		nodes: (config?.nodes ?? []).map(createGraphNode),
+		edges: (config?.edges ?? []).map(createGraphEdge),
 		data: config?.data ?? void 0
 	};
 	if (config?.direction !== void 0) graph.direction = config.direction;
@@ -257,7 +275,7 @@ function hasEdge(graph, id) {
 * ```
 */
 function addNode(graph, config) {
-	const node = resolveNode(config);
+	const node = createGraphNode(config);
 	const idx = getIndex(graph);
 	if (idx.nodeById.has(config.id)) throw new Error(`Node "${config.id}" already exists`);
 	if (config.parentId && !idx.nodeById.has(config.parentId)) throw new Error(`Parent node "${config.parentId}" does not exist`);
@@ -276,7 +294,7 @@ function addNode(graph, config) {
 * ```
 */
 function addEdge(graph, config) {
-	const edge = resolveEdge(config);
+	const edge = createGraphEdge(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`);
@@ -2121,4 +2139,4 @@ function joinPaths(headPath, tailPath) {
 }
 
 //#endregion
-export { addEntities as A, hasEdge as B, hasPath as C, joinPaths as D, isTree as E, deleteEdge as F, updateEdge as H, deleteEntities as I, deleteNode as L, createGraph as M, createGraphFromTransition as N, GraphInstance as O, createVisualGraph as P, getEdge as R, getTopologicalSort as S, isConnected as T, updateEntities as U, hasNode as V, updateNode as W, getShortestPath as _, genPreorders as a, getSimplePaths as b, getAStarPath as c, getCycles as d, getMinimumSpanningTree as f, getPreorders as g, getPreorder as h, genPostorders as i, addNode as j, addEdge as k, getAllPairsShortestPaths as l, getPostorders as m, dfs as n, genShortestPaths as o, getPostorder as p, genCycles as r, genSimplePaths as s, bfs as t, getConnectedComponents as u, getShortestPaths as v, isAcyclic as w, getStronglyConnectedComponents as x, getSimplePath as y, getNode as z };
+export { addEntities as A, getEdge as B, hasPath as C, joinPaths as D, isTree as E, createGraphNode as F, updateEntities as G, hasEdge as H, createVisualGraph as I, updateNode as K, deleteEdge as L, createGraph as M, createGraphEdge as N, GraphInstance as O, createGraphFromTransition as P, deleteEntities as R, getTopologicalSort as S, isConnected as T, hasNode as U, getNode as V, updateEdge as W, getShortestPath as _, genPreorders as a, getSimplePaths as b, getAStarPath as c, getCycles as d, getMinimumSpanningTree as f, getPreorders as g, getPreorder as h, genPostorders as i, addNode as j, addEdge as k, getAllPairsShortestPaths as l, getPostorders as m, dfs as n, genShortestPaths as o, getPostorder as p, genCycles as r, genSimplePaths as s, bfs as t, getConnectedComponents as u, getShortestPaths as v, isAcyclic as w, getStronglyConnectedComponents as x, getSimplePath as y, deleteNode as z };

package/dist/algorithms.d.mts

@@ -1,4 +1,4 @@
-import { C as SinglePathOptions, S as PathOptions, T as TraversalOptions, _ as GraphPath, h as GraphNode, n as AllPairsShortestPathsOptions, t as AStarOptions, u as Graph, y as MSTOptions } from "./types-DF-HNw50.mjs";
+import { C as SinglePathOptions, S as PathOptions, T as TraversalOptions, _ as GraphPath, h as GraphNode, n as AllPairsShortestPathsOptions, t as AStarOptions, u as Graph, y as MSTOptions } from "./types-DkKjaQW3.mjs";
 
 //#region src/algorithms.d.ts
 

package/dist/algorithms.mjs

@@ -1,3 +1,3 @@
-import { C as hasPath, D as joinPaths, E as isTree, S as getTopologicalSort, T as isConnected, _ as getShortestPath, a as genPreorders, b as getSimplePaths, c as getAStarPath, d as getCycles, f as getMinimumSpanningTree, g as getPreorders, h as getPreorder, i as genPostorders, l as getAllPairsShortestPaths, m as getPostorders, n as dfs, o as genShortestPaths, p as getPostorder, r as genCycles, s as genSimplePaths, t as bfs, u as getConnectedComponents, v as getShortestPaths, w as isAcyclic, x as getStronglyConnectedComponents, y as getSimplePath } from "./algorithms-oVD9PYil.mjs";
+import { C as hasPath, D as joinPaths, E as isTree, S as getTopologicalSort, T as isConnected, _ as getShortestPath, a as genPreorders, b as getSimplePaths, c as getAStarPath, d as getCycles, f as getMinimumSpanningTree, g as getPreorders, h as getPreorder, i as genPostorders, l as getAllPairsShortestPaths, m as getPostorders, n as dfs, o as genShortestPaths, p as getPostorder, r as genCycles, s as genSimplePaths, t as bfs, u as getConnectedComponents, v as getShortestPaths, w as isAcyclic, x as getStronglyConnectedComponents, y as getSimplePath } from "./algorithms-Dw5jEwDK.mjs";
 
 export { bfs, dfs, genCycles, genPostorders, genPreorders, genShortestPaths, genSimplePaths, getAStarPath, getAllPairsShortestPaths, getConnectedComponents, getCycles, getMinimumSpanningTree, getPostorder, getPostorders, getPreorder, getPreorders, getShortestPath, getShortestPaths, getSimplePath, getSimplePaths, getStronglyConnectedComponents, getTopologicalSort, hasPath, isAcyclic, isConnected, isTree, joinPaths };

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

@@ -1,4 +1,4 @@
-import { u as Graph } from "../../types-DF-HNw50.mjs";
+import { u as Graph } from "../../types-DkKjaQW3.mjs";
 
 //#region src/formats/adjacency-list/index.d.ts
 

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

@@ -1,4 +1,4 @@
-import { m as GraphFormatConverter, u as Graph } from "../../types-DF-HNw50.mjs";
+import { m as GraphFormatConverter, u as Graph } from "../../types-DkKjaQW3.mjs";
 
 //#region src/formats/converter/index.d.ts
 

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

@@ -1,4 +1,4 @@
-import { m as GraphFormatConverter, u as Graph } from "../../types-DF-HNw50.mjs";
+import { m as GraphFormatConverter, u as Graph } from "../../types-DkKjaQW3.mjs";
 
 //#region src/formats/cytoscape/index.d.ts
 interface CytoscapeNode {

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

@@ -1,4 +1,4 @@
-import { m as GraphFormatConverter, u as Graph } from "../../types-DF-HNw50.mjs";
+import { m as GraphFormatConverter, u as Graph } from "../../types-DkKjaQW3.mjs";
 
 //#region src/formats/d3/index.d.ts
 interface D3Node {

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

@@ -1,4 +1,4 @@
-import { m as GraphFormatConverter, u as Graph } from "../../types-DF-HNw50.mjs";
+import { m as GraphFormatConverter, u as Graph } from "../../types-DkKjaQW3.mjs";
 
 //#region src/formats/dot/index.d.ts
 

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

@@ -1,4 +1,4 @@
-import { u as Graph } from "../../types-DF-HNw50.mjs";
+import { u as Graph } from "../../types-DkKjaQW3.mjs";
 
 //#region src/formats/edge-list/index.d.ts
 

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

@@ -1,4 +1,4 @@
-import { D as VisualGraph, k as VisualGraphFormatConverter } from "../../types-DF-HNw50.mjs";
+import { D as VisualGraph, k as VisualGraphFormatConverter } from "../../types-DkKjaQW3.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

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

@@ -1,4 +1,4 @@
-import { m as GraphFormatConverter, u as Graph } from "../../types-DF-HNw50.mjs";
+import { m as GraphFormatConverter, u as Graph } from "../../types-DkKjaQW3.mjs";
 
 //#region src/formats/gexf/index.d.ts
 declare function toGEXF(graph: Graph): string;

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

@@ -1,4 +1,4 @@
-import { m as GraphFormatConverter, u as Graph } from "../../types-DF-HNw50.mjs";
+import { m as GraphFormatConverter, u as Graph } from "../../types-DkKjaQW3.mjs";
 
 //#region src/formats/gml/index.d.ts
 

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

@@ -1,4 +1,4 @@
-import { m as GraphFormatConverter, u as Graph } from "../../types-DF-HNw50.mjs";
+import { m as GraphFormatConverter, u as Graph } from "../../types-DkKjaQW3.mjs";
 
 //#region src/formats/graphml/index.d.ts
 declare function toGraphML(graph: Graph): string;

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

@@ -1,4 +1,4 @@
-import { m as GraphFormatConverter, u as Graph } from "../../types-DF-HNw50.mjs";
+import { m as GraphFormatConverter, u as Graph } from "../../types-DkKjaQW3.mjs";
 
 //#region src/formats/jgf/index.d.ts
 interface JGFNode {

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

@@ -1,4 +1,4 @@
-import { m as GraphFormatConverter, u as Graph } from "../../types-DF-HNw50.mjs";
+import { m as GraphFormatConverter, u as Graph } from "../../types-DkKjaQW3.mjs";
 
 //#region src/formats/mermaid/sequence.d.ts
 interface SequenceNodeData {

package/dist/formats/mermaid/index.mjs

@@ -1836,7 +1836,10 @@ function fromMermaidClass(input) {
 		if (classBlockMatch) {
 			currentClass = classBlockMatch[1];
 			const node = ensureNode(currentClass);
-			if (classBlockMatch[2]) node.data.genericType = classBlockMatch[2];
+			if (classBlockMatch[2]) {
+				node.data ??= {};
+				node.data.genericType = classBlockMatch[2];
+			}
 			inClassBlock = true;
 			braceDepth = 1;
 			continue;
@@ -1852,10 +1855,13 @@ function fromMermaidClass(input) {
 			}
 			const annotMatch = line.match(/^<<(.+)>>$/);
 			if (annotMatch) {
-				nodeMap.get(currentClass).data.annotation = annotMatch[1];
+				const node$1 = nodeMap.get(currentClass);
+				node$1.data ??= {};
+				node$1.data.annotation = annotMatch[1];
 				continue;
 			}
 			const node = nodeMap.get(currentClass);
+			node.data ??= {};
 			if (!node.data.members) node.data.members = [];
 			node.data.members.push(parseMember(line));
 			continue;
@@ -1863,12 +1869,16 @@ function fromMermaidClass(input) {
 		const classInlineMatch = line.match(/^class\s+(\S+?)(?:~(.+?)~)?\s*$/);
 		if (classInlineMatch) {
 			const node = ensureNode(classInlineMatch[1]);
-			if (classInlineMatch[2]) node.data.genericType = classInlineMatch[2];
+			if (classInlineMatch[2]) {
+				node.data ??= {};
+				node.data.genericType = classInlineMatch[2];
+			}
 			continue;
 		}
 		const annotLineMatch = line.match(/^<<(.+)>>\s+(\S+)\s*$/);
 		if (annotLineMatch) {
 			const node = ensureNode(annotLineMatch[2]);
+			node.data ??= {};
 			node.data.annotation = annotLineMatch[1];
 			continue;
 		}
@@ -1876,6 +1886,7 @@ function fromMermaidClass(input) {
 		if (inlineMemberMatch) {
 			if (!parseRelationship(line)) {
 				const node = ensureNode(inlineMemberMatch[1]);
+				node.data ??= {};
 				if (!node.data.members) node.data.members = [];
 				node.data.members.push(parseMember(inlineMemberMatch[2]));
 				continue;
@@ -2067,7 +2078,10 @@ function fromMermaidER(input) {
 			const attrMatch = line.match(/^(\S+)\s+(\S+)(?:\s+(PK|FK|UK))?(?:\s+"([^"]*)")?$/);
 			if (attrMatch) {
 				const node = nodeMap.get(currentEntity);
-				if (!node.data.attributes) node.data.attributes = [];
+				if (!node.data?.attributes) {
+					if (!node.data) node.data = {};
+					node.data.attributes = [];
+				}
 				node.data.attributes.push({
 					type: attrMatch[1],
 					name: attrMatch[2],
@@ -2289,7 +2303,7 @@ function toMermaidMindmap(graph) {
 			const indent = "  ".repeat(depth + 1);
 			const shape = child.shape;
 			const brackets = shape ? SHAPE_TO_BRACKETS[shape] : void 0;
-			const label = escapeMermaidLabel(child.label);
+			const label = escapeMermaidLabel(child.label ?? child.id);
 			const text = brackets ? `${brackets[0]}${label}${brackets[1]}` : label;
 			let extra = "";
 			if (child.data?.icon) extra = `\n${"  ".repeat(depth + 2)}::icon(${child.data.icon})`;
@@ -2442,7 +2456,7 @@ function fromMermaidBlock(input) {
 			const label = spanMatch[2] ?? id;
 			const span = parseInt(spanMatch[3], 10);
 			const node = ensureNode(id, label);
-			node.data.span = span;
+			if (node.data) node.data.span = span;
 			continue;
 		}
 		const parts = line.split(/\s+/);

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

@@ -1,4 +1,4 @@
-import { m as GraphFormatConverter, u as Graph } from "../../types-DF-HNw50.mjs";
+import { m as GraphFormatConverter, u as Graph } from "../../types-DkKjaQW3.mjs";
 
 //#region src/formats/tgf/index.d.ts
 

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

@@ -1,4 +1,4 @@
-import { D as VisualGraph, k as VisualGraphFormatConverter } from "../../types-DF-HNw50.mjs";
+import { D as VisualGraph, k as VisualGraphFormatConverter } from "../../types-DkKjaQW3.mjs";
 import { EdgeBase, NodeBase } from "@xyflow/system";
 
 //#region src/formats/xyflow/index.d.ts

package/dist/index.d.mts

@@ -1,10 +1,30 @@
-import { A as VisualNode, C as SinglePathOptions, D as VisualGraph, E as VisualEdge, M as WalkOptions, N as WeightedWalkOptions, O as VisualGraphConfig, S as PathOptions, T as TraversalOptions, _ as GraphPath, a as EdgeChange, b as NodeChange, c as EntitiesUpdate, d as GraphConfig, f as GraphDiff, g as GraphPatch, h as GraphNode, i as DeleteNodeOptions, j as WalkContext, l as EntityRect, m as GraphFormatConverter, n as AllPairsShortestPathsOptions, o as EdgeConfig, p as GraphEdge, r as CoverageStats, s as EntitiesConfig, t as AStarOptions, u as Graph, v as GraphStep, w as TransitionOptions, x as NodeConfig, y as MSTOptions } from "./types-DF-HNw50.mjs";
+import { A as VisualNode, C as SinglePathOptions, D as VisualGraph, E as VisualEdge, M as WalkOptions, N as WeightedWalkOptions, O as VisualGraphConfig, S as PathOptions, T as TraversalOptions, _ as GraphPath, a as EdgeChange, b as NodeChange, c as EntitiesUpdate, d as GraphConfig, f as GraphDiff, g as GraphPatch, h as GraphNode, i as DeleteNodeOptions, j as WalkContext, l as EntityRect, m as GraphFormatConverter, n as AllPairsShortestPathsOptions, o as EdgeConfig, p as GraphEdge, r as CoverageStats, s as EntitiesConfig, t as AStarOptions, u as Graph, v as GraphStep, w as TransitionOptions, x as NodeConfig, y as MSTOptions } from "./types-DkKjaQW3.mjs";
 import { bfs, dfs, genCycles, genPostorders, genPreorders, genShortestPaths, genSimplePaths, getAStarPath, 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";
 
 //#region src/graph.d.ts
 
+/**
+ * Create a resolved graph node from a config. Fills in defaults.
+ *
+ * @example
+ * ```ts
+ * const node = createGraphNode({ id: 'a', data: { label: 'hi' } });
+ * // { type: 'node', id: 'a', label: '', data: { label: 'hi' } }
+ * ```
+ */
+declare function createGraphNode<T = any>(config: NodeConfig<T>): GraphNode<T>;
+/**
+ * Create a resolved graph edge from a config. Fills in defaults.
+ *
+ * @example
+ * ```ts
+ * const edge = createGraphEdge({ id: 'e1', sourceId: 'a', targetId: 'b' });
+ * // { type: 'edge', id: 'e1', sourceId: 'a', targetId: 'b', label: null, data: undefined }
+ * ```
+ */
+declare function createGraphEdge<T = any>(config: EdgeConfig<T>): GraphEdge<T>;
 /**
  * Create a graph from a config. Resolves defaults for all fields.
  *
@@ -547,4 +567,4 @@ declare function getCoverage<N, E>(graph: Graph<N, E>, steps: GraphStep<N, E>[],
   from?: string;
 }): CoverageStats;
 //#endregion
-export { type AStarOptions, type AllPairsShortestPathsOptions, type CoverageStats, type DeleteNodeOptions, type EdgeChange, type EdgeConfig, type EntitiesConfig, type EntitiesUpdate, type Graph, type GraphConfig, type GraphDiff, type GraphEdge, type GraphFormatConverter, GraphInstance, type GraphNode, type GraphPatch, type GraphPath, type GraphStep, type MSTOptions, type NodeChange, type NodeConfig, type PathOptions, type EntityRect as Positioned, type SinglePathOptions, type TransitionOptions, type TraversalOptions, type VisualEdge, type VisualGraph, type VisualGraphConfig, type VisualNode, type WalkContext, type WalkOptions, type WeightedWalkOptions, addEdge, addEntities, addNode, applyPatches, bfs, createFormatConverter, createGraph, createGraphFromTransition, createVisualGraph, deleteEdge, deleteEntities, deleteNode, dfs, flatten, genCycles, genPostorders, genPredefinedWalk, genPreorders, genQuickRandomWalk, genRandomWalk, genShortestPaths, genSimplePaths, genWeightedRandomWalk, getAStarPath, getAllPairsShortestPaths, getAncestors, getChildren, getConnectedComponents, getCoverage, getCycles, getDegree, getDepth, getDescendants, getDiff, getEdge, getEdgeBetween, getEdgesOf, getInDegree, getInEdges, getLCA, getMinimumSpanningTree, getNeighbors, getNode, getOutDegree, getOutEdges, getParent, getPatches, getPostorder, getPostorders, getPredecessors, getPreorder, getPreorders, getRelativeDistance, getRelativeDistanceMap, getRoots, getShortestPath, getShortestPaths, getSiblings, getSimplePath, getSimplePaths, getSinks, getSources, getStronglyConnectedComponents, getSubgraph, getSuccessors, getTopologicalSort, hasEdge, hasNode, hasPath, invalidateIndex, invertDiff, isAcyclic, isCompound, isConnected, isEmptyDiff, isLeaf, isTree, joinPaths, reverseGraph, takeSteps, takeUntilEdge, takeUntilEdgeCoverage, takeUntilNode, takeUntilNodeCoverage, toDiff, toPatches, updateEdge, updateEntities, updateNode };
+export { type AStarOptions, type AllPairsShortestPathsOptions, type CoverageStats, type DeleteNodeOptions, type EdgeChange, type EdgeConfig, type EntitiesConfig, type EntitiesUpdate, type Graph, type GraphConfig, type GraphDiff, type GraphEdge, type GraphFormatConverter, GraphInstance, type GraphNode, type GraphPatch, type GraphPath, type GraphStep, type MSTOptions, type NodeChange, type NodeConfig, type PathOptions, type EntityRect as Positioned, type SinglePathOptions, type TransitionOptions, type TraversalOptions, type VisualEdge, type VisualGraph, type VisualGraphConfig, type VisualNode, type WalkContext, type WalkOptions, type WeightedWalkOptions, addEdge, addEntities, addNode, applyPatches, bfs, createFormatConverter, createGraph, createGraphEdge, createGraphFromTransition, createGraphNode, createVisualGraph, deleteEdge, deleteEntities, deleteNode, dfs, flatten, genCycles, genPostorders, genPredefinedWalk, genPreorders, genQuickRandomWalk, genRandomWalk, genShortestPaths, genSimplePaths, genWeightedRandomWalk, getAStarPath, getAllPairsShortestPaths, getAncestors, getChildren, getConnectedComponents, getCoverage, getCycles, getDegree, getDepth, getDescendants, getDiff, getEdge, getEdgeBetween, getEdgesOf, getInDegree, getInEdges, getLCA, getMinimumSpanningTree, getNeighbors, getNode, getOutDegree, getOutEdges, getParent, getPatches, getPostorder, getPostorders, getPredecessors, getPreorder, getPreorders, getRelativeDistance, getRelativeDistanceMap, getRoots, getShortestPath, getShortestPaths, getSiblings, getSimplePath, getSimplePaths, getSinks, getSources, getStronglyConnectedComponents, getSubgraph, getSuccessors, getTopologicalSort, hasEdge, hasNode, hasPath, invalidateIndex, invertDiff, isAcyclic, isCompound, isConnected, isEmptyDiff, isLeaf, isTree, joinPaths, reverseGraph, takeSteps, takeUntilEdge, takeUntilEdgeCoverage, takeUntilNode, takeUntilNodeCoverage, toDiff, toPatches, updateEdge, updateEntities, updateNode };

package/dist/index.mjs

@@ -1,5 +1,5 @@
 import { o as invalidateIndex, t as getIndex } from "./indexing-DyfgLuzw.mjs";
-import { A as addEntities, B as hasEdge, C as hasPath, D as joinPaths, E as isTree, F as deleteEdge, H as updateEdge, I as deleteEntities, L as deleteNode, M as createGraph, N as createGraphFromTransition, O as GraphInstance, P as createVisualGraph, R as getEdge, S as getTopologicalSort, T as isConnected, U as updateEntities, V as hasNode, W as updateNode, _ as getShortestPath, a as genPreorders, b as getSimplePaths, c as getAStarPath, d as getCycles, f as getMinimumSpanningTree, g as getPreorders, h as getPreorder, i as genPostorders, j as addNode, k as addEdge, l as getAllPairsShortestPaths, m as getPostorders, n as dfs, o as genShortestPaths, p as getPostorder, r as genCycles, s as genSimplePaths, t as bfs, u as getConnectedComponents, v as getShortestPaths, w as isAcyclic, x as getStronglyConnectedComponents, y as getSimplePath, z as getNode } from "./algorithms-oVD9PYil.mjs";
+import { A as addEntities, B as getEdge, C as hasPath, D as joinPaths, E as isTree, F as createGraphNode, G as updateEntities, H as hasEdge, I as createVisualGraph, K as updateNode, L as deleteEdge, M as createGraph, N as createGraphEdge, O as GraphInstance, P as createGraphFromTransition, R as deleteEntities, S as getTopologicalSort, T as isConnected, U as hasNode, V as getNode, W as updateEdge, _ as getShortestPath, a as genPreorders, b as getSimplePaths, c as getAStarPath, d as getCycles, f as getMinimumSpanningTree, g as getPreorders, h as getPreorder, i as genPostorders, j as addNode, k as addEdge, l as getAllPairsShortestPaths, m as getPostorders, n as dfs, o as genShortestPaths, p as getPostorder, r as genCycles, s as genSimplePaths, t as bfs, u as getConnectedComponents, v as getShortestPaths, w as isAcyclic, x as getStronglyConnectedComponents, y as getSimplePath, z as deleteNode } from "./algorithms-Dw5jEwDK.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-B5CUD0r9.mjs";
 
@@ -813,4 +813,4 @@ function getCoverage(graph, steps, options) {
 }
 
 //#endregion
-export { GraphInstance, addEdge, addEntities, addNode, applyPatches, bfs, createFormatConverter, createGraph, createGraphFromTransition, createVisualGraph, deleteEdge, deleteEntities, deleteNode, dfs, flatten, genCycles, genPostorders, genPredefinedWalk, genPreorders, genQuickRandomWalk, genRandomWalk, genShortestPaths, genSimplePaths, genWeightedRandomWalk, getAStarPath, getAllPairsShortestPaths, getAncestors, getChildren, getConnectedComponents, getCoverage, getCycles, getDegree, getDepth, getDescendants, getDiff, getEdge, getEdgeBetween, getEdgesOf, getInDegree, getInEdges, getLCA, getMinimumSpanningTree, getNeighbors, getNode, getOutDegree, getOutEdges, getParent, getPatches, getPostorder, getPostorders, getPredecessors, getPreorder, getPreorders, getRelativeDistance, getRelativeDistanceMap, getRoots, getShortestPath, getShortestPaths, getSiblings, getSimplePath, getSimplePaths, getSinks, getSources, getStronglyConnectedComponents, getSubgraph, getSuccessors, getTopologicalSort, hasEdge, hasNode, hasPath, invalidateIndex, invertDiff, isAcyclic, isCompound, isConnected, isEmptyDiff, isLeaf, isTree, joinPaths, reverseGraph, takeSteps, takeUntilEdge, takeUntilEdgeCoverage, takeUntilNode, takeUntilNodeCoverage, toDiff, toPatches, updateEdge, updateEntities, updateNode };
+export { GraphInstance, addEdge, addEntities, addNode, applyPatches, bfs, createFormatConverter, createGraph, createGraphEdge, createGraphFromTransition, createGraphNode, createVisualGraph, deleteEdge, deleteEntities, deleteNode, dfs, flatten, genCycles, genPostorders, genPredefinedWalk, genPreorders, genQuickRandomWalk, genRandomWalk, genShortestPaths, genSimplePaths, genWeightedRandomWalk, getAStarPath, getAllPairsShortestPaths, getAncestors, getChildren, getConnectedComponents, getCoverage, getCycles, getDegree, getDepth, getDescendants, getDiff, getEdge, getEdgeBetween, getEdgesOf, getInDegree, getInEdges, getLCA, getMinimumSpanningTree, getNeighbors, getNode, getOutDegree, getOutEdges, getParent, getPatches, getPostorder, getPostorders, getPredecessors, getPreorder, getPreorders, getRelativeDistance, getRelativeDistanceMap, getRoots, getShortestPath, getShortestPaths, getSiblings, getSimplePath, getSimplePaths, getSinks, getSources, getStronglyConnectedComponents, getSubgraph, getSuccessors, getTopologicalSort, hasEdge, hasNode, hasPath, invalidateIndex, invertDiff, isAcyclic, isCompound, isConnected, isEmptyDiff, isLeaf, isTree, joinPaths, reverseGraph, takeSteps, takeUntilEdge, takeUntilEdgeCoverage, takeUntilNode, takeUntilNodeCoverage, toDiff, toPatches, updateEdge, updateEntities, updateNode };

package/dist/queries.d.mts

@@ -1,4 +1,4 @@
-import { h as GraphNode, p as GraphEdge, u as Graph } from "./types-DF-HNw50.mjs";
+import { h as GraphNode, p as GraphEdge, u as Graph } from "./types-DkKjaQW3.mjs";
 
 //#region src/queries.d.ts
 

package/dist/queries.mjs

@@ -565,7 +565,7 @@ function getRelativeDistanceMap(graph, parentId) {
 	if (parentId !== null) {
 		const pi = idx.nodeById.get(parentId);
 		if (pi !== void 0) sourceId = graph.nodes[pi].initialNodeId ?? null;
-	} else sourceId = graph.initialNodeId;
+	} else sourceId = graph.initialNodeId ?? null;
 	if (!sourceId) return {};
 	const siblingSet = new Set(idx.childNodes.get(parentId) ?? []);
 	if (!siblingSet.has(sourceId)) return {};

package/dist/schemas.d.mts

@@ -6,7 +6,7 @@ declare const NodeSchema: z.ZodObject<{
   id: z.ZodString;
   parentId: z.ZodOptional<z.ZodNullable<z.ZodString>>;
   initialNodeId: z.ZodOptional<z.ZodNullable<z.ZodString>>;
-  label: z.ZodString;
+  label: z.ZodOptional<z.ZodString>;
   data: z.ZodAny;
   x: z.ZodOptional<z.ZodNumber>;
   y: z.ZodOptional<z.ZodNumber>;
@@ -21,7 +21,7 @@ declare const EdgeSchema: z.ZodObject<{
   id: z.ZodString;
   sourceId: z.ZodString;
   targetId: z.ZodString;
-  label: z.ZodString;
+  label: z.ZodOptional<z.ZodNullable<z.ZodString>>;
   weight: z.ZodOptional<z.ZodNumber>;
   data: z.ZodAny;
   x: z.ZodOptional<z.ZodNumber>;
@@ -37,13 +37,13 @@ declare const GraphSchema: z.ZodObject<{
     directed: "directed";
     undirected: "undirected";
   }>;
-  initialNodeId: z.ZodNullable<z.ZodString>;
+  initialNodeId: z.ZodOptional<z.ZodNullable<z.ZodString>>;
   nodes: z.ZodArray<z.ZodObject<{
     type: z.ZodLiteral<"node">;
     id: z.ZodString;
     parentId: z.ZodOptional<z.ZodNullable<z.ZodString>>;
     initialNodeId: z.ZodOptional<z.ZodNullable<z.ZodString>>;
-    label: z.ZodString;
+    label: z.ZodOptional<z.ZodString>;
     data: z.ZodAny;
     x: z.ZodOptional<z.ZodNumber>;
     y: z.ZodOptional<z.ZodNumber>;
@@ -58,7 +58,7 @@ declare const GraphSchema: z.ZodObject<{
     id: z.ZodString;
     sourceId: z.ZodString;
     targetId: z.ZodString;
-    label: z.ZodString;
+    label: z.ZodOptional<z.ZodNullable<z.ZodString>>;
     weight: z.ZodOptional<z.ZodNumber>;
     data: z.ZodAny;
     x: z.ZodOptional<z.ZodNumber>;

package/dist/schemas.mjs

@@ -7,7 +7,7 @@ const NodeSchema = z.object({
 	id: z.string(),
 	parentId: z.string().nullable().optional(),
 	initialNodeId: z.string().nullable().optional(),
-	label: z.string(),
+	label: z.string().optional(),
 	data: z.any(),
 	x: z.number().optional(),
 	y: z.number().optional(),
@@ -22,7 +22,7 @@ const EdgeSchema = z.object({
 	id: z.string(),
 	sourceId: z.string(),
 	targetId: z.string(),
-	label: z.string(),
+	label: z.string().nullable().optional(),
 	weight: z.number().optional(),
 	data: z.any(),
 	x: z.number().optional(),
@@ -35,7 +35,7 @@ const EdgeSchema = z.object({
 const GraphSchema = z.object({
 	id: z.string(),
 	type: z.enum(["directed", "undirected"]),
-	initialNodeId: z.string().nullable(),
+	initialNodeId: z.string().nullable().optional(),
 	nodes: z.array(NodeSchema),
 	edges: z.array(EdgeSchema),
 	data: z.any(),

package/dist/{types-DF-HNw50.d.mts → types-DkKjaQW3.d.mts}

@@ -63,7 +63,7 @@ interface EdgeConfig<TEdgeData = any> {
 interface Graph<TNodeData = any, TEdgeData = any, TGraphData = any> {
   id: string;
   type: 'directed' | 'undirected';
-  initialNodeId: string | null;
+  initialNodeId?: string | null;
   nodes: GraphNode<TNodeData>[];
   edges: GraphEdge<TEdgeData>[];
   data: TGraphData;
@@ -75,7 +75,7 @@ interface GraphNode<TNodeData = any> {
   id: string;
   parentId?: string | null;
   initialNodeId?: string | null;
-  label: string;
+  label?: string;
   data: TNodeData;
   x?: number;
   y?: number;
@@ -90,7 +90,7 @@ interface GraphEdge<TEdgeData = any> {
   id: string;
   sourceId: string;
   targetId: string;
-  label: string | null;
+  label?: string | null;
   /**
    * Optional numeric weight for the edge.
    * Used by pathfinding, MST, and other weighted algorithms.

package/package.json

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