@statelyai/graph 0.5.0 → 0.7.0

package/dist/queries.d.mts

@@ -1,4 +1,4 @@
-import { c as Graph, d as GraphEdge, p as GraphNode } from "./types-FBZCrmnG.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,8 @@ 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>;
   y: z.ZodOptional<z.ZodNumber>;
@@ -36,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>;
@@ -57,7 +58,8 @@ 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>;
     y: 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,8 @@ 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(),
 	y: z.number().optional(),
@@ -34,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-FBZCrmnG.d.mts → types-DkKjaQW3.d.mts}

@@ -45,7 +45,13 @@ interface EdgeConfig<TEdgeData = any> {
   /**
    * The label of the edge.
    */
-  label?: string;
+  label?: string | null;
+  /**
+   * Optional numeric weight for the edge.
+   * Used by pathfinding, MST, and other weighted algorithms.
+   * When `getWeight` is not provided, algorithms default to `edge.weight ?? 1`.
+   */
+  weight?: number;
   data?: TEdgeData;
   x?: number;
   y?: number;
@@ -57,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;
@@ -69,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;
@@ -84,7 +90,13 @@ interface GraphEdge<TEdgeData = any> {
   id: string;
   sourceId: string;
   targetId: string;
-  label: string;
+  label?: string | null;
+  /**
+   * Optional numeric weight for the edge.
+   * Used by pathfinding, MST, and other weighted algorithms.
+   * When `getWeight` is not provided, algorithms default to `edge.weight ?? 1`.
+   */
+  weight?: number;
   data: TEdgeData;
   x?: number;
   y?: number;
@@ -139,7 +151,7 @@ interface PathOptions<TEdgeData = any> {
   from?: string;
   /** Target node ID. If omitted → paths to all reachable nodes */
   to?: string;
-  /** Edge weight function. Default: every edge = 1. */
+  /** Edge weight function. Default: `(e) => e.weight ?? 1`. */
   getWeight?: (edge: GraphEdge<TEdgeData>) => number;
 }
 interface SinglePathOptions<TEdgeData = any> {
@@ -147,8 +159,21 @@ interface SinglePathOptions<TEdgeData = any> {
   from?: string;
   /** Target node ID. Required for single-path queries. */
   to: string;
-  /** Edge weight function. Default: every edge = 1. */
+  /** Edge weight function. Default: `(e) => e.weight ?? 1`. */
+  getWeight?: (edge: GraphEdge<TEdgeData>) => number;
+}
+interface AStarOptions<TEdgeData = any> {
+  /** Source node ID. */
+  from: string;
+  /** Target node ID. */
+  to: string;
+  /** Edge weight function. Default: `(e) => e.weight ?? 1`. */
   getWeight?: (edge: GraphEdge<TEdgeData>) => number;
+  /**
+   * Heuristic function estimating cost from a node to the target.
+   * Must be admissible (never overestimates the actual cost).
+   */
+  heuristic: (nodeId: string) => number;
 }
 interface TraversalOptions {
   /** Source node ID. Default: graph.initialNodeId, else sole inDegree-0 node */
@@ -157,13 +182,13 @@ interface TraversalOptions {
 interface MSTOptions<TEdgeData = any> {
   /** Algorithm to use. Default: 'prim'. */
   algorithm?: 'prim' | 'kruskal';
-  /** Edge weight function. Default: every edge = 1. */
+  /** Edge weight function. Default: `(e) => e.weight ?? 1`. */
   getWeight?: (edge: GraphEdge<TEdgeData>) => number;
 }
 interface AllPairsShortestPathsOptions<TEdgeData = any> {
   /** Algorithm to use. Default: 'dijkstra'. */
   algorithm?: 'floyd-warshall' | 'dijkstra';
-  /** Edge weight function. Default: every edge = 1. */
+  /** Edge weight function. Default: `(e) => e.weight ?? 1`. */
   getWeight?: (edge: GraphEdge<TEdgeData>) => number;
 }
 interface NodeChange<TNodeData = any> {
@@ -245,6 +270,33 @@ interface VisualGraphFormatConverter<TSerial, N = any, E = any, G = any> {
   /** Convert from the serialized format to a VisualGraph. */
   from(input: TSerial): VisualGraph<N, E, G>;
 }
+interface WalkOptions<TEdgeData = any> {
+  /** Start node ID. Default: graph.initialNodeId, else sole inDegree-0 node */
+  from?: string;
+  /** Seed for deterministic RNG. Omit for Math.random. */
+  seed?: number;
+  /** Guard: only traverse edges where filter returns true. */
+  filter?: (edge: GraphEdge<TEdgeData>, context: WalkContext) => boolean;
+  /** Callback fired after each step. */
+  onStep?: (step: GraphStep<any, TEdgeData>, context: WalkContext) => void;
+}
+interface WeightedWalkOptions<TEdgeData = any> extends WalkOptions<TEdgeData> {
+  /** Edge weight function. Default: `(e) => e.weight ?? 1`. */
+  getWeight?: (edge: GraphEdge<TEdgeData>) => number;
+}
+interface WalkContext {
+  currentNodeId: string;
+  visitedNodes: Set<string>;
+  visitedEdges: Set<string>;
+  stepCount: number;
+}
+interface CoverageStats {
+  nodeCoverage: number;
+  edgeCoverage: number;
+  visitedNodes: string[];
+  visitedEdges: string[];
+  totalSteps: number;
+}
 interface TransitionOptions<TState, TEvent> {
   /** Initial state to begin BFS exploration from. */
   initialState: TState;
@@ -262,4 +314,4 @@ interface TransitionOptions<TState, TEvent> {
   id?: string;
 }
 //#endregion
-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 };
+export { VisualNode as A, SinglePathOptions as C, VisualGraph as D, VisualEdge as E, WalkOptions as M, WeightedWalkOptions as N, VisualGraphConfig as O, PathOptions as S, TraversalOptions as T, GraphPath as _, EdgeChange as a, NodeChange as b, EntitiesUpdate as c, GraphConfig as d, GraphDiff as f, GraphPatch as g, GraphNode as h, DeleteNodeOptions as i, WalkContext as j, VisualGraphFormatConverter as k, EntityRect as l, GraphFormatConverter as m, AllPairsShortestPathsOptions as n, EdgeConfig as o, GraphEdge as p, CoverageStats as r, EntitiesConfig as s, AStarOptions as t, Graph as u, GraphStep as v, TransitionOptions as w, NodeConfig as x, MSTOptions as y };

package/package.json

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