@langchain/core 1.3.0 → 1.3.2

package/dist/messages/notification.d.ts

@@ -0,0 +1,54 @@
+import { BaseMessage } from "./base.js";
+import { HumanMessage } from "./human.js";
+//#region src/messages/notification.d.ts
+/** Which feature added a message, and that feature's fields. */
+export interface NotificationMetadata {
+  /** The feature that added the message, e.g. `"async_subagent"`. */
+  source: string;
+  /** The feature's fields, documented by that feature. */
+  data?: Record<string, unknown>;
+}
+/**
+ * Return a copy of `message` marked as added by the agent harness.
+ *
+ * Use it for a human message the user didn't type, such as a background task
+ * update or a conversation summary. It sets `additional_kwargs.lc_source`
+ * and, when `data` is given, `additional_kwargs.lc_data`. Any earlier
+ * `lc_source` and `lc_data` are removed first. LangChain's chat model
+ * integrations don't send these keys to the model.
+ *
+ * It doesn't change the content. Write the content the model reads yourself.
+ *
+ * Anyone who can send input to a thread can set these keys. Don't use them to
+ * decide whether to trust a message.
+ *
+ * `mergeMessageRuns` and chunk `concat` join a notification with adjacent
+ * human messages; the merged message keeps the metadata and concatenates
+ * `lc_source`.
+ *
+ * @param message - The message to mark.
+ * @param metadata - The feature that added the message and its fields. `data` must be JSON-serializable.
+ * @returns A shallow copy of `message`, with the same `id`.
+ *
+ * @example
+ * ```typescript
+ * import { HumanMessage, addNotificationMetadata } from "@langchain/core/messages";
+ *
+ * const message = addNotificationMetadata(
+ *   new HumanMessage("Background task t_42 finished."),
+ *   { source: "async_subagent", data: { task_id: "t_42", status: "success" } }
+ * );
+ * ```
+ */
+export declare function addNotificationMetadata(message: HumanMessage, metadata: NotificationMetadata): HumanMessage;
+/**
+ * Return the notification metadata of `message`.
+ *
+ * @param message - The message to read.
+ * @returns The metadata `addNotificationMetadata` set, or `undefined` for a
+ * message without a string `lc_source`. `data` is a copy of `lc_data`, left out
+ * unless `lc_data` is an object.
+ */
+export declare function getNotificationMetadata(message: BaseMessage): NotificationMetadata | undefined;
+//#endregion
+//# sourceMappingURL=notification.d.ts.map

package/dist/messages/notification.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"notification.d.ts","names":[],"sources":["../../src/messages/notification.ts"],"mappings":";;;;iBAIiB;;EAEf;;EAEA,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;wBAmCO,wBACd,SAAS,cACT,UAAU,uBACT;;;;;;;;;wBA2Ba,wBACd,SAAS,cACR"}

package/dist/messages/notification.js

@@ -0,0 +1,68 @@
+import { HumanMessage } from "./human.js";
+//#region src/messages/notification.ts
+/**
+* Return a copy of `message` marked as added by the agent harness.
+*
+* Use it for a human message the user didn't type, such as a background task
+* update or a conversation summary. It sets `additional_kwargs.lc_source`
+* and, when `data` is given, `additional_kwargs.lc_data`. Any earlier
+* `lc_source` and `lc_data` are removed first. LangChain's chat model
+* integrations don't send these keys to the model.
+*
+* It doesn't change the content. Write the content the model reads yourself.
+*
+* Anyone who can send input to a thread can set these keys. Don't use them to
+* decide whether to trust a message.
+*
+* `mergeMessageRuns` and chunk `concat` join a notification with adjacent
+* human messages; the merged message keeps the metadata and concatenates
+* `lc_source`.
+*
+* @param message - The message to mark.
+* @param metadata - The feature that added the message and its fields. `data` must be JSON-serializable.
+* @returns A shallow copy of `message`, with the same `id`.
+*
+* @example
+* ```typescript
+* import { HumanMessage, addNotificationMetadata } from "@langchain/core/messages";
+*
+* const message = addNotificationMetadata(
+*   new HumanMessage("Background task t_42 finished."),
+*   { source: "async_subagent", data: { task_id: "t_42", status: "success" } }
+* );
+* ```
+*/
+function addNotificationMetadata(message, metadata) {
+	const { lc_data: _, ...kwargs } = message.additional_kwargs ?? {};
+	const additional_kwargs = {
+		...kwargs,
+		lc_source: metadata.source
+	};
+	if (metadata.data !== void 0) additional_kwargs.lc_data = { ...metadata.data };
+	const { lc_kwargs: _kwargs, lc_serializable: _serializable, lc_namespace: _namespace, type: _type, ...fields } = message;
+	return new HumanMessage({
+		...fields,
+		additional_kwargs
+	});
+}
+/**
+* Return the notification metadata of `message`.
+*
+* @param message - The message to read.
+* @returns The metadata `addNotificationMetadata` set, or `undefined` for a
+* message without a string `lc_source`. `data` is a copy of `lc_data`, left out
+* unless `lc_data` is an object.
+*/
+function getNotificationMetadata(message) {
+	const source = message.additional_kwargs?.lc_source;
+	if (typeof source !== "string") return void 0;
+	const data = message.additional_kwargs?.lc_data;
+	return typeof data === "object" && data !== null && !Array.isArray(data) ? {
+		source,
+		data: { ...data }
+	} : { source };
+}
+//#endregion
+export { addNotificationMetadata, getNotificationMetadata };
+
+//# sourceMappingURL=notification.js.map

package/dist/messages/notification.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"notification.js","names":[],"sources":["../../src/messages/notification.ts"],"sourcesContent":["import type { BaseMessage } from \"./base.js\";\nimport { HumanMessage } from \"./human.js\";\n\n/** Which feature added a message, and that feature's fields. */\nexport interface NotificationMetadata {\n  /** The feature that added the message, e.g. `\"async_subagent\"`. */\n  source: string;\n  /** The feature's fields, documented by that feature. */\n  data?: Record<string, unknown>;\n}\n\n/**\n * Return a copy of `message` marked as added by the agent harness.\n *\n * Use it for a human message the user didn't type, such as a background task\n * update or a conversation summary. It sets `additional_kwargs.lc_source`\n * and, when `data` is given, `additional_kwargs.lc_data`. Any earlier\n * `lc_source` and `lc_data` are removed first. LangChain's chat model\n * integrations don't send these keys to the model.\n *\n * It doesn't change the content. Write the content the model reads yourself.\n *\n * Anyone who can send input to a thread can set these keys. Don't use them to\n * decide whether to trust a message.\n *\n * `mergeMessageRuns` and chunk `concat` join a notification with adjacent\n * human messages; the merged message keeps the metadata and concatenates\n * `lc_source`.\n *\n * @param message - The message to mark.\n * @param metadata - The feature that added the message and its fields. `data` must be JSON-serializable.\n * @returns A shallow copy of `message`, with the same `id`.\n *\n * @example\n * ```typescript\n * import { HumanMessage, addNotificationMetadata } from \"@langchain/core/messages\";\n *\n * const message = addNotificationMetadata(\n *   new HumanMessage(\"Background task t_42 finished.\"),\n *   { source: \"async_subagent\", data: { task_id: \"t_42\", status: \"success\" } }\n * );\n * ```\n */\nexport function addNotificationMetadata(\n  message: HumanMessage,\n  metadata: NotificationMetadata\n): HumanMessage {\n  const { lc_data: _, ...kwargs } = message.additional_kwargs ?? {};\n  const additional_kwargs: Record<string, unknown> = {\n    ...kwargs,\n    lc_source: metadata.source,\n  };\n  if (metadata.data !== undefined) {\n    additional_kwargs.lc_data = { ...metadata.data };\n  }\n  const {\n    lc_kwargs: _kwargs,\n    lc_serializable: _serializable,\n    lc_namespace: _namespace,\n    type: _type,\n    ...fields\n  } = message;\n  return new HumanMessage({ ...fields, additional_kwargs });\n}\n\n/**\n * Return the notification metadata of `message`.\n *\n * @param message - The message to read.\n * @returns The metadata `addNotificationMetadata` set, or `undefined` for a\n * message without a string `lc_source`. `data` is a copy of `lc_data`, left out\n * unless `lc_data` is an object.\n */\nexport function getNotificationMetadata(\n  message: BaseMessage\n): NotificationMetadata | undefined {\n  const source = message.additional_kwargs?.lc_source;\n  if (typeof source !== \"string\") return undefined;\n  const data = message.additional_kwargs?.lc_data;\n  const isRecord =\n    typeof data === \"object\" && data !== null && !Array.isArray(data);\n  return isRecord\n    ? { source, data: { ...(data as Record<string, unknown>) } }\n    : { source };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2CA,SAAgB,wBACd,SACA,UACc;CACd,MAAM,EAAE,SAAS,GAAG,GAAG,WAAW,QAAQ,qBAAqB,CAAC;CAChE,MAAM,oBAA6C;EACjD,GAAG;EACH,WAAW,SAAS;CACtB;CACA,IAAI,SAAS,SAAS,KAAA,GACpB,kBAAkB,UAAU,EAAE,GAAG,SAAS,KAAK;CAEjD,MAAM,EACJ,WAAW,SACX,iBAAiB,eACjB,cAAc,YACd,MAAM,OACN,GAAG,WACD;CACJ,OAAO,IAAI,aAAa;EAAE,GAAG;EAAQ;CAAkB,CAAC;AAC1D;;;;;;;;;AAUA,SAAgB,wBACd,SACkC;CAClC,MAAM,SAAS,QAAQ,mBAAmB;CAC1C,IAAI,OAAO,WAAW,UAAU,OAAO,KAAA;CACvC,MAAM,OAAO,QAAQ,mBAAmB;CAGxC,OADE,OAAO,SAAS,YAAY,SAAS,QAAQ,CAAC,MAAM,QAAQ,IAAI,IAE9D;EAAE;EAAQ,MAAM,EAAE,GAAI,KAAiC;CAAE,IACzD,EAAE,OAAO;AACf"}

package/dist/runnables/graph.cjs

@@ -48,7 +48,8 @@ var Graph = class Graph {
 		return {
 			nodes: Object.values(this.nodes).map((node) => ({
 				id: stableNodeIds[node.id],
-				...nodeDataJson(node)
+				...nodeDataJson(node),
+				...node.metadata != null ? { metadata: node.metadata } : {}
 			})),
 			edges: this.edges.map((edge) => {
 				const item = {

package/dist/runnables/graph.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"graph.cjs","names":["isUuid","isRunnableInterface","toJsonSchema","uuidv4","drawMermaid","drawMermaidImage"],"sources":["../../src/runnables/graph.ts"],"sourcesContent":["import { v4 as uuidv4, validate as isUuid } from \"../utils/uuid/index.js\";\nimport type {\n  RunnableInterface,\n  RunnableIOSchema,\n  Node,\n  Edge,\n} from \"./types.js\";\nimport { isRunnableInterface } from \"./utils.js\";\nimport { drawMermaid, drawMermaidImage } from \"./graph_mermaid.js\";\nimport { toJsonSchema } from \"../utils/json_schema.js\";\n\nexport { Node, Edge };\n\nfunction nodeDataStr(\n  id: string | undefined,\n  data: RunnableInterface | RunnableIOSchema\n): string {\n  if (id !== undefined && !isUuid(id)) {\n    return id;\n  } else if (isRunnableInterface(data)) {\n    try {\n      let dataStr = data.getName();\n      dataStr = dataStr.startsWith(\"Runnable\")\n        ? dataStr.slice(\"Runnable\".length)\n        : dataStr;\n      return dataStr;\n    } catch {\n      return data.getName();\n    }\n  } else {\n    return data.name ?? \"UnknownSchema\";\n  }\n}\n\nfunction nodeDataJson(node: Node) {\n  // if node.data implements Runnable\n  if (isRunnableInterface(node.data)) {\n    return {\n      type: \"runnable\",\n      data: {\n        id: node.data.lc_id,\n        name: node.data.getName(),\n      },\n    };\n  } else {\n    return {\n      type: \"schema\",\n      data: { ...toJsonSchema(node.data.schema), title: node.data.name },\n    };\n  }\n}\n\nexport class Graph {\n  nodes: Record<string, Node> = {};\n\n  edges: Edge[] = [];\n\n  constructor(params?: { nodes: Record<string, Node>; edges: Edge[] }) {\n    this.nodes = params?.nodes ?? this.nodes;\n    this.edges = params?.edges ?? this.edges;\n  }\n\n  // Convert the graph to a JSON-serializable format.\n  // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n  toJSON(): Record<string, any> {\n    const stableNodeIds: Record<string, string | number> = {};\n    Object.values(this.nodes).forEach((node, i) => {\n      stableNodeIds[node.id] = isUuid(node.id) ? i : node.id;\n    });\n\n    return {\n      nodes: Object.values(this.nodes).map((node) => ({\n        id: stableNodeIds[node.id],\n        ...nodeDataJson(node),\n      })),\n      edges: this.edges.map((edge) => {\n        const item: Record<string, unknown> = {\n          source: stableNodeIds[edge.source],\n          target: stableNodeIds[edge.target],\n        };\n\n        if (typeof edge.data !== \"undefined\") {\n          item.data = edge.data;\n        }\n\n        if (typeof edge.conditional !== \"undefined\") {\n          item.conditional = edge.conditional;\n        }\n        return item;\n      }),\n    };\n  }\n\n  addNode(\n    data: RunnableInterface | RunnableIOSchema,\n    id?: string,\n    // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n    metadata?: Record<string, any>\n  ): Node {\n    if (id !== undefined && this.nodes[id] !== undefined) {\n      throw new Error(`Node with id ${id} already exists`);\n    }\n    const nodeId = id ?? uuidv4();\n    const node: Node = {\n      id: nodeId,\n      data,\n      name: nodeDataStr(id, data),\n      metadata,\n    };\n    this.nodes[nodeId] = node;\n    return node;\n  }\n\n  removeNode(node: Node): void {\n    // Remove the node from the nodes map\n    delete this.nodes[node.id];\n\n    // Filter out edges connected to the node\n    this.edges = this.edges.filter(\n      (edge) => edge.source !== node.id && edge.target !== node.id\n    );\n  }\n\n  addEdge(\n    source: Node,\n    target: Node,\n    data?: string,\n    conditional?: boolean\n  ): Edge {\n    if (this.nodes[source.id] === undefined) {\n      throw new Error(`Source node ${source.id} not in graph`);\n    }\n    if (this.nodes[target.id] === undefined) {\n      throw new Error(`Target node ${target.id} not in graph`);\n    }\n    const edge: Edge = {\n      source: source.id,\n      target: target.id,\n      data,\n      conditional,\n    };\n    this.edges.push(edge);\n    return edge;\n  }\n\n  firstNode(): Node | undefined {\n    return _firstNode(this);\n  }\n\n  lastNode(): Node | undefined {\n    return _lastNode(this);\n  }\n\n  /**\n   * Add all nodes and edges from another graph.\n   * Note this doesn't check for duplicates, nor does it connect the graphs.\n   */\n  extend(graph: Graph, prefix = \"\") {\n    let finalPrefix = prefix;\n    const nodeIds = Object.values(graph.nodes).map((node) => node.id);\n    if (nodeIds.every(isUuid)) {\n      finalPrefix = \"\";\n    }\n\n    const prefixed = (id: string) => {\n      return finalPrefix ? `${finalPrefix}:${id}` : id;\n    };\n\n    Object.entries(graph.nodes).forEach(([key, value]) => {\n      this.nodes[prefixed(key)] = { ...value, id: prefixed(key) };\n    });\n\n    const newEdges = graph.edges.map((edge) => {\n      return {\n        ...edge,\n        source: prefixed(edge.source),\n        target: prefixed(edge.target),\n      };\n    });\n    // Add all edges from the other graph\n    this.edges = [...this.edges, ...newEdges];\n    const first = graph.firstNode();\n    const last = graph.lastNode();\n    return [\n      first ? { id: prefixed(first.id), data: first.data } : undefined,\n      last ? { id: prefixed(last.id), data: last.data } : undefined,\n    ];\n  }\n\n  trimFirstNode(): void {\n    const firstNode = this.firstNode();\n    if (firstNode && _firstNode(this, [firstNode.id])) {\n      this.removeNode(firstNode);\n    }\n  }\n\n  trimLastNode(): void {\n    const lastNode = this.lastNode();\n    if (lastNode && _lastNode(this, [lastNode.id])) {\n      this.removeNode(lastNode);\n    }\n  }\n\n  /**\n   * Return a new graph with all nodes re-identified,\n   * using their unique, readable names where possible.\n   */\n  reid(): Graph {\n    const nodeLabels: Record<string, string> = Object.fromEntries(\n      Object.values(this.nodes).map((node) => [node.id, node.name])\n    );\n    const nodeLabelCounts = new Map<string, number>();\n    Object.values(nodeLabels).forEach((label) => {\n      nodeLabelCounts.set(label, (nodeLabelCounts.get(label) || 0) + 1);\n    });\n\n    const getNodeId = (nodeId: string): string => {\n      const label = nodeLabels[nodeId];\n      if (isUuid(nodeId) && nodeLabelCounts.get(label) === 1) {\n        return label;\n      } else {\n        return nodeId;\n      }\n    };\n\n    return new Graph({\n      nodes: Object.fromEntries(\n        Object.entries(this.nodes).map(([id, node]) => [\n          getNodeId(id),\n          { ...node, id: getNodeId(id) },\n        ])\n      ),\n      edges: this.edges.map((edge) => ({\n        ...edge,\n        source: getNodeId(edge.source),\n        target: getNodeId(edge.target),\n      })),\n    });\n  }\n\n  drawMermaid(params?: {\n    withStyles?: boolean;\n    curveStyle?: string;\n    nodeColors?: Record<string, string>;\n    wrapLabelNWords?: number;\n  }): string {\n    const {\n      withStyles,\n      curveStyle,\n      nodeColors = {\n        default: \"fill:#f2f0ff,line-height:1.2\",\n        first: \"fill-opacity:0\",\n        last: \"fill:#bfb6fc\",\n      },\n      wrapLabelNWords,\n    } = params ?? {};\n    const graph = this.reid();\n    const firstNode = graph.firstNode();\n\n    const lastNode = graph.lastNode();\n\n    return drawMermaid(graph.nodes, graph.edges, {\n      firstNode: firstNode?.id,\n      lastNode: lastNode?.id,\n      withStyles,\n      curveStyle,\n      nodeColors,\n      wrapLabelNWords,\n    });\n  }\n\n  async drawMermaidPng(params?: {\n    withStyles?: boolean;\n    curveStyle?: string;\n    nodeColors?: Record<string, string>;\n    wrapLabelNWords?: number;\n    backgroundColor?: string;\n  }): Promise<Blob> {\n    const mermaidSyntax = this.drawMermaid(params);\n    return drawMermaidImage(mermaidSyntax, {\n      backgroundColor: params?.backgroundColor,\n    });\n  }\n}\n/**\n * Find the single node that is not a target of any edge.\n * Exclude nodes/sources with ids in the exclude list.\n * If there is no such node, or there are multiple, return undefined.\n * When drawing the graph, this node would be the origin.\n */\nfunction _firstNode(graph: Graph, exclude: string[] = []): Node | undefined {\n  const targets = new Set(\n    graph.edges\n      .filter((edge) => !exclude.includes(edge.source))\n      .map((edge) => edge.target)\n  );\n\n  const found: Node[] = [];\n  for (const node of Object.values(graph.nodes)) {\n    if (!exclude.includes(node.id) && !targets.has(node.id)) {\n      found.push(node);\n    }\n  }\n  return found.length === 1 ? found[0] : undefined;\n}\n\n/**\n * Find the single node that is not a source of any edge.\n * Exclude nodes/targets with ids in the exclude list.\n * If there is no such node, or there are multiple, return undefined.\n * When drawing the graph, this node would be the destination.\n */\nfunction _lastNode(graph: Graph, exclude: string[] = []): Node | undefined {\n  const sources = new Set(\n    graph.edges\n      .filter((edge) => !exclude.includes(edge.target))\n      .map((edge) => edge.source)\n  );\n\n  const found: Node[] = [];\n  for (const node of Object.values(graph.nodes)) {\n    if (!exclude.includes(node.id) && !sources.has(node.id)) {\n      found.push(node);\n    }\n  }\n  return found.length === 1 ? found[0] : undefined;\n}\n"],"mappings":";;;;;;;;AAaA,SAAS,YACP,IACA,MACQ;CACR,IAAI,OAAO,KAAA,KAAa,CAACA,yBAAAA,SAAO,EAAE,GAChC,OAAO;MACF,IAAIC,cAAAA,oBAAoB,IAAI,GACjC,IAAI;EACF,IAAI,UAAU,KAAK,QAAQ;EAC3B,UAAU,QAAQ,WAAW,UAAU,IACnC,QAAQ,MAAM,CAAiB,IAC/B;EACJ,OAAO;CACT,QAAQ;EACN,OAAO,KAAK,QAAQ;CACtB;MAEA,OAAO,KAAK,QAAQ;AAExB;AAEA,SAAS,aAAa,MAAY;CAEhC,IAAIA,cAAAA,oBAAoB,KAAK,IAAI,GAC/B,OAAO;EACL,MAAM;EACN,MAAM;GACJ,IAAI,KAAK,KAAK;GACd,MAAM,KAAK,KAAK,QAAQ;EAC1B;CACF;MAEA,OAAO;EACL,MAAM;EACN,MAAM;GAAE,GAAGC,0BAAAA,aAAa,KAAK,KAAK,MAAM;GAAG,OAAO,KAAK,KAAK;EAAK;CACnE;AAEJ;AAEA,IAAa,QAAb,MAAa,MAAM;CACjB,QAA8B,CAAC;CAE/B,QAAgB,CAAC;CAEjB,YAAY,QAAyD;EACnE,KAAK,QAAQ,QAAQ,SAAS,KAAK;EACnC,KAAK,QAAQ,QAAQ,SAAS,KAAK;CACrC;CAIA,SAA8B;EAC5B,MAAM,gBAAiD,CAAC;EACxD,OAAO,OAAO,KAAK,KAAK,CAAC,CAAC,SAAS,MAAM,MAAM;GAC7C,cAAc,KAAK,MAAMF,yBAAAA,SAAO,KAAK,EAAE,IAAI,IAAI,KAAK;EACtD,CAAC;EAED,OAAO;GACL,OAAO,OAAO,OAAO,KAAK,KAAK,CAAC,CAAC,KAAK,UAAU;IAC9C,IAAI,cAAc,KAAK;IACvB,GAAG,aAAa,IAAI;GACtB,EAAE;GACF,OAAO,KAAK,MAAM,KAAK,SAAS;IAC9B,MAAM,OAAgC;KACpC,QAAQ,cAAc,KAAK;KAC3B,QAAQ,cAAc,KAAK;IAC7B;IAEA,IAAI,OAAO,KAAK,SAAS,aACvB,KAAK,OAAO,KAAK;IAGnB,IAAI,OAAO,KAAK,gBAAgB,aAC9B,KAAK,cAAc,KAAK;IAE1B,OAAO;GACT,CAAC;EACH;CACF;CAEA,QACE,MACA,IAEA,UACM;EACN,IAAI,OAAO,KAAA,KAAa,KAAK,MAAM,QAAQ,KAAA,GACzC,MAAM,IAAI,MAAM,gBAAgB,GAAG,gBAAgB;EAErD,MAAM,SAAS,MAAMG,yBAAAA,GAAO;EAC5B,MAAM,OAAa;GACjB,IAAI;GACJ;GACA,MAAM,YAAY,IAAI,IAAI;GAC1B;EACF;EACA,KAAK,MAAM,UAAU;EACrB,OAAO;CACT;CAEA,WAAW,MAAkB;EAE3B,OAAO,KAAK,MAAM,KAAK;EAGvB,KAAK,QAAQ,KAAK,MAAM,QACrB,SAAS,KAAK,WAAW,KAAK,MAAM,KAAK,WAAW,KAAK,EAC5D;CACF;CAEA,QACE,QACA,QACA,MACA,aACM;EACN,IAAI,KAAK,MAAM,OAAO,QAAQ,KAAA,GAC5B,MAAM,IAAI,MAAM,eAAe,OAAO,GAAG,cAAc;EAEzD,IAAI,KAAK,MAAM,OAAO,QAAQ,KAAA,GAC5B,MAAM,IAAI,MAAM,eAAe,OAAO,GAAG,cAAc;EAEzD,MAAM,OAAa;GACjB,QAAQ,OAAO;GACf,QAAQ,OAAO;GACf;GACA;EACF;EACA,KAAK,MAAM,KAAK,IAAI;EACpB,OAAO;CACT;CAEA,YAA8B;EAC5B,OAAO,WAAW,IAAI;CACxB;CAEA,WAA6B;EAC3B,OAAO,UAAU,IAAI;CACvB;;;;;CAMA,OAAO,OAAc,SAAS,IAAI;EAChC,IAAI,cAAc;EAElB,IADgB,OAAO,OAAO,MAAM,KAAK,CAAC,CAAC,KAAK,SAAS,KAAK,EACpD,CAAC,CAAC,MAAMH,yBAAAA,QAAM,GACtB,cAAc;EAGhB,MAAM,YAAY,OAAe;GAC/B,OAAO,cAAc,GAAG,YAAY,GAAG,OAAO;EAChD;EAEA,OAAO,QAAQ,MAAM,KAAK,CAAC,CAAC,SAAS,CAAC,KAAK,WAAW;GACpD,KAAK,MAAM,SAAS,GAAG,KAAK;IAAE,GAAG;IAAO,IAAI,SAAS,GAAG;GAAE;EAC5D,CAAC;EAED,MAAM,WAAW,MAAM,MAAM,KAAK,SAAS;GACzC,OAAO;IACL,GAAG;IACH,QAAQ,SAAS,KAAK,MAAM;IAC5B,QAAQ,SAAS,KAAK,MAAM;GAC9B;EACF,CAAC;EAED,KAAK,QAAQ,CAAC,GAAG,KAAK,OAAO,GAAG,QAAQ;EACxC,MAAM,QAAQ,MAAM,UAAU;EAC9B,MAAM,OAAO,MAAM,SAAS;EAC5B,OAAO,CACL,QAAQ;GAAE,IAAI,SAAS,MAAM,EAAE;GAAG,MAAM,MAAM;EAAK,IAAI,KAAA,GACvD,OAAO;GAAE,IAAI,SAAS,KAAK,EAAE;GAAG,MAAM,KAAK;EAAK,IAAI,KAAA,CACtD;CACF;CAEA,gBAAsB;EACpB,MAAM,YAAY,KAAK,UAAU;EACjC,IAAI,aAAa,WAAW,MAAM,CAAC,UAAU,EAAE,CAAC,GAC9C,KAAK,WAAW,SAAS;CAE7B;CAEA,eAAqB;EACnB,MAAM,WAAW,KAAK,SAAS;EAC/B,IAAI,YAAY,UAAU,MAAM,CAAC,SAAS,EAAE,CAAC,GAC3C,KAAK,WAAW,QAAQ;CAE5B;;;;;CAMA,OAAc;EACZ,MAAM,aAAqC,OAAO,YAChD,OAAO,OAAO,KAAK,KAAK,CAAC,CAAC,KAAK,SAAS,CAAC,KAAK,IAAI,KAAK,IAAI,CAAC,CAC9D;EACA,MAAM,kCAAkB,IAAI,IAAoB;EAChD,OAAO,OAAO,UAAU,CAAC,CAAC,SAAS,UAAU;GAC3C,gBAAgB,IAAI,QAAQ,gBAAgB,IAAI,KAAK,KAAK,KAAK,CAAC;EAClE,CAAC;EAED,MAAM,aAAa,WAA2B;GAC5C,MAAM,QAAQ,WAAW;GACzB,IAAIA,yBAAAA,SAAO,MAAM,KAAK,gBAAgB,IAAI,KAAK,MAAM,GACnD,OAAO;QAEP,OAAO;EAEX;EAEA,OAAO,IAAI,MAAM;GACf,OAAO,OAAO,YACZ,OAAO,QAAQ,KAAK,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,UAAU,CAC7C,UAAU,EAAE,GACZ;IAAE,GAAG;IAAM,IAAI,UAAU,EAAE;GAAE,CAC/B,CAAC,CACH;GACA,OAAO,KAAK,MAAM,KAAK,UAAU;IAC/B,GAAG;IACH,QAAQ,UAAU,KAAK,MAAM;IAC7B,QAAQ,UAAU,KAAK,MAAM;GAC/B,EAAE;EACJ,CAAC;CACH;CAEA,YAAY,QAKD;EACT,MAAM,EACJ,YACA,YACA,aAAa;GACX,SAAS;GACT,OAAO;GACP,MAAM;EACR,GACA,oBACE,UAAU,CAAC;EACf,MAAM,QAAQ,KAAK,KAAK;EACxB,MAAM,YAAY,MAAM,UAAU;EAElC,MAAM,WAAW,MAAM,SAAS;EAEhC,OAAOI,sBAAAA,YAAY,MAAM,OAAO,MAAM,OAAO;GAC3C,WAAW,WAAW;GACtB,UAAU,UAAU;GACpB;GACA;GACA;GACA;EACF,CAAC;CACH;CAEA,MAAM,eAAe,QAMH;EAChB,MAAM,gBAAgB,KAAK,YAAY,MAAM;EAC7C,OAAOC,sBAAAA,iBAAiB,eAAe,EACrC,iBAAiB,QAAQ,gBAC3B,CAAC;CACH;AACF;;;;;;;AAOA,SAAS,WAAW,OAAc,UAAoB,CAAC,GAAqB;CAC1E,MAAM,UAAU,IAAI,IAClB,MAAM,MACH,QAAQ,SAAS,CAAC,QAAQ,SAAS,KAAK,MAAM,CAAC,CAAC,CAChD,KAAK,SAAS,KAAK,MAAM,CAC9B;CAEA,MAAM,QAAgB,CAAC;CACvB,KAAK,MAAM,QAAQ,OAAO,OAAO,MAAM,KAAK,GAC1C,IAAI,CAAC,QAAQ,SAAS,KAAK,EAAE,KAAK,CAAC,QAAQ,IAAI,KAAK,EAAE,GACpD,MAAM,KAAK,IAAI;CAGnB,OAAO,MAAM,WAAW,IAAI,MAAM,KAAK,KAAA;AACzC;;;;;;;AAQA,SAAS,UAAU,OAAc,UAAoB,CAAC,GAAqB;CACzE,MAAM,UAAU,IAAI,IAClB,MAAM,MACH,QAAQ,SAAS,CAAC,QAAQ,SAAS,KAAK,MAAM,CAAC,CAAC,CAChD,KAAK,SAAS,KAAK,MAAM,CAC9B;CAEA,MAAM,QAAgB,CAAC;CACvB,KAAK,MAAM,QAAQ,OAAO,OAAO,MAAM,KAAK,GAC1C,IAAI,CAAC,QAAQ,SAAS,KAAK,EAAE,KAAK,CAAC,QAAQ,IAAI,KAAK,EAAE,GACpD,MAAM,KAAK,IAAI;CAGnB,OAAO,MAAM,WAAW,IAAI,MAAM,KAAK,KAAA;AACzC"}
+{"version":3,"file":"graph.cjs","names":["isUuid","isRunnableInterface","toJsonSchema","uuidv4","drawMermaid","drawMermaidImage"],"sources":["../../src/runnables/graph.ts"],"sourcesContent":["import { v4 as uuidv4, validate as isUuid } from \"../utils/uuid/index.js\";\nimport type {\n  RunnableInterface,\n  RunnableIOSchema,\n  Node,\n  Edge,\n} from \"./types.js\";\nimport { isRunnableInterface } from \"./utils.js\";\nimport { drawMermaid, drawMermaidImage } from \"./graph_mermaid.js\";\nimport { toJsonSchema } from \"../utils/json_schema.js\";\n\nexport { Node, Edge };\n\nfunction nodeDataStr(\n  id: string | undefined,\n  data: RunnableInterface | RunnableIOSchema\n): string {\n  if (id !== undefined && !isUuid(id)) {\n    return id;\n  } else if (isRunnableInterface(data)) {\n    try {\n      let dataStr = data.getName();\n      dataStr = dataStr.startsWith(\"Runnable\")\n        ? dataStr.slice(\"Runnable\".length)\n        : dataStr;\n      return dataStr;\n    } catch {\n      return data.getName();\n    }\n  } else {\n    return data.name ?? \"UnknownSchema\";\n  }\n}\n\nfunction nodeDataJson(node: Node) {\n  // if node.data implements Runnable\n  if (isRunnableInterface(node.data)) {\n    return {\n      type: \"runnable\",\n      data: {\n        id: node.data.lc_id,\n        name: node.data.getName(),\n      },\n    };\n  } else {\n    return {\n      type: \"schema\",\n      data: { ...toJsonSchema(node.data.schema), title: node.data.name },\n    };\n  }\n}\n\nexport class Graph {\n  nodes: Record<string, Node> = {};\n\n  edges: Edge[] = [];\n\n  constructor(params?: { nodes: Record<string, Node>; edges: Edge[] }) {\n    this.nodes = params?.nodes ?? this.nodes;\n    this.edges = params?.edges ?? this.edges;\n  }\n\n  // Convert the graph to a JSON-serializable format.\n  // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n  toJSON(): Record<string, any> {\n    const stableNodeIds: Record<string, string | number> = {};\n    Object.values(this.nodes).forEach((node, i) => {\n      stableNodeIds[node.id] = isUuid(node.id) ? i : node.id;\n    });\n\n    return {\n      nodes: Object.values(this.nodes).map((node) => ({\n        id: stableNodeIds[node.id],\n        ...nodeDataJson(node),\n        ...(node.metadata != null ? { metadata: node.metadata } : {}),\n      })),\n      edges: this.edges.map((edge) => {\n        const item: Record<string, unknown> = {\n          source: stableNodeIds[edge.source],\n          target: stableNodeIds[edge.target],\n        };\n\n        if (typeof edge.data !== \"undefined\") {\n          item.data = edge.data;\n        }\n\n        if (typeof edge.conditional !== \"undefined\") {\n          item.conditional = edge.conditional;\n        }\n        return item;\n      }),\n    };\n  }\n\n  addNode(\n    data: RunnableInterface | RunnableIOSchema,\n    id?: string,\n    // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n    metadata?: Record<string, any>\n  ): Node {\n    if (id !== undefined && this.nodes[id] !== undefined) {\n      throw new Error(`Node with id ${id} already exists`);\n    }\n    const nodeId = id ?? uuidv4();\n    const node: Node = {\n      id: nodeId,\n      data,\n      name: nodeDataStr(id, data),\n      metadata,\n    };\n    this.nodes[nodeId] = node;\n    return node;\n  }\n\n  removeNode(node: Node): void {\n    // Remove the node from the nodes map\n    delete this.nodes[node.id];\n\n    // Filter out edges connected to the node\n    this.edges = this.edges.filter(\n      (edge) => edge.source !== node.id && edge.target !== node.id\n    );\n  }\n\n  addEdge(\n    source: Node,\n    target: Node,\n    data?: string,\n    conditional?: boolean\n  ): Edge {\n    if (this.nodes[source.id] === undefined) {\n      throw new Error(`Source node ${source.id} not in graph`);\n    }\n    if (this.nodes[target.id] === undefined) {\n      throw new Error(`Target node ${target.id} not in graph`);\n    }\n    const edge: Edge = {\n      source: source.id,\n      target: target.id,\n      data,\n      conditional,\n    };\n    this.edges.push(edge);\n    return edge;\n  }\n\n  firstNode(): Node | undefined {\n    return _firstNode(this);\n  }\n\n  lastNode(): Node | undefined {\n    return _lastNode(this);\n  }\n\n  /**\n   * Add all nodes and edges from another graph.\n   * Note this doesn't check for duplicates, nor does it connect the graphs.\n   */\n  extend(graph: Graph, prefix = \"\") {\n    let finalPrefix = prefix;\n    const nodeIds = Object.values(graph.nodes).map((node) => node.id);\n    if (nodeIds.every(isUuid)) {\n      finalPrefix = \"\";\n    }\n\n    const prefixed = (id: string) => {\n      return finalPrefix ? `${finalPrefix}:${id}` : id;\n    };\n\n    Object.entries(graph.nodes).forEach(([key, value]) => {\n      this.nodes[prefixed(key)] = { ...value, id: prefixed(key) };\n    });\n\n    const newEdges = graph.edges.map((edge) => {\n      return {\n        ...edge,\n        source: prefixed(edge.source),\n        target: prefixed(edge.target),\n      };\n    });\n    // Add all edges from the other graph\n    this.edges = [...this.edges, ...newEdges];\n    const first = graph.firstNode();\n    const last = graph.lastNode();\n    return [\n      first ? { id: prefixed(first.id), data: first.data } : undefined,\n      last ? { id: prefixed(last.id), data: last.data } : undefined,\n    ];\n  }\n\n  trimFirstNode(): void {\n    const firstNode = this.firstNode();\n    if (firstNode && _firstNode(this, [firstNode.id])) {\n      this.removeNode(firstNode);\n    }\n  }\n\n  trimLastNode(): void {\n    const lastNode = this.lastNode();\n    if (lastNode && _lastNode(this, [lastNode.id])) {\n      this.removeNode(lastNode);\n    }\n  }\n\n  /**\n   * Return a new graph with all nodes re-identified,\n   * using their unique, readable names where possible.\n   */\n  reid(): Graph {\n    const nodeLabels: Record<string, string> = Object.fromEntries(\n      Object.values(this.nodes).map((node) => [node.id, node.name])\n    );\n    const nodeLabelCounts = new Map<string, number>();\n    Object.values(nodeLabels).forEach((label) => {\n      nodeLabelCounts.set(label, (nodeLabelCounts.get(label) || 0) + 1);\n    });\n\n    const getNodeId = (nodeId: string): string => {\n      const label = nodeLabels[nodeId];\n      if (isUuid(nodeId) && nodeLabelCounts.get(label) === 1) {\n        return label;\n      } else {\n        return nodeId;\n      }\n    };\n\n    return new Graph({\n      nodes: Object.fromEntries(\n        Object.entries(this.nodes).map(([id, node]) => [\n          getNodeId(id),\n          { ...node, id: getNodeId(id) },\n        ])\n      ),\n      edges: this.edges.map((edge) => ({\n        ...edge,\n        source: getNodeId(edge.source),\n        target: getNodeId(edge.target),\n      })),\n    });\n  }\n\n  drawMermaid(params?: {\n    withStyles?: boolean;\n    curveStyle?: string;\n    nodeColors?: Record<string, string>;\n    wrapLabelNWords?: number;\n  }): string {\n    const {\n      withStyles,\n      curveStyle,\n      nodeColors = {\n        default: \"fill:#f2f0ff,line-height:1.2\",\n        first: \"fill-opacity:0\",\n        last: \"fill:#bfb6fc\",\n      },\n      wrapLabelNWords,\n    } = params ?? {};\n    const graph = this.reid();\n    const firstNode = graph.firstNode();\n\n    const lastNode = graph.lastNode();\n\n    return drawMermaid(graph.nodes, graph.edges, {\n      firstNode: firstNode?.id,\n      lastNode: lastNode?.id,\n      withStyles,\n      curveStyle,\n      nodeColors,\n      wrapLabelNWords,\n    });\n  }\n\n  async drawMermaidPng(params?: {\n    withStyles?: boolean;\n    curveStyle?: string;\n    nodeColors?: Record<string, string>;\n    wrapLabelNWords?: number;\n    backgroundColor?: string;\n  }): Promise<Blob> {\n    const mermaidSyntax = this.drawMermaid(params);\n    return drawMermaidImage(mermaidSyntax, {\n      backgroundColor: params?.backgroundColor,\n    });\n  }\n}\n/**\n * Find the single node that is not a target of any edge.\n * Exclude nodes/sources with ids in the exclude list.\n * If there is no such node, or there are multiple, return undefined.\n * When drawing the graph, this node would be the origin.\n */\nfunction _firstNode(graph: Graph, exclude: string[] = []): Node | undefined {\n  const targets = new Set(\n    graph.edges\n      .filter((edge) => !exclude.includes(edge.source))\n      .map((edge) => edge.target)\n  );\n\n  const found: Node[] = [];\n  for (const node of Object.values(graph.nodes)) {\n    if (!exclude.includes(node.id) && !targets.has(node.id)) {\n      found.push(node);\n    }\n  }\n  return found.length === 1 ? found[0] : undefined;\n}\n\n/**\n * Find the single node that is not a source of any edge.\n * Exclude nodes/targets with ids in the exclude list.\n * If there is no such node, or there are multiple, return undefined.\n * When drawing the graph, this node would be the destination.\n */\nfunction _lastNode(graph: Graph, exclude: string[] = []): Node | undefined {\n  const sources = new Set(\n    graph.edges\n      .filter((edge) => !exclude.includes(edge.target))\n      .map((edge) => edge.source)\n  );\n\n  const found: Node[] = [];\n  for (const node of Object.values(graph.nodes)) {\n    if (!exclude.includes(node.id) && !sources.has(node.id)) {\n      found.push(node);\n    }\n  }\n  return found.length === 1 ? found[0] : undefined;\n}\n"],"mappings":";;;;;;;;AAaA,SAAS,YACP,IACA,MACQ;CACR,IAAI,OAAO,KAAA,KAAa,CAACA,yBAAAA,SAAO,EAAE,GAChC,OAAO;MACF,IAAIC,cAAAA,oBAAoB,IAAI,GACjC,IAAI;EACF,IAAI,UAAU,KAAK,QAAQ;EAC3B,UAAU,QAAQ,WAAW,UAAU,IACnC,QAAQ,MAAM,CAAiB,IAC/B;EACJ,OAAO;CACT,QAAQ;EACN,OAAO,KAAK,QAAQ;CACtB;MAEA,OAAO,KAAK,QAAQ;AAExB;AAEA,SAAS,aAAa,MAAY;CAEhC,IAAIA,cAAAA,oBAAoB,KAAK,IAAI,GAC/B,OAAO;EACL,MAAM;EACN,MAAM;GACJ,IAAI,KAAK,KAAK;GACd,MAAM,KAAK,KAAK,QAAQ;EAC1B;CACF;MAEA,OAAO;EACL,MAAM;EACN,MAAM;GAAE,GAAGC,0BAAAA,aAAa,KAAK,KAAK,MAAM;GAAG,OAAO,KAAK,KAAK;EAAK;CACnE;AAEJ;AAEA,IAAa,QAAb,MAAa,MAAM;CACjB,QAA8B,CAAC;CAE/B,QAAgB,CAAC;CAEjB,YAAY,QAAyD;EACnE,KAAK,QAAQ,QAAQ,SAAS,KAAK;EACnC,KAAK,QAAQ,QAAQ,SAAS,KAAK;CACrC;CAIA,SAA8B;EAC5B,MAAM,gBAAiD,CAAC;EACxD,OAAO,OAAO,KAAK,KAAK,CAAC,CAAC,SAAS,MAAM,MAAM;GAC7C,cAAc,KAAK,MAAMF,yBAAAA,SAAO,KAAK,EAAE,IAAI,IAAI,KAAK;EACtD,CAAC;EAED,OAAO;GACL,OAAO,OAAO,OAAO,KAAK,KAAK,CAAC,CAAC,KAAK,UAAU;IAC9C,IAAI,cAAc,KAAK;IACvB,GAAG,aAAa,IAAI;IACpB,GAAI,KAAK,YAAY,OAAO,EAAE,UAAU,KAAK,SAAS,IAAI,CAAC;GAC7D,EAAE;GACF,OAAO,KAAK,MAAM,KAAK,SAAS;IAC9B,MAAM,OAAgC;KACpC,QAAQ,cAAc,KAAK;KAC3B,QAAQ,cAAc,KAAK;IAC7B;IAEA,IAAI,OAAO,KAAK,SAAS,aACvB,KAAK,OAAO,KAAK;IAGnB,IAAI,OAAO,KAAK,gBAAgB,aAC9B,KAAK,cAAc,KAAK;IAE1B,OAAO;GACT,CAAC;EACH;CACF;CAEA,QACE,MACA,IAEA,UACM;EACN,IAAI,OAAO,KAAA,KAAa,KAAK,MAAM,QAAQ,KAAA,GACzC,MAAM,IAAI,MAAM,gBAAgB,GAAG,gBAAgB;EAErD,MAAM,SAAS,MAAMG,yBAAAA,GAAO;EAC5B,MAAM,OAAa;GACjB,IAAI;GACJ;GACA,MAAM,YAAY,IAAI,IAAI;GAC1B;EACF;EACA,KAAK,MAAM,UAAU;EACrB,OAAO;CACT;CAEA,WAAW,MAAkB;EAE3B,OAAO,KAAK,MAAM,KAAK;EAGvB,KAAK,QAAQ,KAAK,MAAM,QACrB,SAAS,KAAK,WAAW,KAAK,MAAM,KAAK,WAAW,KAAK,EAC5D;CACF;CAEA,QACE,QACA,QACA,MACA,aACM;EACN,IAAI,KAAK,MAAM,OAAO,QAAQ,KAAA,GAC5B,MAAM,IAAI,MAAM,eAAe,OAAO,GAAG,cAAc;EAEzD,IAAI,KAAK,MAAM,OAAO,QAAQ,KAAA,GAC5B,MAAM,IAAI,MAAM,eAAe,OAAO,GAAG,cAAc;EAEzD,MAAM,OAAa;GACjB,QAAQ,OAAO;GACf,QAAQ,OAAO;GACf;GACA;EACF;EACA,KAAK,MAAM,KAAK,IAAI;EACpB,OAAO;CACT;CAEA,YAA8B;EAC5B,OAAO,WAAW,IAAI;CACxB;CAEA,WAA6B;EAC3B,OAAO,UAAU,IAAI;CACvB;;;;;CAMA,OAAO,OAAc,SAAS,IAAI;EAChC,IAAI,cAAc;EAElB,IADgB,OAAO,OAAO,MAAM,KAAK,CAAC,CAAC,KAAK,SAAS,KAAK,EACpD,CAAC,CAAC,MAAMH,yBAAAA,QAAM,GACtB,cAAc;EAGhB,MAAM,YAAY,OAAe;GAC/B,OAAO,cAAc,GAAG,YAAY,GAAG,OAAO;EAChD;EAEA,OAAO,QAAQ,MAAM,KAAK,CAAC,CAAC,SAAS,CAAC,KAAK,WAAW;GACpD,KAAK,MAAM,SAAS,GAAG,KAAK;IAAE,GAAG;IAAO,IAAI,SAAS,GAAG;GAAE;EAC5D,CAAC;EAED,MAAM,WAAW,MAAM,MAAM,KAAK,SAAS;GACzC,OAAO;IACL,GAAG;IACH,QAAQ,SAAS,KAAK,MAAM;IAC5B,QAAQ,SAAS,KAAK,MAAM;GAC9B;EACF,CAAC;EAED,KAAK,QAAQ,CAAC,GAAG,KAAK,OAAO,GAAG,QAAQ;EACxC,MAAM,QAAQ,MAAM,UAAU;EAC9B,MAAM,OAAO,MAAM,SAAS;EAC5B,OAAO,CACL,QAAQ;GAAE,IAAI,SAAS,MAAM,EAAE;GAAG,MAAM,MAAM;EAAK,IAAI,KAAA,GACvD,OAAO;GAAE,IAAI,SAAS,KAAK,EAAE;GAAG,MAAM,KAAK;EAAK,IAAI,KAAA,CACtD;CACF;CAEA,gBAAsB;EACpB,MAAM,YAAY,KAAK,UAAU;EACjC,IAAI,aAAa,WAAW,MAAM,CAAC,UAAU,EAAE,CAAC,GAC9C,KAAK,WAAW,SAAS;CAE7B;CAEA,eAAqB;EACnB,MAAM,WAAW,KAAK,SAAS;EAC/B,IAAI,YAAY,UAAU,MAAM,CAAC,SAAS,EAAE,CAAC,GAC3C,KAAK,WAAW,QAAQ;CAE5B;;;;;CAMA,OAAc;EACZ,MAAM,aAAqC,OAAO,YAChD,OAAO,OAAO,KAAK,KAAK,CAAC,CAAC,KAAK,SAAS,CAAC,KAAK,IAAI,KAAK,IAAI,CAAC,CAC9D;EACA,MAAM,kCAAkB,IAAI,IAAoB;EAChD,OAAO,OAAO,UAAU,CAAC,CAAC,SAAS,UAAU;GAC3C,gBAAgB,IAAI,QAAQ,gBAAgB,IAAI,KAAK,KAAK,KAAK,CAAC;EAClE,CAAC;EAED,MAAM,aAAa,WAA2B;GAC5C,MAAM,QAAQ,WAAW;GACzB,IAAIA,yBAAAA,SAAO,MAAM,KAAK,gBAAgB,IAAI,KAAK,MAAM,GACnD,OAAO;QAEP,OAAO;EAEX;EAEA,OAAO,IAAI,MAAM;GACf,OAAO,OAAO,YACZ,OAAO,QAAQ,KAAK,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,UAAU,CAC7C,UAAU,EAAE,GACZ;IAAE,GAAG;IAAM,IAAI,UAAU,EAAE;GAAE,CAC/B,CAAC,CACH;GACA,OAAO,KAAK,MAAM,KAAK,UAAU;IAC/B,GAAG;IACH,QAAQ,UAAU,KAAK,MAAM;IAC7B,QAAQ,UAAU,KAAK,MAAM;GAC/B,EAAE;EACJ,CAAC;CACH;CAEA,YAAY,QAKD;EACT,MAAM,EACJ,YACA,YACA,aAAa;GACX,SAAS;GACT,OAAO;GACP,MAAM;EACR,GACA,oBACE,UAAU,CAAC;EACf,MAAM,QAAQ,KAAK,KAAK;EACxB,MAAM,YAAY,MAAM,UAAU;EAElC,MAAM,WAAW,MAAM,SAAS;EAEhC,OAAOI,sBAAAA,YAAY,MAAM,OAAO,MAAM,OAAO;GAC3C,WAAW,WAAW;GACtB,UAAU,UAAU;GACpB;GACA;GACA;GACA;EACF,CAAC;CACH;CAEA,MAAM,eAAe,QAMH;EAChB,MAAM,gBAAgB,KAAK,YAAY,MAAM;EAC7C,OAAOC,sBAAAA,iBAAiB,eAAe,EACrC,iBAAiB,QAAQ,gBAC3B,CAAC;CACH;AACF;;;;;;;AAOA,SAAS,WAAW,OAAc,UAAoB,CAAC,GAAqB;CAC1E,MAAM,UAAU,IAAI,IAClB,MAAM,MACH,QAAQ,SAAS,CAAC,QAAQ,SAAS,KAAK,MAAM,CAAC,CAAC,CAChD,KAAK,SAAS,KAAK,MAAM,CAC9B;CAEA,MAAM,QAAgB,CAAC;CACvB,KAAK,MAAM,QAAQ,OAAO,OAAO,MAAM,KAAK,GAC1C,IAAI,CAAC,QAAQ,SAAS,KAAK,EAAE,KAAK,CAAC,QAAQ,IAAI,KAAK,EAAE,GACpD,MAAM,KAAK,IAAI;CAGnB,OAAO,MAAM,WAAW,IAAI,MAAM,KAAK,KAAA;AACzC;;;;;;;AAQA,SAAS,UAAU,OAAc,UAAoB,CAAC,GAAqB;CACzE,MAAM,UAAU,IAAI,IAClB,MAAM,MACH,QAAQ,SAAS,CAAC,QAAQ,SAAS,KAAK,MAAM,CAAC,CAAC,CAChD,KAAK,SAAS,KAAK,MAAM,CAC9B;CAEA,MAAM,QAAgB,CAAC;CACvB,KAAK,MAAM,QAAQ,OAAO,OAAO,MAAM,KAAK,GAC1C,IAAI,CAAC,QAAQ,SAAS,KAAK,EAAE,KAAK,CAAC,QAAQ,IAAI,KAAK,EAAE,GACpD,MAAM,KAAK,IAAI;CAGnB,OAAO,MAAM,WAAW,IAAI,MAAM,KAAK,KAAA;AACzC"}

package/dist/runnables/graph.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"graph.d.cts","names":["_$__types_js0.RunnableConfig"],"sources":["../../src/runnables/graph.ts"],"mappings":";;qBAoDa;EACX,OAAO,eAAe;EAEtB,OAAO;EAEP,YAAY;IAAW,OAAO,eAAe;IAAO,OAAO;;EAO3D,UAAU;EA6BV,QACE,MAAM,oBAAoB,kBAC1B,aAEA,WAAW,sBACV;EAeH,WAAW,MAAM;EAUjB,QACE,QAAQ,MACR,QAAQ,MACR,eACA,wBACC;EAiBH,aAAa;EAIb,YAAY;;;;;EAQZ,OAAO,OAAO,OAAO;;;;EAgCrB;EAOA;;;;;EAWA,QAAQ;EAiCR,YAAY;IACV;IACA;IACA,aAAa;IACb;;EA2BI,eAAe;IACnB;IACA;IACA,aAAa;IACb;IACA;MACE,QAAQ"}
+{"version":3,"file":"graph.d.cts","names":["_$__types_js0.RunnableConfig"],"sources":["../../src/runnables/graph.ts"],"mappings":";;qBAoDa;EACX,OAAO,eAAe;EAEtB,OAAO;EAEP,YAAY;IAAW,OAAO,eAAe;IAAO,OAAO;;EAO3D,UAAU;EA8BV,QACE,MAAM,oBAAoB,kBAC1B,aAEA,WAAW,sBACV;EAeH,WAAW,MAAM;EAUjB,QACE,QAAQ,MACR,QAAQ,MACR,eACA,wBACC;EAiBH,aAAa;EAIb,YAAY;;;;;EAQZ,OAAO,OAAO,OAAO;;;;EAgCrB;EAOA;;;;;EAWA,QAAQ;EAiCR,YAAY;IACV;IACA;IACA,aAAa;IACb;;EA2BI,eAAe;IACnB;IACA;IACA,aAAa;IACb;IACA;MACE,QAAQ"}

package/dist/runnables/graph.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"graph.d.ts","names":["_$__types_js0.RunnableConfig"],"sources":["../../src/runnables/graph.ts"],"mappings":";;qBAoDa;EACX,OAAO,eAAe;EAEtB,OAAO;EAEP,YAAY;IAAW,OAAO,eAAe;IAAO,OAAO;;EAO3D,UAAU;EA6BV,QACE,MAAM,oBAAoB,kBAC1B,aAEA,WAAW,sBACV;EAeH,WAAW,MAAM;EAUjB,QACE,QAAQ,MACR,QAAQ,MACR,eACA,wBACC;EAiBH,aAAa;EAIb,YAAY;;;;;EAQZ,OAAO,OAAO,OAAO;;;;EAgCrB;EAOA;;;;;EAWA,QAAQ;EAiCR,YAAY;IACV;IACA;IACA,aAAa;IACb;;EA2BI,eAAe;IACnB;IACA;IACA,aAAa;IACb;IACA;MACE,QAAQ"}
+{"version":3,"file":"graph.d.ts","names":["_$__types_js0.RunnableConfig"],"sources":["../../src/runnables/graph.ts"],"mappings":";;qBAoDa;EACX,OAAO,eAAe;EAEtB,OAAO;EAEP,YAAY;IAAW,OAAO,eAAe;IAAO,OAAO;;EAO3D,UAAU;EA8BV,QACE,MAAM,oBAAoB,kBAC1B,aAEA,WAAW,sBACV;EAeH,WAAW,MAAM;EAUjB,QACE,QAAQ,MACR,QAAQ,MACR,eACA,wBACC;EAiBH,aAAa;EAIb,YAAY;;;;;EAQZ,OAAO,OAAO,OAAO;;;;EAgCrB;EAOA;;;;;EAWA,QAAQ;EAiCR,YAAY;IACV;IACA;IACA,aAAa;IACb;;EA2BI,eAAe;IACnB;IACA;IACA,aAAa;IACb;IACA;MACE,QAAQ"}

package/dist/runnables/graph.js

@@ -47,7 +47,8 @@ var Graph = class Graph {
 		return {
 			nodes: Object.values(this.nodes).map((node) => ({
 				id: stableNodeIds[node.id],
-				...nodeDataJson(node)
+				...nodeDataJson(node),
+				...node.metadata != null ? { metadata: node.metadata } : {}
 			})),
 			edges: this.edges.map((edge) => {
 				const item = {

package/dist/runnables/graph.js.map

@@ -1 +1 @@
-{"version":3,"file":"graph.js","names":["isUuid","uuidv4"],"sources":["../../src/runnables/graph.ts"],"sourcesContent":["import { v4 as uuidv4, validate as isUuid } from \"../utils/uuid/index.js\";\nimport type {\n  RunnableInterface,\n  RunnableIOSchema,\n  Node,\n  Edge,\n} from \"./types.js\";\nimport { isRunnableInterface } from \"./utils.js\";\nimport { drawMermaid, drawMermaidImage } from \"./graph_mermaid.js\";\nimport { toJsonSchema } from \"../utils/json_schema.js\";\n\nexport { Node, Edge };\n\nfunction nodeDataStr(\n  id: string | undefined,\n  data: RunnableInterface | RunnableIOSchema\n): string {\n  if (id !== undefined && !isUuid(id)) {\n    return id;\n  } else if (isRunnableInterface(data)) {\n    try {\n      let dataStr = data.getName();\n      dataStr = dataStr.startsWith(\"Runnable\")\n        ? dataStr.slice(\"Runnable\".length)\n        : dataStr;\n      return dataStr;\n    } catch {\n      return data.getName();\n    }\n  } else {\n    return data.name ?? \"UnknownSchema\";\n  }\n}\n\nfunction nodeDataJson(node: Node) {\n  // if node.data implements Runnable\n  if (isRunnableInterface(node.data)) {\n    return {\n      type: \"runnable\",\n      data: {\n        id: node.data.lc_id,\n        name: node.data.getName(),\n      },\n    };\n  } else {\n    return {\n      type: \"schema\",\n      data: { ...toJsonSchema(node.data.schema), title: node.data.name },\n    };\n  }\n}\n\nexport class Graph {\n  nodes: Record<string, Node> = {};\n\n  edges: Edge[] = [];\n\n  constructor(params?: { nodes: Record<string, Node>; edges: Edge[] }) {\n    this.nodes = params?.nodes ?? this.nodes;\n    this.edges = params?.edges ?? this.edges;\n  }\n\n  // Convert the graph to a JSON-serializable format.\n  // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n  toJSON(): Record<string, any> {\n    const stableNodeIds: Record<string, string | number> = {};\n    Object.values(this.nodes).forEach((node, i) => {\n      stableNodeIds[node.id] = isUuid(node.id) ? i : node.id;\n    });\n\n    return {\n      nodes: Object.values(this.nodes).map((node) => ({\n        id: stableNodeIds[node.id],\n        ...nodeDataJson(node),\n      })),\n      edges: this.edges.map((edge) => {\n        const item: Record<string, unknown> = {\n          source: stableNodeIds[edge.source],\n          target: stableNodeIds[edge.target],\n        };\n\n        if (typeof edge.data !== \"undefined\") {\n          item.data = edge.data;\n        }\n\n        if (typeof edge.conditional !== \"undefined\") {\n          item.conditional = edge.conditional;\n        }\n        return item;\n      }),\n    };\n  }\n\n  addNode(\n    data: RunnableInterface | RunnableIOSchema,\n    id?: string,\n    // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n    metadata?: Record<string, any>\n  ): Node {\n    if (id !== undefined && this.nodes[id] !== undefined) {\n      throw new Error(`Node with id ${id} already exists`);\n    }\n    const nodeId = id ?? uuidv4();\n    const node: Node = {\n      id: nodeId,\n      data,\n      name: nodeDataStr(id, data),\n      metadata,\n    };\n    this.nodes[nodeId] = node;\n    return node;\n  }\n\n  removeNode(node: Node): void {\n    // Remove the node from the nodes map\n    delete this.nodes[node.id];\n\n    // Filter out edges connected to the node\n    this.edges = this.edges.filter(\n      (edge) => edge.source !== node.id && edge.target !== node.id\n    );\n  }\n\n  addEdge(\n    source: Node,\n    target: Node,\n    data?: string,\n    conditional?: boolean\n  ): Edge {\n    if (this.nodes[source.id] === undefined) {\n      throw new Error(`Source node ${source.id} not in graph`);\n    }\n    if (this.nodes[target.id] === undefined) {\n      throw new Error(`Target node ${target.id} not in graph`);\n    }\n    const edge: Edge = {\n      source: source.id,\n      target: target.id,\n      data,\n      conditional,\n    };\n    this.edges.push(edge);\n    return edge;\n  }\n\n  firstNode(): Node | undefined {\n    return _firstNode(this);\n  }\n\n  lastNode(): Node | undefined {\n    return _lastNode(this);\n  }\n\n  /**\n   * Add all nodes and edges from another graph.\n   * Note this doesn't check for duplicates, nor does it connect the graphs.\n   */\n  extend(graph: Graph, prefix = \"\") {\n    let finalPrefix = prefix;\n    const nodeIds = Object.values(graph.nodes).map((node) => node.id);\n    if (nodeIds.every(isUuid)) {\n      finalPrefix = \"\";\n    }\n\n    const prefixed = (id: string) => {\n      return finalPrefix ? `${finalPrefix}:${id}` : id;\n    };\n\n    Object.entries(graph.nodes).forEach(([key, value]) => {\n      this.nodes[prefixed(key)] = { ...value, id: prefixed(key) };\n    });\n\n    const newEdges = graph.edges.map((edge) => {\n      return {\n        ...edge,\n        source: prefixed(edge.source),\n        target: prefixed(edge.target),\n      };\n    });\n    // Add all edges from the other graph\n    this.edges = [...this.edges, ...newEdges];\n    const first = graph.firstNode();\n    const last = graph.lastNode();\n    return [\n      first ? { id: prefixed(first.id), data: first.data } : undefined,\n      last ? { id: prefixed(last.id), data: last.data } : undefined,\n    ];\n  }\n\n  trimFirstNode(): void {\n    const firstNode = this.firstNode();\n    if (firstNode && _firstNode(this, [firstNode.id])) {\n      this.removeNode(firstNode);\n    }\n  }\n\n  trimLastNode(): void {\n    const lastNode = this.lastNode();\n    if (lastNode && _lastNode(this, [lastNode.id])) {\n      this.removeNode(lastNode);\n    }\n  }\n\n  /**\n   * Return a new graph with all nodes re-identified,\n   * using their unique, readable names where possible.\n   */\n  reid(): Graph {\n    const nodeLabels: Record<string, string> = Object.fromEntries(\n      Object.values(this.nodes).map((node) => [node.id, node.name])\n    );\n    const nodeLabelCounts = new Map<string, number>();\n    Object.values(nodeLabels).forEach((label) => {\n      nodeLabelCounts.set(label, (nodeLabelCounts.get(label) || 0) + 1);\n    });\n\n    const getNodeId = (nodeId: string): string => {\n      const label = nodeLabels[nodeId];\n      if (isUuid(nodeId) && nodeLabelCounts.get(label) === 1) {\n        return label;\n      } else {\n        return nodeId;\n      }\n    };\n\n    return new Graph({\n      nodes: Object.fromEntries(\n        Object.entries(this.nodes).map(([id, node]) => [\n          getNodeId(id),\n          { ...node, id: getNodeId(id) },\n        ])\n      ),\n      edges: this.edges.map((edge) => ({\n        ...edge,\n        source: getNodeId(edge.source),\n        target: getNodeId(edge.target),\n      })),\n    });\n  }\n\n  drawMermaid(params?: {\n    withStyles?: boolean;\n    curveStyle?: string;\n    nodeColors?: Record<string, string>;\n    wrapLabelNWords?: number;\n  }): string {\n    const {\n      withStyles,\n      curveStyle,\n      nodeColors = {\n        default: \"fill:#f2f0ff,line-height:1.2\",\n        first: \"fill-opacity:0\",\n        last: \"fill:#bfb6fc\",\n      },\n      wrapLabelNWords,\n    } = params ?? {};\n    const graph = this.reid();\n    const firstNode = graph.firstNode();\n\n    const lastNode = graph.lastNode();\n\n    return drawMermaid(graph.nodes, graph.edges, {\n      firstNode: firstNode?.id,\n      lastNode: lastNode?.id,\n      withStyles,\n      curveStyle,\n      nodeColors,\n      wrapLabelNWords,\n    });\n  }\n\n  async drawMermaidPng(params?: {\n    withStyles?: boolean;\n    curveStyle?: string;\n    nodeColors?: Record<string, string>;\n    wrapLabelNWords?: number;\n    backgroundColor?: string;\n  }): Promise<Blob> {\n    const mermaidSyntax = this.drawMermaid(params);\n    return drawMermaidImage(mermaidSyntax, {\n      backgroundColor: params?.backgroundColor,\n    });\n  }\n}\n/**\n * Find the single node that is not a target of any edge.\n * Exclude nodes/sources with ids in the exclude list.\n * If there is no such node, or there are multiple, return undefined.\n * When drawing the graph, this node would be the origin.\n */\nfunction _firstNode(graph: Graph, exclude: string[] = []): Node | undefined {\n  const targets = new Set(\n    graph.edges\n      .filter((edge) => !exclude.includes(edge.source))\n      .map((edge) => edge.target)\n  );\n\n  const found: Node[] = [];\n  for (const node of Object.values(graph.nodes)) {\n    if (!exclude.includes(node.id) && !targets.has(node.id)) {\n      found.push(node);\n    }\n  }\n  return found.length === 1 ? found[0] : undefined;\n}\n\n/**\n * Find the single node that is not a source of any edge.\n * Exclude nodes/targets with ids in the exclude list.\n * If there is no such node, or there are multiple, return undefined.\n * When drawing the graph, this node would be the destination.\n */\nfunction _lastNode(graph: Graph, exclude: string[] = []): Node | undefined {\n  const sources = new Set(\n    graph.edges\n      .filter((edge) => !exclude.includes(edge.target))\n      .map((edge) => edge.source)\n  );\n\n  const found: Node[] = [];\n  for (const node of Object.values(graph.nodes)) {\n    if (!exclude.includes(node.id) && !sources.has(node.id)) {\n      found.push(node);\n    }\n  }\n  return found.length === 1 ? found[0] : undefined;\n}\n"],"mappings":";;;;;;;AAaA,SAAS,YACP,IACA,MACQ;CACR,IAAI,OAAO,KAAA,KAAa,CAACA,SAAO,EAAE,GAChC,OAAO;MACF,IAAI,oBAAoB,IAAI,GACjC,IAAI;EACF,IAAI,UAAU,KAAK,QAAQ;EAC3B,UAAU,QAAQ,WAAW,UAAU,IACnC,QAAQ,MAAM,CAAiB,IAC/B;EACJ,OAAO;CACT,QAAQ;EACN,OAAO,KAAK,QAAQ;CACtB;MAEA,OAAO,KAAK,QAAQ;AAExB;AAEA,SAAS,aAAa,MAAY;CAEhC,IAAI,oBAAoB,KAAK,IAAI,GAC/B,OAAO;EACL,MAAM;EACN,MAAM;GACJ,IAAI,KAAK,KAAK;GACd,MAAM,KAAK,KAAK,QAAQ;EAC1B;CACF;MAEA,OAAO;EACL,MAAM;EACN,MAAM;GAAE,GAAG,aAAa,KAAK,KAAK,MAAM;GAAG,OAAO,KAAK,KAAK;EAAK;CACnE;AAEJ;AAEA,IAAa,QAAb,MAAa,MAAM;CACjB,QAA8B,CAAC;CAE/B,QAAgB,CAAC;CAEjB,YAAY,QAAyD;EACnE,KAAK,QAAQ,QAAQ,SAAS,KAAK;EACnC,KAAK,QAAQ,QAAQ,SAAS,KAAK;CACrC;CAIA,SAA8B;EAC5B,MAAM,gBAAiD,CAAC;EACxD,OAAO,OAAO,KAAK,KAAK,CAAC,CAAC,SAAS,MAAM,MAAM;GAC7C,cAAc,KAAK,MAAMA,SAAO,KAAK,EAAE,IAAI,IAAI,KAAK;EACtD,CAAC;EAED,OAAO;GACL,OAAO,OAAO,OAAO,KAAK,KAAK,CAAC,CAAC,KAAK,UAAU;IAC9C,IAAI,cAAc,KAAK;IACvB,GAAG,aAAa,IAAI;GACtB,EAAE;GACF,OAAO,KAAK,MAAM,KAAK,SAAS;IAC9B,MAAM,OAAgC;KACpC,QAAQ,cAAc,KAAK;KAC3B,QAAQ,cAAc,KAAK;IAC7B;IAEA,IAAI,OAAO,KAAK,SAAS,aACvB,KAAK,OAAO,KAAK;IAGnB,IAAI,OAAO,KAAK,gBAAgB,aAC9B,KAAK,cAAc,KAAK;IAE1B,OAAO;GACT,CAAC;EACH;CACF;CAEA,QACE,MACA,IAEA,UACM;EACN,IAAI,OAAO,KAAA,KAAa,KAAK,MAAM,QAAQ,KAAA,GACzC,MAAM,IAAI,MAAM,gBAAgB,GAAG,gBAAgB;EAErD,MAAM,SAAS,MAAMC,GAAO;EAC5B,MAAM,OAAa;GACjB,IAAI;GACJ;GACA,MAAM,YAAY,IAAI,IAAI;GAC1B;EACF;EACA,KAAK,MAAM,UAAU;EACrB,OAAO;CACT;CAEA,WAAW,MAAkB;EAE3B,OAAO,KAAK,MAAM,KAAK;EAGvB,KAAK,QAAQ,KAAK,MAAM,QACrB,SAAS,KAAK,WAAW,KAAK,MAAM,KAAK,WAAW,KAAK,EAC5D;CACF;CAEA,QACE,QACA,QACA,MACA,aACM;EACN,IAAI,KAAK,MAAM,OAAO,QAAQ,KAAA,GAC5B,MAAM,IAAI,MAAM,eAAe,OAAO,GAAG,cAAc;EAEzD,IAAI,KAAK,MAAM,OAAO,QAAQ,KAAA,GAC5B,MAAM,IAAI,MAAM,eAAe,OAAO,GAAG,cAAc;EAEzD,MAAM,OAAa;GACjB,QAAQ,OAAO;GACf,QAAQ,OAAO;GACf;GACA;EACF;EACA,KAAK,MAAM,KAAK,IAAI;EACpB,OAAO;CACT;CAEA,YAA8B;EAC5B,OAAO,WAAW,IAAI;CACxB;CAEA,WAA6B;EAC3B,OAAO,UAAU,IAAI;CACvB;;;;;CAMA,OAAO,OAAc,SAAS,IAAI;EAChC,IAAI,cAAc;EAElB,IADgB,OAAO,OAAO,MAAM,KAAK,CAAC,CAAC,KAAK,SAAS,KAAK,EACpD,CAAC,CAAC,MAAMD,QAAM,GACtB,cAAc;EAGhB,MAAM,YAAY,OAAe;GAC/B,OAAO,cAAc,GAAG,YAAY,GAAG,OAAO;EAChD;EAEA,OAAO,QAAQ,MAAM,KAAK,CAAC,CAAC,SAAS,CAAC,KAAK,WAAW;GACpD,KAAK,MAAM,SAAS,GAAG,KAAK;IAAE,GAAG;IAAO,IAAI,SAAS,GAAG;GAAE;EAC5D,CAAC;EAED,MAAM,WAAW,MAAM,MAAM,KAAK,SAAS;GACzC,OAAO;IACL,GAAG;IACH,QAAQ,SAAS,KAAK,MAAM;IAC5B,QAAQ,SAAS,KAAK,MAAM;GAC9B;EACF,CAAC;EAED,KAAK,QAAQ,CAAC,GAAG,KAAK,OAAO,GAAG,QAAQ;EACxC,MAAM,QAAQ,MAAM,UAAU;EAC9B,MAAM,OAAO,MAAM,SAAS;EAC5B,OAAO,CACL,QAAQ;GAAE,IAAI,SAAS,MAAM,EAAE;GAAG,MAAM,MAAM;EAAK,IAAI,KAAA,GACvD,OAAO;GAAE,IAAI,SAAS,KAAK,EAAE;GAAG,MAAM,KAAK;EAAK,IAAI,KAAA,CACtD;CACF;CAEA,gBAAsB;EACpB,MAAM,YAAY,KAAK,UAAU;EACjC,IAAI,aAAa,WAAW,MAAM,CAAC,UAAU,EAAE,CAAC,GAC9C,KAAK,WAAW,SAAS;CAE7B;CAEA,eAAqB;EACnB,MAAM,WAAW,KAAK,SAAS;EAC/B,IAAI,YAAY,UAAU,MAAM,CAAC,SAAS,EAAE,CAAC,GAC3C,KAAK,WAAW,QAAQ;CAE5B;;;;;CAMA,OAAc;EACZ,MAAM,aAAqC,OAAO,YAChD,OAAO,OAAO,KAAK,KAAK,CAAC,CAAC,KAAK,SAAS,CAAC,KAAK,IAAI,KAAK,IAAI,CAAC,CAC9D;EACA,MAAM,kCAAkB,IAAI,IAAoB;EAChD,OAAO,OAAO,UAAU,CAAC,CAAC,SAAS,UAAU;GAC3C,gBAAgB,IAAI,QAAQ,gBAAgB,IAAI,KAAK,KAAK,KAAK,CAAC;EAClE,CAAC;EAED,MAAM,aAAa,WAA2B;GAC5C,MAAM,QAAQ,WAAW;GACzB,IAAIA,SAAO,MAAM,KAAK,gBAAgB,IAAI,KAAK,MAAM,GACnD,OAAO;QAEP,OAAO;EAEX;EAEA,OAAO,IAAI,MAAM;GACf,OAAO,OAAO,YACZ,OAAO,QAAQ,KAAK,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,UAAU,CAC7C,UAAU,EAAE,GACZ;IAAE,GAAG;IAAM,IAAI,UAAU,EAAE;GAAE,CAC/B,CAAC,CACH;GACA,OAAO,KAAK,MAAM,KAAK,UAAU;IAC/B,GAAG;IACH,QAAQ,UAAU,KAAK,MAAM;IAC7B,QAAQ,UAAU,KAAK,MAAM;GAC/B,EAAE;EACJ,CAAC;CACH;CAEA,YAAY,QAKD;EACT,MAAM,EACJ,YACA,YACA,aAAa;GACX,SAAS;GACT,OAAO;GACP,MAAM;EACR,GACA,oBACE,UAAU,CAAC;EACf,MAAM,QAAQ,KAAK,KAAK;EACxB,MAAM,YAAY,MAAM,UAAU;EAElC,MAAM,WAAW,MAAM,SAAS;EAEhC,OAAO,YAAY,MAAM,OAAO,MAAM,OAAO;GAC3C,WAAW,WAAW;GACtB,UAAU,UAAU;GACpB;GACA;GACA;GACA;EACF,CAAC;CACH;CAEA,MAAM,eAAe,QAMH;EAChB,MAAM,gBAAgB,KAAK,YAAY,MAAM;EAC7C,OAAO,iBAAiB,eAAe,EACrC,iBAAiB,QAAQ,gBAC3B,CAAC;CACH;AACF;;;;;;;AAOA,SAAS,WAAW,OAAc,UAAoB,CAAC,GAAqB;CAC1E,MAAM,UAAU,IAAI,IAClB,MAAM,MACH,QAAQ,SAAS,CAAC,QAAQ,SAAS,KAAK,MAAM,CAAC,CAAC,CAChD,KAAK,SAAS,KAAK,MAAM,CAC9B;CAEA,MAAM,QAAgB,CAAC;CACvB,KAAK,MAAM,QAAQ,OAAO,OAAO,MAAM,KAAK,GAC1C,IAAI,CAAC,QAAQ,SAAS,KAAK,EAAE,KAAK,CAAC,QAAQ,IAAI,KAAK,EAAE,GACpD,MAAM,KAAK,IAAI;CAGnB,OAAO,MAAM,WAAW,IAAI,MAAM,KAAK,KAAA;AACzC;;;;;;;AAQA,SAAS,UAAU,OAAc,UAAoB,CAAC,GAAqB;CACzE,MAAM,UAAU,IAAI,IAClB,MAAM,MACH,QAAQ,SAAS,CAAC,QAAQ,SAAS,KAAK,MAAM,CAAC,CAAC,CAChD,KAAK,SAAS,KAAK,MAAM,CAC9B;CAEA,MAAM,QAAgB,CAAC;CACvB,KAAK,MAAM,QAAQ,OAAO,OAAO,MAAM,KAAK,GAC1C,IAAI,CAAC,QAAQ,SAAS,KAAK,EAAE,KAAK,CAAC,QAAQ,IAAI,KAAK,EAAE,GACpD,MAAM,KAAK,IAAI;CAGnB,OAAO,MAAM,WAAW,IAAI,MAAM,KAAK,KAAA;AACzC"}
+{"version":3,"file":"graph.js","names":["isUuid","uuidv4"],"sources":["../../src/runnables/graph.ts"],"sourcesContent":["import { v4 as uuidv4, validate as isUuid } from \"../utils/uuid/index.js\";\nimport type {\n  RunnableInterface,\n  RunnableIOSchema,\n  Node,\n  Edge,\n} from \"./types.js\";\nimport { isRunnableInterface } from \"./utils.js\";\nimport { drawMermaid, drawMermaidImage } from \"./graph_mermaid.js\";\nimport { toJsonSchema } from \"../utils/json_schema.js\";\n\nexport { Node, Edge };\n\nfunction nodeDataStr(\n  id: string | undefined,\n  data: RunnableInterface | RunnableIOSchema\n): string {\n  if (id !== undefined && !isUuid(id)) {\n    return id;\n  } else if (isRunnableInterface(data)) {\n    try {\n      let dataStr = data.getName();\n      dataStr = dataStr.startsWith(\"Runnable\")\n        ? dataStr.slice(\"Runnable\".length)\n        : dataStr;\n      return dataStr;\n    } catch {\n      return data.getName();\n    }\n  } else {\n    return data.name ?? \"UnknownSchema\";\n  }\n}\n\nfunction nodeDataJson(node: Node) {\n  // if node.data implements Runnable\n  if (isRunnableInterface(node.data)) {\n    return {\n      type: \"runnable\",\n      data: {\n        id: node.data.lc_id,\n        name: node.data.getName(),\n      },\n    };\n  } else {\n    return {\n      type: \"schema\",\n      data: { ...toJsonSchema(node.data.schema), title: node.data.name },\n    };\n  }\n}\n\nexport class Graph {\n  nodes: Record<string, Node> = {};\n\n  edges: Edge[] = [];\n\n  constructor(params?: { nodes: Record<string, Node>; edges: Edge[] }) {\n    this.nodes = params?.nodes ?? this.nodes;\n    this.edges = params?.edges ?? this.edges;\n  }\n\n  // Convert the graph to a JSON-serializable format.\n  // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n  toJSON(): Record<string, any> {\n    const stableNodeIds: Record<string, string | number> = {};\n    Object.values(this.nodes).forEach((node, i) => {\n      stableNodeIds[node.id] = isUuid(node.id) ? i : node.id;\n    });\n\n    return {\n      nodes: Object.values(this.nodes).map((node) => ({\n        id: stableNodeIds[node.id],\n        ...nodeDataJson(node),\n        ...(node.metadata != null ? { metadata: node.metadata } : {}),\n      })),\n      edges: this.edges.map((edge) => {\n        const item: Record<string, unknown> = {\n          source: stableNodeIds[edge.source],\n          target: stableNodeIds[edge.target],\n        };\n\n        if (typeof edge.data !== \"undefined\") {\n          item.data = edge.data;\n        }\n\n        if (typeof edge.conditional !== \"undefined\") {\n          item.conditional = edge.conditional;\n        }\n        return item;\n      }),\n    };\n  }\n\n  addNode(\n    data: RunnableInterface | RunnableIOSchema,\n    id?: string,\n    // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n    metadata?: Record<string, any>\n  ): Node {\n    if (id !== undefined && this.nodes[id] !== undefined) {\n      throw new Error(`Node with id ${id} already exists`);\n    }\n    const nodeId = id ?? uuidv4();\n    const node: Node = {\n      id: nodeId,\n      data,\n      name: nodeDataStr(id, data),\n      metadata,\n    };\n    this.nodes[nodeId] = node;\n    return node;\n  }\n\n  removeNode(node: Node): void {\n    // Remove the node from the nodes map\n    delete this.nodes[node.id];\n\n    // Filter out edges connected to the node\n    this.edges = this.edges.filter(\n      (edge) => edge.source !== node.id && edge.target !== node.id\n    );\n  }\n\n  addEdge(\n    source: Node,\n    target: Node,\n    data?: string,\n    conditional?: boolean\n  ): Edge {\n    if (this.nodes[source.id] === undefined) {\n      throw new Error(`Source node ${source.id} not in graph`);\n    }\n    if (this.nodes[target.id] === undefined) {\n      throw new Error(`Target node ${target.id} not in graph`);\n    }\n    const edge: Edge = {\n      source: source.id,\n      target: target.id,\n      data,\n      conditional,\n    };\n    this.edges.push(edge);\n    return edge;\n  }\n\n  firstNode(): Node | undefined {\n    return _firstNode(this);\n  }\n\n  lastNode(): Node | undefined {\n    return _lastNode(this);\n  }\n\n  /**\n   * Add all nodes and edges from another graph.\n   * Note this doesn't check for duplicates, nor does it connect the graphs.\n   */\n  extend(graph: Graph, prefix = \"\") {\n    let finalPrefix = prefix;\n    const nodeIds = Object.values(graph.nodes).map((node) => node.id);\n    if (nodeIds.every(isUuid)) {\n      finalPrefix = \"\";\n    }\n\n    const prefixed = (id: string) => {\n      return finalPrefix ? `${finalPrefix}:${id}` : id;\n    };\n\n    Object.entries(graph.nodes).forEach(([key, value]) => {\n      this.nodes[prefixed(key)] = { ...value, id: prefixed(key) };\n    });\n\n    const newEdges = graph.edges.map((edge) => {\n      return {\n        ...edge,\n        source: prefixed(edge.source),\n        target: prefixed(edge.target),\n      };\n    });\n    // Add all edges from the other graph\n    this.edges = [...this.edges, ...newEdges];\n    const first = graph.firstNode();\n    const last = graph.lastNode();\n    return [\n      first ? { id: prefixed(first.id), data: first.data } : undefined,\n      last ? { id: prefixed(last.id), data: last.data } : undefined,\n    ];\n  }\n\n  trimFirstNode(): void {\n    const firstNode = this.firstNode();\n    if (firstNode && _firstNode(this, [firstNode.id])) {\n      this.removeNode(firstNode);\n    }\n  }\n\n  trimLastNode(): void {\n    const lastNode = this.lastNode();\n    if (lastNode && _lastNode(this, [lastNode.id])) {\n      this.removeNode(lastNode);\n    }\n  }\n\n  /**\n   * Return a new graph with all nodes re-identified,\n   * using their unique, readable names where possible.\n   */\n  reid(): Graph {\n    const nodeLabels: Record<string, string> = Object.fromEntries(\n      Object.values(this.nodes).map((node) => [node.id, node.name])\n    );\n    const nodeLabelCounts = new Map<string, number>();\n    Object.values(nodeLabels).forEach((label) => {\n      nodeLabelCounts.set(label, (nodeLabelCounts.get(label) || 0) + 1);\n    });\n\n    const getNodeId = (nodeId: string): string => {\n      const label = nodeLabels[nodeId];\n      if (isUuid(nodeId) && nodeLabelCounts.get(label) === 1) {\n        return label;\n      } else {\n        return nodeId;\n      }\n    };\n\n    return new Graph({\n      nodes: Object.fromEntries(\n        Object.entries(this.nodes).map(([id, node]) => [\n          getNodeId(id),\n          { ...node, id: getNodeId(id) },\n        ])\n      ),\n      edges: this.edges.map((edge) => ({\n        ...edge,\n        source: getNodeId(edge.source),\n        target: getNodeId(edge.target),\n      })),\n    });\n  }\n\n  drawMermaid(params?: {\n    withStyles?: boolean;\n    curveStyle?: string;\n    nodeColors?: Record<string, string>;\n    wrapLabelNWords?: number;\n  }): string {\n    const {\n      withStyles,\n      curveStyle,\n      nodeColors = {\n        default: \"fill:#f2f0ff,line-height:1.2\",\n        first: \"fill-opacity:0\",\n        last: \"fill:#bfb6fc\",\n      },\n      wrapLabelNWords,\n    } = params ?? {};\n    const graph = this.reid();\n    const firstNode = graph.firstNode();\n\n    const lastNode = graph.lastNode();\n\n    return drawMermaid(graph.nodes, graph.edges, {\n      firstNode: firstNode?.id,\n      lastNode: lastNode?.id,\n      withStyles,\n      curveStyle,\n      nodeColors,\n      wrapLabelNWords,\n    });\n  }\n\n  async drawMermaidPng(params?: {\n    withStyles?: boolean;\n    curveStyle?: string;\n    nodeColors?: Record<string, string>;\n    wrapLabelNWords?: number;\n    backgroundColor?: string;\n  }): Promise<Blob> {\n    const mermaidSyntax = this.drawMermaid(params);\n    return drawMermaidImage(mermaidSyntax, {\n      backgroundColor: params?.backgroundColor,\n    });\n  }\n}\n/**\n * Find the single node that is not a target of any edge.\n * Exclude nodes/sources with ids in the exclude list.\n * If there is no such node, or there are multiple, return undefined.\n * When drawing the graph, this node would be the origin.\n */\nfunction _firstNode(graph: Graph, exclude: string[] = []): Node | undefined {\n  const targets = new Set(\n    graph.edges\n      .filter((edge) => !exclude.includes(edge.source))\n      .map((edge) => edge.target)\n  );\n\n  const found: Node[] = [];\n  for (const node of Object.values(graph.nodes)) {\n    if (!exclude.includes(node.id) && !targets.has(node.id)) {\n      found.push(node);\n    }\n  }\n  return found.length === 1 ? found[0] : undefined;\n}\n\n/**\n * Find the single node that is not a source of any edge.\n * Exclude nodes/targets with ids in the exclude list.\n * If there is no such node, or there are multiple, return undefined.\n * When drawing the graph, this node would be the destination.\n */\nfunction _lastNode(graph: Graph, exclude: string[] = []): Node | undefined {\n  const sources = new Set(\n    graph.edges\n      .filter((edge) => !exclude.includes(edge.target))\n      .map((edge) => edge.source)\n  );\n\n  const found: Node[] = [];\n  for (const node of Object.values(graph.nodes)) {\n    if (!exclude.includes(node.id) && !sources.has(node.id)) {\n      found.push(node);\n    }\n  }\n  return found.length === 1 ? found[0] : undefined;\n}\n"],"mappings":";;;;;;;AAaA,SAAS,YACP,IACA,MACQ;CACR,IAAI,OAAO,KAAA,KAAa,CAACA,SAAO,EAAE,GAChC,OAAO;MACF,IAAI,oBAAoB,IAAI,GACjC,IAAI;EACF,IAAI,UAAU,KAAK,QAAQ;EAC3B,UAAU,QAAQ,WAAW,UAAU,IACnC,QAAQ,MAAM,CAAiB,IAC/B;EACJ,OAAO;CACT,QAAQ;EACN,OAAO,KAAK,QAAQ;CACtB;MAEA,OAAO,KAAK,QAAQ;AAExB;AAEA,SAAS,aAAa,MAAY;CAEhC,IAAI,oBAAoB,KAAK,IAAI,GAC/B,OAAO;EACL,MAAM;EACN,MAAM;GACJ,IAAI,KAAK,KAAK;GACd,MAAM,KAAK,KAAK,QAAQ;EAC1B;CACF;MAEA,OAAO;EACL,MAAM;EACN,MAAM;GAAE,GAAG,aAAa,KAAK,KAAK,MAAM;GAAG,OAAO,KAAK,KAAK;EAAK;CACnE;AAEJ;AAEA,IAAa,QAAb,MAAa,MAAM;CACjB,QAA8B,CAAC;CAE/B,QAAgB,CAAC;CAEjB,YAAY,QAAyD;EACnE,KAAK,QAAQ,QAAQ,SAAS,KAAK;EACnC,KAAK,QAAQ,QAAQ,SAAS,KAAK;CACrC;CAIA,SAA8B;EAC5B,MAAM,gBAAiD,CAAC;EACxD,OAAO,OAAO,KAAK,KAAK,CAAC,CAAC,SAAS,MAAM,MAAM;GAC7C,cAAc,KAAK,MAAMA,SAAO,KAAK,EAAE,IAAI,IAAI,KAAK;EACtD,CAAC;EAED,OAAO;GACL,OAAO,OAAO,OAAO,KAAK,KAAK,CAAC,CAAC,KAAK,UAAU;IAC9C,IAAI,cAAc,KAAK;IACvB,GAAG,aAAa,IAAI;IACpB,GAAI,KAAK,YAAY,OAAO,EAAE,UAAU,KAAK,SAAS,IAAI,CAAC;GAC7D,EAAE;GACF,OAAO,KAAK,MAAM,KAAK,SAAS;IAC9B,MAAM,OAAgC;KACpC,QAAQ,cAAc,KAAK;KAC3B,QAAQ,cAAc,KAAK;IAC7B;IAEA,IAAI,OAAO,KAAK,SAAS,aACvB,KAAK,OAAO,KAAK;IAGnB,IAAI,OAAO,KAAK,gBAAgB,aAC9B,KAAK,cAAc,KAAK;IAE1B,OAAO;GACT,CAAC;EACH;CACF;CAEA,QACE,MACA,IAEA,UACM;EACN,IAAI,OAAO,KAAA,KAAa,KAAK,MAAM,QAAQ,KAAA,GACzC,MAAM,IAAI,MAAM,gBAAgB,GAAG,gBAAgB;EAErD,MAAM,SAAS,MAAMC,GAAO;EAC5B,MAAM,OAAa;GACjB,IAAI;GACJ;GACA,MAAM,YAAY,IAAI,IAAI;GAC1B;EACF;EACA,KAAK,MAAM,UAAU;EACrB,OAAO;CACT;CAEA,WAAW,MAAkB;EAE3B,OAAO,KAAK,MAAM,KAAK;EAGvB,KAAK,QAAQ,KAAK,MAAM,QACrB,SAAS,KAAK,WAAW,KAAK,MAAM,KAAK,WAAW,KAAK,EAC5D;CACF;CAEA,QACE,QACA,QACA,MACA,aACM;EACN,IAAI,KAAK,MAAM,OAAO,QAAQ,KAAA,GAC5B,MAAM,IAAI,MAAM,eAAe,OAAO,GAAG,cAAc;EAEzD,IAAI,KAAK,MAAM,OAAO,QAAQ,KAAA,GAC5B,MAAM,IAAI,MAAM,eAAe,OAAO,GAAG,cAAc;EAEzD,MAAM,OAAa;GACjB,QAAQ,OAAO;GACf,QAAQ,OAAO;GACf;GACA;EACF;EACA,KAAK,MAAM,KAAK,IAAI;EACpB,OAAO;CACT;CAEA,YAA8B;EAC5B,OAAO,WAAW,IAAI;CACxB;CAEA,WAA6B;EAC3B,OAAO,UAAU,IAAI;CACvB;;;;;CAMA,OAAO,OAAc,SAAS,IAAI;EAChC,IAAI,cAAc;EAElB,IADgB,OAAO,OAAO,MAAM,KAAK,CAAC,CAAC,KAAK,SAAS,KAAK,EACpD,CAAC,CAAC,MAAMD,QAAM,GACtB,cAAc;EAGhB,MAAM,YAAY,OAAe;GAC/B,OAAO,cAAc,GAAG,YAAY,GAAG,OAAO;EAChD;EAEA,OAAO,QAAQ,MAAM,KAAK,CAAC,CAAC,SAAS,CAAC,KAAK,WAAW;GACpD,KAAK,MAAM,SAAS,GAAG,KAAK;IAAE,GAAG;IAAO,IAAI,SAAS,GAAG;GAAE;EAC5D,CAAC;EAED,MAAM,WAAW,MAAM,MAAM,KAAK,SAAS;GACzC,OAAO;IACL,GAAG;IACH,QAAQ,SAAS,KAAK,MAAM;IAC5B,QAAQ,SAAS,KAAK,MAAM;GAC9B;EACF,CAAC;EAED,KAAK,QAAQ,CAAC,GAAG,KAAK,OAAO,GAAG,QAAQ;EACxC,MAAM,QAAQ,MAAM,UAAU;EAC9B,MAAM,OAAO,MAAM,SAAS;EAC5B,OAAO,CACL,QAAQ;GAAE,IAAI,SAAS,MAAM,EAAE;GAAG,MAAM,MAAM;EAAK,IAAI,KAAA,GACvD,OAAO;GAAE,IAAI,SAAS,KAAK,EAAE;GAAG,MAAM,KAAK;EAAK,IAAI,KAAA,CACtD;CACF;CAEA,gBAAsB;EACpB,MAAM,YAAY,KAAK,UAAU;EACjC,IAAI,aAAa,WAAW,MAAM,CAAC,UAAU,EAAE,CAAC,GAC9C,KAAK,WAAW,SAAS;CAE7B;CAEA,eAAqB;EACnB,MAAM,WAAW,KAAK,SAAS;EAC/B,IAAI,YAAY,UAAU,MAAM,CAAC,SAAS,EAAE,CAAC,GAC3C,KAAK,WAAW,QAAQ;CAE5B;;;;;CAMA,OAAc;EACZ,MAAM,aAAqC,OAAO,YAChD,OAAO,OAAO,KAAK,KAAK,CAAC,CAAC,KAAK,SAAS,CAAC,KAAK,IAAI,KAAK,IAAI,CAAC,CAC9D;EACA,MAAM,kCAAkB,IAAI,IAAoB;EAChD,OAAO,OAAO,UAAU,CAAC,CAAC,SAAS,UAAU;GAC3C,gBAAgB,IAAI,QAAQ,gBAAgB,IAAI,KAAK,KAAK,KAAK,CAAC;EAClE,CAAC;EAED,MAAM,aAAa,WAA2B;GAC5C,MAAM,QAAQ,WAAW;GACzB,IAAIA,SAAO,MAAM,KAAK,gBAAgB,IAAI,KAAK,MAAM,GACnD,OAAO;QAEP,OAAO;EAEX;EAEA,OAAO,IAAI,MAAM;GACf,OAAO,OAAO,YACZ,OAAO,QAAQ,KAAK,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,UAAU,CAC7C,UAAU,EAAE,GACZ;IAAE,GAAG;IAAM,IAAI,UAAU,EAAE;GAAE,CAC/B,CAAC,CACH;GACA,OAAO,KAAK,MAAM,KAAK,UAAU;IAC/B,GAAG;IACH,QAAQ,UAAU,KAAK,MAAM;IAC7B,QAAQ,UAAU,KAAK,MAAM;GAC/B,EAAE;EACJ,CAAC;CACH;CAEA,YAAY,QAKD;EACT,MAAM,EACJ,YACA,YACA,aAAa;GACX,SAAS;GACT,OAAO;GACP,MAAM;EACR,GACA,oBACE,UAAU,CAAC;EACf,MAAM,QAAQ,KAAK,KAAK;EACxB,MAAM,YAAY,MAAM,UAAU;EAElC,MAAM,WAAW,MAAM,SAAS;EAEhC,OAAO,YAAY,MAAM,OAAO,MAAM,OAAO;GAC3C,WAAW,WAAW;GACtB,UAAU,UAAU;GACpB;GACA;GACA;GACA;EACF,CAAC;CACH;CAEA,MAAM,eAAe,QAMH;EAChB,MAAM,gBAAgB,KAAK,YAAY,MAAM;EAC7C,OAAO,iBAAiB,eAAe,EACrC,iBAAiB,QAAQ,gBAC3B,CAAC;CACH;AACF;;;;;;;AAOA,SAAS,WAAW,OAAc,UAAoB,CAAC,GAAqB;CAC1E,MAAM,UAAU,IAAI,IAClB,MAAM,MACH,QAAQ,SAAS,CAAC,QAAQ,SAAS,KAAK,MAAM,CAAC,CAAC,CAChD,KAAK,SAAS,KAAK,MAAM,CAC9B;CAEA,MAAM,QAAgB,CAAC;CACvB,KAAK,MAAM,QAAQ,OAAO,OAAO,MAAM,KAAK,GAC1C,IAAI,CAAC,QAAQ,SAAS,KAAK,EAAE,KAAK,CAAC,QAAQ,IAAI,KAAK,EAAE,GACpD,MAAM,KAAK,IAAI;CAGnB,OAAO,MAAM,WAAW,IAAI,MAAM,KAAK,KAAA;AACzC;;;;;;;AAQA,SAAS,UAAU,OAAc,UAAoB,CAAC,GAAqB;CACzE,MAAM,UAAU,IAAI,IAClB,MAAM,MACH,QAAQ,SAAS,CAAC,QAAQ,SAAS,KAAK,MAAM,CAAC,CAAC,CAChD,KAAK,SAAS,KAAK,MAAM,CAC9B;CAEA,MAAM,QAAgB,CAAC;CACvB,KAAK,MAAM,QAAQ,OAAO,OAAO,MAAM,KAAK,GAC1C,IAAI,CAAC,QAAQ,SAAS,KAAK,EAAE,KAAK,CAAC,QAAQ,IAAI,KAAK,EAAE,GACpD,MAAM,KAAK,IAAI;CAGnB,OAAO,MAAM,WAAW,IAAI,MAAM,KAAK,KAAA;AACzC"}

package/dist/runnables/graph_mermaid.cjs

@@ -8,6 +8,29 @@ const MARKDOWN_SPECIAL_CHARS = [
 	"_",
 	"`"
 ];
+const MERMAID_ENTITY_CODES = {
+	"#": "#35;",
+	"[": "#91;",
+	"]": "#93;",
+	"(": "#40;",
+	")": "#41;",
+	"{": "#123;",
+	"}": "#125;",
+	"\"": "#quot;",
+	"<": "#60;",
+	">": "#62;",
+	"|": "#124;"
+};
+function _escapeMetadataText(text) {
+	return text.replace(/[#[\](){}"<>|]/g, (char) => MERMAID_ENTITY_CODES[char]);
+}
+function _isScalar(value) {
+	return typeof value === "string" || typeof value === "number" || typeof value === "boolean";
+}
+function _formatMetadataValue(value) {
+	if (_isScalar(value)) return String(value);
+	if (Array.isArray(value) && value.every(_isScalar)) return value.join(",");
+}
 function _generateMermaidGraphStyles(nodeColors) {
 	let styles = "";
 	for (const [className, color] of Object.entries(nodeColors)) styles += `\tclassDef ${className} ${color};\n`;
@@ -27,7 +50,11 @@ function drawMermaid(nodes, edges, config) {
 		for (const [key, node] of Object.entries(nodes)) {
 			const nodeName = node.name.split(":").pop() ?? "";
 			let finalLabel = MARKDOWN_SPECIAL_CHARS.some((char) => nodeName.startsWith(char) && nodeName.endsWith(char)) ? `<p>${nodeName}</p>` : nodeName;
-			if (Object.keys(node.metadata ?? {}).length) finalLabel += `<hr/><small><em>${Object.entries(node.metadata ?? {}).map(([k, v]) => `${k} = ${v}`).join("\n")}</em></small>`;
+			const metadataLines = Object.entries(node.metadata ?? {}).flatMap(([k, v]) => {
+				const value = _formatMetadataValue(v);
+				return value === void 0 ? [] : [_escapeMetadataText(`${k} = ${value}`)];
+			});
+			if (metadataLines.length) finalLabel += `<hr/><small><em>${metadataLines.join("\n")}</em></small>`;
 			const nodeLabel = (formatDict[key] ?? formatDict[defaultClassLabel]).replace("{0}", _escapeNodeLabel(key)).replace("{1}", finalLabel);
 			mermaidGraph += `\t${nodeLabel}\n`;
 		}

package/dist/runnables/graph_mermaid.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"graph_mermaid.cjs","names":["toBase64Url"],"sources":["../../src/runnables/graph_mermaid.ts"],"sourcesContent":["import { Edge, Node } from \"./types.js\";\nimport { toBase64Url } from \"./utils.js\";\n\nfunction _escapeNodeLabel(nodeLabel: string): string {\n  // Escapes the node label for Mermaid syntax.\n  return nodeLabel.replace(/[^a-zA-Z-_0-9]/g, \"_\");\n}\n\nconst MARKDOWN_SPECIAL_CHARS = [\"*\", \"_\", \"`\"];\n\nfunction _generateMermaidGraphStyles(\n  nodeColors: Record<string, string>\n): string {\n  let styles = \"\";\n  for (const [className, color] of Object.entries(nodeColors)) {\n    styles += `\\tclassDef ${className} ${color};\\n`;\n  }\n  return styles;\n}\n\n/**\n * Draws a Mermaid graph using the provided graph data\n */\nexport function drawMermaid(\n  nodes: Record<string, Node>,\n  edges: Edge[],\n  config?: {\n    firstNode?: string;\n    lastNode?: string;\n    curveStyle?: string;\n    withStyles?: boolean;\n    nodeColors?: Record<string, string>;\n    wrapLabelNWords?: number;\n  }\n): string {\n  const {\n    firstNode,\n    lastNode,\n    nodeColors,\n    withStyles = true,\n    curveStyle = \"linear\",\n    wrapLabelNWords = 9,\n  } = config ?? {};\n  // Initialize Mermaid graph configuration\n  let mermaidGraph = withStyles\n    ? `%%{init: {'flowchart': {'curve': '${curveStyle}'}}}%%\\ngraph TD;\\n`\n    : \"graph TD;\\n\";\n  if (withStyles) {\n    // Node formatting templates\n    const defaultClassLabel = \"default\";\n    const formatDict: Record<string, string> = {\n      [defaultClassLabel]: \"{0}({1})\",\n    };\n    if (firstNode !== undefined) {\n      formatDict[firstNode] = \"{0}([{1}]):::first\";\n    }\n    if (lastNode !== undefined) {\n      formatDict[lastNode] = \"{0}([{1}]):::last\";\n    }\n\n    // Add nodes to the graph\n    for (const [key, node] of Object.entries(nodes)) {\n      const nodeName = node.name.split(\":\").pop() ?? \"\";\n      const label = MARKDOWN_SPECIAL_CHARS.some(\n        (char) => nodeName.startsWith(char) && nodeName.endsWith(char)\n      )\n        ? `<p>${nodeName}</p>`\n        : nodeName;\n\n      let finalLabel = label;\n      if (Object.keys(node.metadata ?? {}).length) {\n        finalLabel += `<hr/><small><em>${Object.entries(node.metadata ?? {})\n          .map(([k, v]) => `${k} = ${v}`)\n          .join(\"\\n\")}</em></small>`;\n      }\n\n      const nodeLabel = (formatDict[key] ?? formatDict[defaultClassLabel])\n        .replace(\"{0}\", _escapeNodeLabel(key))\n        .replace(\"{1}\", finalLabel);\n\n      mermaidGraph += `\\t${nodeLabel}\\n`;\n    }\n  }\n\n  // Group edges by their common prefixes\n  const edgeGroups: Record<string, Edge[]> = {};\n  for (const edge of edges) {\n    const srcParts = edge.source.split(\":\");\n    const tgtParts = edge.target.split(\":\");\n    const commonPrefix = srcParts\n      .filter((src, i) => src === tgtParts[i])\n      .join(\":\");\n    if (!edgeGroups[commonPrefix]) {\n      edgeGroups[commonPrefix] = [];\n    }\n    edgeGroups[commonPrefix].push(edge);\n  }\n\n  const seenSubgraphs = new Set<string>();\n\n  // sort prefixes by path length for correct nesting\n  function sortPrefixesByDepth(prefixes: string[]): string[] {\n    return [...prefixes].sort((a, b) => {\n      return a.split(\":\").length - b.split(\":\").length;\n    });\n  }\n\n  function addSubgraph(edges: Edge[], prefix: string): void {\n    const selfLoop = edges.length === 1 && edges[0].source === edges[0].target;\n    if (prefix && !selfLoop) {\n      const subgraph = prefix.split(\":\").pop()!;\n\n      if (seenSubgraphs.has(prefix)) {\n        throw new Error(\n          `Found duplicate subgraph '${subgraph}' at '${prefix} -- this likely means that ` +\n            \"you're reusing a subgraph node with the same name. \" +\n            \"Please adjust your graph to have subgraph nodes with unique names.\"\n        );\n      }\n\n      seenSubgraphs.add(prefix);\n      mermaidGraph += `\\tsubgraph ${subgraph}\\n`;\n    }\n\n    // all nested prefixes for this level, sorted by depth\n    const nestedPrefixes = sortPrefixesByDepth(\n      Object.keys(edgeGroups).filter(\n        (nestedPrefix) =>\n          nestedPrefix.startsWith(`${prefix}:`) &&\n          nestedPrefix !== prefix &&\n          nestedPrefix.split(\":\").length === prefix.split(\":\").length + 1\n      )\n    );\n\n    for (const nestedPrefix of nestedPrefixes) {\n      addSubgraph(edgeGroups[nestedPrefix], nestedPrefix);\n    }\n\n    for (const edge of edges) {\n      const { source, target, data, conditional } = edge;\n\n      let edgeLabel = \"\";\n      if (data !== undefined) {\n        let edgeData = data;\n        const words = edgeData.split(\" \");\n        if (words.length > wrapLabelNWords) {\n          edgeData = Array.from(\n            { length: Math.ceil(words.length / wrapLabelNWords) },\n            (_, i) =>\n              words\n                .slice(i * wrapLabelNWords, (i + 1) * wrapLabelNWords)\n                .join(\" \")\n          ).join(\"&nbsp;<br>&nbsp;\");\n        }\n        edgeLabel = conditional\n          ? ` -. &nbsp;${edgeData}&nbsp; .-> `\n          : ` -- &nbsp;${edgeData}&nbsp; --> `;\n      } else {\n        edgeLabel = conditional ? \" -.-> \" : \" --> \";\n      }\n\n      mermaidGraph += `\\t${_escapeNodeLabel(\n        source\n      )}${edgeLabel}${_escapeNodeLabel(target)};\\n`;\n    }\n\n    if (prefix && !selfLoop) {\n      mermaidGraph += \"\\tend\\n\";\n    }\n  }\n\n  // Start with the top-level edges (no common prefix)\n  addSubgraph(edgeGroups[\"\"] ?? [], \"\");\n\n  // Add remaining top-level subgraphs\n  for (const prefix in edgeGroups) {\n    if (!prefix.includes(\":\") && prefix !== \"\") {\n      addSubgraph(edgeGroups[prefix], prefix);\n    }\n  }\n\n  // Add custom styles for nodes\n  if (withStyles) {\n    mermaidGraph += _generateMermaidGraphStyles(nodeColors ?? {});\n  }\n\n  return mermaidGraph;\n}\n\n/**\n * Renders Mermaid graph using the Mermaid.INK API.\n *\n * @example\n * ```javascript\n * const image = await drawMermaidImage(mermaidSyntax, {\n *   backgroundColor: \"white\",\n *   imageType: \"png\",\n * });\n * fs.writeFileSync(\"image.png\", image);\n * ```\n *\n * @param mermaidSyntax - The Mermaid syntax to render.\n * @param config - The configuration for the image.\n * @returns The image as a Blob.\n */\nexport async function drawMermaidImage(\n  mermaidSyntax: string,\n  config?: {\n    /**\n     * The type of image to render.\n     * @default \"png\"\n     */\n    imageType?: \"png\" | \"jpeg\" | \"webp\";\n    backgroundColor?: string;\n  }\n) {\n  let backgroundColor = config?.backgroundColor ?? \"white\";\n  const imageType = config?.imageType ?? \"png\";\n\n  const mermaidSyntaxEncoded = toBase64Url(mermaidSyntax);\n\n  // Check if the background color is a hexadecimal color code using regex\n  if (backgroundColor !== undefined) {\n    const hexColorPattern = /^#(?:[0-9a-fA-F]{3}){1,2}$/;\n    if (!hexColorPattern.test(backgroundColor)) {\n      backgroundColor = `!${backgroundColor}`;\n    }\n  }\n  const imageUrl = `https://mermaid.ink/img/${mermaidSyntaxEncoded}?bgColor=${backgroundColor}&type=${imageType}`;\n  const res = await fetch(imageUrl);\n  if (!res.ok) {\n    throw new Error(\n      [\n        `Failed to render the graph using the Mermaid.INK API.`,\n        `Status code: ${res.status}`,\n        `Status text: ${res.statusText}`,\n      ].join(\"\\n\")\n    );\n  }\n  const content = await res.blob();\n  return content;\n}\n"],"mappings":";;AAGA,SAAS,iBAAiB,WAA2B;CAEnD,OAAO,UAAU,QAAQ,mBAAmB,GAAG;AACjD;AAEA,MAAM,yBAAyB;CAAC;CAAK;CAAK;AAAG;AAE7C,SAAS,4BACP,YACQ;CACR,IAAI,SAAS;CACb,KAAK,MAAM,CAAC,WAAW,UAAU,OAAO,QAAQ,UAAU,GACxD,UAAU,cAAc,UAAU,GAAG,MAAM;CAE7C,OAAO;AACT;;;;AAKA,SAAgB,YACd,OACA,OACA,QAQQ;CACR,MAAM,EACJ,WACA,UACA,YACA,aAAa,MACb,aAAa,UACb,kBAAkB,MAChB,UAAU,CAAC;CAEf,IAAI,eAAe,aACf,qCAAqC,WAAW,uBAChD;CACJ,IAAI,YAAY;EAEd,MAAM,oBAAoB;EAC1B,MAAM,aAAqC,GACxC,oBAAoB,WACvB;EACA,IAAI,cAAc,KAAA,GAChB,WAAW,aAAa;EAE1B,IAAI,aAAa,KAAA,GACf,WAAW,YAAY;EAIzB,KAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAAQ,KAAK,GAAG;GAC/C,MAAM,WAAW,KAAK,KAAK,MAAM,GAAG,CAAC,CAAC,IAAI,KAAK;GAO/C,IAAI,aANU,uBAAuB,MAClC,SAAS,SAAS,WAAW,IAAI,KAAK,SAAS,SAAS,IAAI,CAC/D,IACI,MAAM,SAAS,QACf;GAGJ,IAAI,OAAO,KAAK,KAAK,YAAY,CAAC,CAAC,CAAC,CAAC,QACnC,cAAc,mBAAmB,OAAO,QAAQ,KAAK,YAAY,CAAC,CAAC,CAAC,CACjE,KAAK,CAAC,GAAG,OAAO,GAAG,EAAE,KAAK,GAAG,CAAC,CAC9B,KAAK,IAAI,EAAE;GAGhB,MAAM,aAAa,WAAW,QAAQ,WAAW,mBAAA,CAC9C,QAAQ,OAAO,iBAAiB,GAAG,CAAC,CAAC,CACrC,QAAQ,OAAO,UAAU;GAE5B,gBAAgB,KAAK,UAAU;EACjC;CACF;CAGA,MAAM,aAAqC,CAAC;CAC5C,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,WAAW,KAAK,OAAO,MAAM,GAAG;EACtC,MAAM,WAAW,KAAK,OAAO,MAAM,GAAG;EACtC,MAAM,eAAe,SAClB,QAAQ,KAAK,MAAM,QAAQ,SAAS,EAAE,CAAC,CACvC,KAAK,GAAG;EACX,IAAI,CAAC,WAAW,eACd,WAAW,gBAAgB,CAAC;EAE9B,WAAW,aAAa,CAAC,KAAK,IAAI;CACpC;CAEA,MAAM,gCAAgB,IAAI,IAAY;CAGtC,SAAS,oBAAoB,UAA8B;EACzD,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC,MAAM,GAAG,MAAM;GAClC,OAAO,EAAE,MAAM,GAAG,CAAC,CAAC,SAAS,EAAE,MAAM,GAAG,CAAC,CAAC;EAC5C,CAAC;CACH;CAEA,SAAS,YAAY,OAAe,QAAsB;EACxD,MAAM,WAAW,MAAM,WAAW,KAAK,MAAM,EAAE,CAAC,WAAW,MAAM,EAAE,CAAC;EACpE,IAAI,UAAU,CAAC,UAAU;GACvB,MAAM,WAAW,OAAO,MAAM,GAAG,CAAC,CAAC,IAAI;GAEvC,IAAI,cAAc,IAAI,MAAM,GAC1B,MAAM,IAAI,MACR,6BAA6B,SAAS,QAAQ,OAAO,iJAGvD;GAGF,cAAc,IAAI,MAAM;GACxB,gBAAgB,cAAc,SAAS;EACzC;EAGA,MAAM,iBAAiB,oBACrB,OAAO,KAAK,UAAU,CAAC,CAAC,QACrB,iBACC,aAAa,WAAW,GAAG,OAAO,EAAE,KACpC,iBAAiB,UACjB,aAAa,MAAM,GAAG,CAAC,CAAC,WAAW,OAAO,MAAM,GAAG,CAAC,CAAC,SAAS,CAClE,CACF;EAEA,KAAK,MAAM,gBAAgB,gBACzB,YAAY,WAAW,eAAe,YAAY;EAGpD,KAAK,MAAM,QAAQ,OAAO;GACxB,MAAM,EAAE,QAAQ,QAAQ,MAAM,gBAAgB;GAE9C,IAAI,YAAY;GAChB,IAAI,SAAS,KAAA,GAAW;IACtB,IAAI,WAAW;IACf,MAAM,QAAQ,SAAS,MAAM,GAAG;IAChC,IAAI,MAAM,SAAS,iBACjB,WAAW,MAAM,KACf,EAAE,QAAQ,KAAK,KAAK,MAAM,SAAS,eAAe,EAAE,IACnD,GAAG,MACF,MACG,MAAM,IAAI,kBAAkB,IAAI,KAAK,eAAe,CAAC,CACrD,KAAK,GAAG,CACf,CAAC,CAAC,KAAK,kBAAkB;IAE3B,YAAY,cACR,aAAa,SAAS,eACtB,aAAa,SAAS;GAC5B,OACE,YAAY,cAAc,WAAW;GAGvC,gBAAgB,KAAK,iBACnB,MACF,IAAI,YAAY,iBAAiB,MAAM,EAAE;EAC3C;EAEA,IAAI,UAAU,CAAC,UACb,gBAAgB;CAEpB;CAGA,YAAY,WAAW,OAAO,CAAC,GAAG,EAAE;CAGpC,KAAK,MAAM,UAAU,YACnB,IAAI,CAAC,OAAO,SAAS,GAAG,KAAK,WAAW,IACtC,YAAY,WAAW,SAAS,MAAM;CAK1C,IAAI,YACF,gBAAgB,4BAA4B,cAAc,CAAC,CAAC;CAG9D,OAAO;AACT;;;;;;;;;;;;;;;;;AAkBA,eAAsB,iBACpB,eACA,QAQA;CACA,IAAI,kBAAkB,QAAQ,mBAAmB;CACjD,MAAM,YAAY,QAAQ,aAAa;CAEvC,MAAM,uBAAuBA,cAAAA,YAAY,aAAa;CAGtD,IAAI,oBAAoB,KAAA,GAElB;MAAA,CAAC,6BAAgB,KAAK,eAAe,GACvC,kBAAkB,IAAI;CAAA;CAG1B,MAAM,WAAW,2BAA2B,qBAAqB,WAAW,gBAAgB,QAAQ;CACpG,MAAM,MAAM,MAAM,MAAM,QAAQ;CAChC,IAAI,CAAC,IAAI,IACP,MAAM,IAAI,MACR;EACE;EACA,gBAAgB,IAAI;EACpB,gBAAgB,IAAI;CACtB,CAAC,CAAC,KAAK,IAAI,CACb;CAGF,OAAO,MADe,IAAI,KAAK;AAEjC"}
+{"version":3,"file":"graph_mermaid.cjs","names":["toBase64Url"],"sources":["../../src/runnables/graph_mermaid.ts"],"sourcesContent":["import { Edge, Node } from \"./types.js\";\nimport { toBase64Url } from \"./utils.js\";\n\nfunction _escapeNodeLabel(nodeLabel: string): string {\n  // Escapes the node label for Mermaid syntax.\n  return nodeLabel.replace(/[^a-zA-Z-_0-9]/g, \"_\");\n}\n\nconst MARKDOWN_SPECIAL_CHARS = [\"*\", \"_\", \"`\"];\n\nconst MERMAID_ENTITY_CODES: Record<string, string> = {\n  \"#\": \"#35;\",\n  \"[\": \"#91;\",\n  \"]\": \"#93;\",\n  \"(\": \"#40;\",\n  \")\": \"#41;\",\n  \"{\": \"#123;\",\n  \"}\": \"#125;\",\n  '\"': \"#quot;\",\n  \"<\": \"#60;\",\n  \">\": \"#62;\",\n  \"|\": \"#124;\",\n};\n\nfunction _escapeMetadataText(text: string): string {\n  return text.replace(/[#[\\](){}\"<>|]/g, (char) => MERMAID_ENTITY_CODES[char]);\n}\n\nfunction _isScalar(value: unknown): value is string | number | boolean {\n  return (\n    typeof value === \"string\" ||\n    typeof value === \"number\" ||\n    typeof value === \"boolean\"\n  );\n}\n\nfunction _formatMetadataValue(value: unknown): string | undefined {\n  if (_isScalar(value)) {\n    return String(value);\n  }\n  if (Array.isArray(value) && value.every(_isScalar)) {\n    return value.join(\",\");\n  }\n  return undefined;\n}\n\nfunction _generateMermaidGraphStyles(\n  nodeColors: Record<string, string>\n): string {\n  let styles = \"\";\n  for (const [className, color] of Object.entries(nodeColors)) {\n    styles += `\\tclassDef ${className} ${color};\\n`;\n  }\n  return styles;\n}\n\n/**\n * Draws a Mermaid graph using the provided graph data\n */\nexport function drawMermaid(\n  nodes: Record<string, Node>,\n  edges: Edge[],\n  config?: {\n    firstNode?: string;\n    lastNode?: string;\n    curveStyle?: string;\n    withStyles?: boolean;\n    nodeColors?: Record<string, string>;\n    wrapLabelNWords?: number;\n  }\n): string {\n  const {\n    firstNode,\n    lastNode,\n    nodeColors,\n    withStyles = true,\n    curveStyle = \"linear\",\n    wrapLabelNWords = 9,\n  } = config ?? {};\n  // Initialize Mermaid graph configuration\n  let mermaidGraph = withStyles\n    ? `%%{init: {'flowchart': {'curve': '${curveStyle}'}}}%%\\ngraph TD;\\n`\n    : \"graph TD;\\n\";\n  if (withStyles) {\n    // Node formatting templates\n    const defaultClassLabel = \"default\";\n    const formatDict: Record<string, string> = {\n      [defaultClassLabel]: \"{0}({1})\",\n    };\n    if (firstNode !== undefined) {\n      formatDict[firstNode] = \"{0}([{1}]):::first\";\n    }\n    if (lastNode !== undefined) {\n      formatDict[lastNode] = \"{0}([{1}]):::last\";\n    }\n\n    // Add nodes to the graph\n    for (const [key, node] of Object.entries(nodes)) {\n      const nodeName = node.name.split(\":\").pop() ?? \"\";\n      const label = MARKDOWN_SPECIAL_CHARS.some(\n        (char) => nodeName.startsWith(char) && nodeName.endsWith(char)\n      )\n        ? `<p>${nodeName}</p>`\n        : nodeName;\n\n      let finalLabel = label;\n      const metadataLines = Object.entries(node.metadata ?? {}).flatMap(\n        ([k, v]) => {\n          const value = _formatMetadataValue(v);\n          return value === undefined\n            ? []\n            : [_escapeMetadataText(`${k} = ${value}`)];\n        }\n      );\n      if (metadataLines.length) {\n        finalLabel += `<hr/><small><em>${metadataLines.join(\n          \"\\n\"\n        )}</em></small>`;\n      }\n\n      const nodeLabel = (formatDict[key] ?? formatDict[defaultClassLabel])\n        .replace(\"{0}\", _escapeNodeLabel(key))\n        .replace(\"{1}\", finalLabel);\n\n      mermaidGraph += `\\t${nodeLabel}\\n`;\n    }\n  }\n\n  // Group edges by their common prefixes\n  const edgeGroups: Record<string, Edge[]> = {};\n  for (const edge of edges) {\n    const srcParts = edge.source.split(\":\");\n    const tgtParts = edge.target.split(\":\");\n    const commonPrefix = srcParts\n      .filter((src, i) => src === tgtParts[i])\n      .join(\":\");\n    if (!edgeGroups[commonPrefix]) {\n      edgeGroups[commonPrefix] = [];\n    }\n    edgeGroups[commonPrefix].push(edge);\n  }\n\n  const seenSubgraphs = new Set<string>();\n\n  // sort prefixes by path length for correct nesting\n  function sortPrefixesByDepth(prefixes: string[]): string[] {\n    return [...prefixes].sort((a, b) => {\n      return a.split(\":\").length - b.split(\":\").length;\n    });\n  }\n\n  function addSubgraph(edges: Edge[], prefix: string): void {\n    const selfLoop = edges.length === 1 && edges[0].source === edges[0].target;\n    if (prefix && !selfLoop) {\n      const subgraph = prefix.split(\":\").pop()!;\n\n      if (seenSubgraphs.has(prefix)) {\n        throw new Error(\n          `Found duplicate subgraph '${subgraph}' at '${prefix} -- this likely means that ` +\n            \"you're reusing a subgraph node with the same name. \" +\n            \"Please adjust your graph to have subgraph nodes with unique names.\"\n        );\n      }\n\n      seenSubgraphs.add(prefix);\n      mermaidGraph += `\\tsubgraph ${subgraph}\\n`;\n    }\n\n    // all nested prefixes for this level, sorted by depth\n    const nestedPrefixes = sortPrefixesByDepth(\n      Object.keys(edgeGroups).filter(\n        (nestedPrefix) =>\n          nestedPrefix.startsWith(`${prefix}:`) &&\n          nestedPrefix !== prefix &&\n          nestedPrefix.split(\":\").length === prefix.split(\":\").length + 1\n      )\n    );\n\n    for (const nestedPrefix of nestedPrefixes) {\n      addSubgraph(edgeGroups[nestedPrefix], nestedPrefix);\n    }\n\n    for (const edge of edges) {\n      const { source, target, data, conditional } = edge;\n\n      let edgeLabel = \"\";\n      if (data !== undefined) {\n        let edgeData = data;\n        const words = edgeData.split(\" \");\n        if (words.length > wrapLabelNWords) {\n          edgeData = Array.from(\n            { length: Math.ceil(words.length / wrapLabelNWords) },\n            (_, i) =>\n              words\n                .slice(i * wrapLabelNWords, (i + 1) * wrapLabelNWords)\n                .join(\" \")\n          ).join(\"&nbsp;<br>&nbsp;\");\n        }\n        edgeLabel = conditional\n          ? ` -. &nbsp;${edgeData}&nbsp; .-> `\n          : ` -- &nbsp;${edgeData}&nbsp; --> `;\n      } else {\n        edgeLabel = conditional ? \" -.-> \" : \" --> \";\n      }\n\n      mermaidGraph += `\\t${_escapeNodeLabel(\n        source\n      )}${edgeLabel}${_escapeNodeLabel(target)};\\n`;\n    }\n\n    if (prefix && !selfLoop) {\n      mermaidGraph += \"\\tend\\n\";\n    }\n  }\n\n  // Start with the top-level edges (no common prefix)\n  addSubgraph(edgeGroups[\"\"] ?? [], \"\");\n\n  // Add remaining top-level subgraphs\n  for (const prefix in edgeGroups) {\n    if (!prefix.includes(\":\") && prefix !== \"\") {\n      addSubgraph(edgeGroups[prefix], prefix);\n    }\n  }\n\n  // Add custom styles for nodes\n  if (withStyles) {\n    mermaidGraph += _generateMermaidGraphStyles(nodeColors ?? {});\n  }\n\n  return mermaidGraph;\n}\n\n/**\n * Renders Mermaid graph using the Mermaid.INK API.\n *\n * @example\n * ```javascript\n * const image = await drawMermaidImage(mermaidSyntax, {\n *   backgroundColor: \"white\",\n *   imageType: \"png\",\n * });\n * fs.writeFileSync(\"image.png\", image);\n * ```\n *\n * @param mermaidSyntax - The Mermaid syntax to render.\n * @param config - The configuration for the image.\n * @returns The image as a Blob.\n */\nexport async function drawMermaidImage(\n  mermaidSyntax: string,\n  config?: {\n    /**\n     * The type of image to render.\n     * @default \"png\"\n     */\n    imageType?: \"png\" | \"jpeg\" | \"webp\";\n    backgroundColor?: string;\n  }\n) {\n  let backgroundColor = config?.backgroundColor ?? \"white\";\n  const imageType = config?.imageType ?? \"png\";\n\n  const mermaidSyntaxEncoded = toBase64Url(mermaidSyntax);\n\n  // Check if the background color is a hexadecimal color code using regex\n  if (backgroundColor !== undefined) {\n    const hexColorPattern = /^#(?:[0-9a-fA-F]{3}){1,2}$/;\n    if (!hexColorPattern.test(backgroundColor)) {\n      backgroundColor = `!${backgroundColor}`;\n    }\n  }\n  const imageUrl = `https://mermaid.ink/img/${mermaidSyntaxEncoded}?bgColor=${backgroundColor}&type=${imageType}`;\n  const res = await fetch(imageUrl);\n  if (!res.ok) {\n    throw new Error(\n      [\n        `Failed to render the graph using the Mermaid.INK API.`,\n        `Status code: ${res.status}`,\n        `Status text: ${res.statusText}`,\n      ].join(\"\\n\")\n    );\n  }\n  const content = await res.blob();\n  return content;\n}\n"],"mappings":";;AAGA,SAAS,iBAAiB,WAA2B;CAEnD,OAAO,UAAU,QAAQ,mBAAmB,GAAG;AACjD;AAEA,MAAM,yBAAyB;CAAC;CAAK;CAAK;AAAG;AAE7C,MAAM,uBAA+C;CACnD,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,MAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;AACP;AAEA,SAAS,oBAAoB,MAAsB;CACjD,OAAO,KAAK,QAAQ,oBAAoB,SAAS,qBAAqB,KAAK;AAC7E;AAEA,SAAS,UAAU,OAAoD;CACrE,OACE,OAAO,UAAU,YACjB,OAAO,UAAU,YACjB,OAAO,UAAU;AAErB;AAEA,SAAS,qBAAqB,OAAoC;CAChE,IAAI,UAAU,KAAK,GACjB,OAAO,OAAO,KAAK;CAErB,IAAI,MAAM,QAAQ,KAAK,KAAK,MAAM,MAAM,SAAS,GAC/C,OAAO,MAAM,KAAK,GAAG;AAGzB;AAEA,SAAS,4BACP,YACQ;CACR,IAAI,SAAS;CACb,KAAK,MAAM,CAAC,WAAW,UAAU,OAAO,QAAQ,UAAU,GACxD,UAAU,cAAc,UAAU,GAAG,MAAM;CAE7C,OAAO;AACT;;;;AAKA,SAAgB,YACd,OACA,OACA,QAQQ;CACR,MAAM,EACJ,WACA,UACA,YACA,aAAa,MACb,aAAa,UACb,kBAAkB,MAChB,UAAU,CAAC;CAEf,IAAI,eAAe,aACf,qCAAqC,WAAW,uBAChD;CACJ,IAAI,YAAY;EAEd,MAAM,oBAAoB;EAC1B,MAAM,aAAqC,GACxC,oBAAoB,WACvB;EACA,IAAI,cAAc,KAAA,GAChB,WAAW,aAAa;EAE1B,IAAI,aAAa,KAAA,GACf,WAAW,YAAY;EAIzB,KAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAAQ,KAAK,GAAG;GAC/C,MAAM,WAAW,KAAK,KAAK,MAAM,GAAG,CAAC,CAAC,IAAI,KAAK;GAO/C,IAAI,aANU,uBAAuB,MAClC,SAAS,SAAS,WAAW,IAAI,KAAK,SAAS,SAAS,IAAI,CAC/D,IACI,MAAM,SAAS,QACf;GAGJ,MAAM,gBAAgB,OAAO,QAAQ,KAAK,YAAY,CAAC,CAAC,CAAC,CAAC,SACvD,CAAC,GAAG,OAAO;IACV,MAAM,QAAQ,qBAAqB,CAAC;IACpC,OAAO,UAAU,KAAA,IACb,CAAC,IACD,CAAC,oBAAoB,GAAG,EAAE,KAAK,OAAO,CAAC;GAC7C,CACF;GACA,IAAI,cAAc,QAChB,cAAc,mBAAmB,cAAc,KAC7C,IACF,EAAE;GAGJ,MAAM,aAAa,WAAW,QAAQ,WAAW,mBAAA,CAC9C,QAAQ,OAAO,iBAAiB,GAAG,CAAC,CAAC,CACrC,QAAQ,OAAO,UAAU;GAE5B,gBAAgB,KAAK,UAAU;EACjC;CACF;CAGA,MAAM,aAAqC,CAAC;CAC5C,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,WAAW,KAAK,OAAO,MAAM,GAAG;EACtC,MAAM,WAAW,KAAK,OAAO,MAAM,GAAG;EACtC,MAAM,eAAe,SAClB,QAAQ,KAAK,MAAM,QAAQ,SAAS,EAAE,CAAC,CACvC,KAAK,GAAG;EACX,IAAI,CAAC,WAAW,eACd,WAAW,gBAAgB,CAAC;EAE9B,WAAW,aAAa,CAAC,KAAK,IAAI;CACpC;CAEA,MAAM,gCAAgB,IAAI,IAAY;CAGtC,SAAS,oBAAoB,UAA8B;EACzD,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC,MAAM,GAAG,MAAM;GAClC,OAAO,EAAE,MAAM,GAAG,CAAC,CAAC,SAAS,EAAE,MAAM,GAAG,CAAC,CAAC;EAC5C,CAAC;CACH;CAEA,SAAS,YAAY,OAAe,QAAsB;EACxD,MAAM,WAAW,MAAM,WAAW,KAAK,MAAM,EAAE,CAAC,WAAW,MAAM,EAAE,CAAC;EACpE,IAAI,UAAU,CAAC,UAAU;GACvB,MAAM,WAAW,OAAO,MAAM,GAAG,CAAC,CAAC,IAAI;GAEvC,IAAI,cAAc,IAAI,MAAM,GAC1B,MAAM,IAAI,MACR,6BAA6B,SAAS,QAAQ,OAAO,iJAGvD;GAGF,cAAc,IAAI,MAAM;GACxB,gBAAgB,cAAc,SAAS;EACzC;EAGA,MAAM,iBAAiB,oBACrB,OAAO,KAAK,UAAU,CAAC,CAAC,QACrB,iBACC,aAAa,WAAW,GAAG,OAAO,EAAE,KACpC,iBAAiB,UACjB,aAAa,MAAM,GAAG,CAAC,CAAC,WAAW,OAAO,MAAM,GAAG,CAAC,CAAC,SAAS,CAClE,CACF;EAEA,KAAK,MAAM,gBAAgB,gBACzB,YAAY,WAAW,eAAe,YAAY;EAGpD,KAAK,MAAM,QAAQ,OAAO;GACxB,MAAM,EAAE,QAAQ,QAAQ,MAAM,gBAAgB;GAE9C,IAAI,YAAY;GAChB,IAAI,SAAS,KAAA,GAAW;IACtB,IAAI,WAAW;IACf,MAAM,QAAQ,SAAS,MAAM,GAAG;IAChC,IAAI,MAAM,SAAS,iBACjB,WAAW,MAAM,KACf,EAAE,QAAQ,KAAK,KAAK,MAAM,SAAS,eAAe,EAAE,IACnD,GAAG,MACF,MACG,MAAM,IAAI,kBAAkB,IAAI,KAAK,eAAe,CAAC,CACrD,KAAK,GAAG,CACf,CAAC,CAAC,KAAK,kBAAkB;IAE3B,YAAY,cACR,aAAa,SAAS,eACtB,aAAa,SAAS;GAC5B,OACE,YAAY,cAAc,WAAW;GAGvC,gBAAgB,KAAK,iBACnB,MACF,IAAI,YAAY,iBAAiB,MAAM,EAAE;EAC3C;EAEA,IAAI,UAAU,CAAC,UACb,gBAAgB;CAEpB;CAGA,YAAY,WAAW,OAAO,CAAC,GAAG,EAAE;CAGpC,KAAK,MAAM,UAAU,YACnB,IAAI,CAAC,OAAO,SAAS,GAAG,KAAK,WAAW,IACtC,YAAY,WAAW,SAAS,MAAM;CAK1C,IAAI,YACF,gBAAgB,4BAA4B,cAAc,CAAC,CAAC;CAG9D,OAAO;AACT;;;;;;;;;;;;;;;;;AAkBA,eAAsB,iBACpB,eACA,QAQA;CACA,IAAI,kBAAkB,QAAQ,mBAAmB;CACjD,MAAM,YAAY,QAAQ,aAAa;CAEvC,MAAM,uBAAuBA,cAAAA,YAAY,aAAa;CAGtD,IAAI,oBAAoB,KAAA,GAElB;MAAA,CAAC,6BAAgB,KAAK,eAAe,GACvC,kBAAkB,IAAI;CAAA;CAG1B,MAAM,WAAW,2BAA2B,qBAAqB,WAAW,gBAAgB,QAAQ;CACpG,MAAM,MAAM,MAAM,MAAM,QAAQ;CAChC,IAAI,CAAC,IAAI,IACP,MAAM,IAAI,MACR;EACE;EACA,gBAAgB,IAAI;EACpB,gBAAgB,IAAI;CACtB,CAAC,CAAC,KAAK,IAAI,CACb;CAGF,OAAO,MADe,IAAI,KAAK;AAEjC"}

package/dist/runnables/graph_mermaid.js

@@ -8,6 +8,29 @@ const MARKDOWN_SPECIAL_CHARS = [
 	"_",
 	"`"
 ];
+const MERMAID_ENTITY_CODES = {
+	"#": "#35;",
+	"[": "#91;",
+	"]": "#93;",
+	"(": "#40;",
+	")": "#41;",
+	"{": "#123;",
+	"}": "#125;",
+	"\"": "#quot;",
+	"<": "#60;",
+	">": "#62;",
+	"|": "#124;"
+};
+function _escapeMetadataText(text) {
+	return text.replace(/[#[\](){}"<>|]/g, (char) => MERMAID_ENTITY_CODES[char]);
+}
+function _isScalar(value) {
+	return typeof value === "string" || typeof value === "number" || typeof value === "boolean";
+}
+function _formatMetadataValue(value) {
+	if (_isScalar(value)) return String(value);
+	if (Array.isArray(value) && value.every(_isScalar)) return value.join(",");
+}
 function _generateMermaidGraphStyles(nodeColors) {
 	let styles = "";
 	for (const [className, color] of Object.entries(nodeColors)) styles += `\tclassDef ${className} ${color};\n`;
@@ -27,7 +50,11 @@ function drawMermaid(nodes, edges, config) {
 		for (const [key, node] of Object.entries(nodes)) {
 			const nodeName = node.name.split(":").pop() ?? "";
 			let finalLabel = MARKDOWN_SPECIAL_CHARS.some((char) => nodeName.startsWith(char) && nodeName.endsWith(char)) ? `<p>${nodeName}</p>` : nodeName;
-			if (Object.keys(node.metadata ?? {}).length) finalLabel += `<hr/><small><em>${Object.entries(node.metadata ?? {}).map(([k, v]) => `${k} = ${v}`).join("\n")}</em></small>`;
+			const metadataLines = Object.entries(node.metadata ?? {}).flatMap(([k, v]) => {
+				const value = _formatMetadataValue(v);
+				return value === void 0 ? [] : [_escapeMetadataText(`${k} = ${value}`)];
+			});
+			if (metadataLines.length) finalLabel += `<hr/><small><em>${metadataLines.join("\n")}</em></small>`;
 			const nodeLabel = (formatDict[key] ?? formatDict[defaultClassLabel]).replace("{0}", _escapeNodeLabel(key)).replace("{1}", finalLabel);
 			mermaidGraph += `\t${nodeLabel}\n`;
 		}

package/dist/runnables/graph_mermaid.js.map

@@ -1 +1 @@
-{"version":3,"file":"graph_mermaid.js","names":[],"sources":["../../src/runnables/graph_mermaid.ts"],"sourcesContent":["import { Edge, Node } from \"./types.js\";\nimport { toBase64Url } from \"./utils.js\";\n\nfunction _escapeNodeLabel(nodeLabel: string): string {\n  // Escapes the node label for Mermaid syntax.\n  return nodeLabel.replace(/[^a-zA-Z-_0-9]/g, \"_\");\n}\n\nconst MARKDOWN_SPECIAL_CHARS = [\"*\", \"_\", \"`\"];\n\nfunction _generateMermaidGraphStyles(\n  nodeColors: Record<string, string>\n): string {\n  let styles = \"\";\n  for (const [className, color] of Object.entries(nodeColors)) {\n    styles += `\\tclassDef ${className} ${color};\\n`;\n  }\n  return styles;\n}\n\n/**\n * Draws a Mermaid graph using the provided graph data\n */\nexport function drawMermaid(\n  nodes: Record<string, Node>,\n  edges: Edge[],\n  config?: {\n    firstNode?: string;\n    lastNode?: string;\n    curveStyle?: string;\n    withStyles?: boolean;\n    nodeColors?: Record<string, string>;\n    wrapLabelNWords?: number;\n  }\n): string {\n  const {\n    firstNode,\n    lastNode,\n    nodeColors,\n    withStyles = true,\n    curveStyle = \"linear\",\n    wrapLabelNWords = 9,\n  } = config ?? {};\n  // Initialize Mermaid graph configuration\n  let mermaidGraph = withStyles\n    ? `%%{init: {'flowchart': {'curve': '${curveStyle}'}}}%%\\ngraph TD;\\n`\n    : \"graph TD;\\n\";\n  if (withStyles) {\n    // Node formatting templates\n    const defaultClassLabel = \"default\";\n    const formatDict: Record<string, string> = {\n      [defaultClassLabel]: \"{0}({1})\",\n    };\n    if (firstNode !== undefined) {\n      formatDict[firstNode] = \"{0}([{1}]):::first\";\n    }\n    if (lastNode !== undefined) {\n      formatDict[lastNode] = \"{0}([{1}]):::last\";\n    }\n\n    // Add nodes to the graph\n    for (const [key, node] of Object.entries(nodes)) {\n      const nodeName = node.name.split(\":\").pop() ?? \"\";\n      const label = MARKDOWN_SPECIAL_CHARS.some(\n        (char) => nodeName.startsWith(char) && nodeName.endsWith(char)\n      )\n        ? `<p>${nodeName}</p>`\n        : nodeName;\n\n      let finalLabel = label;\n      if (Object.keys(node.metadata ?? {}).length) {\n        finalLabel += `<hr/><small><em>${Object.entries(node.metadata ?? {})\n          .map(([k, v]) => `${k} = ${v}`)\n          .join(\"\\n\")}</em></small>`;\n      }\n\n      const nodeLabel = (formatDict[key] ?? formatDict[defaultClassLabel])\n        .replace(\"{0}\", _escapeNodeLabel(key))\n        .replace(\"{1}\", finalLabel);\n\n      mermaidGraph += `\\t${nodeLabel}\\n`;\n    }\n  }\n\n  // Group edges by their common prefixes\n  const edgeGroups: Record<string, Edge[]> = {};\n  for (const edge of edges) {\n    const srcParts = edge.source.split(\":\");\n    const tgtParts = edge.target.split(\":\");\n    const commonPrefix = srcParts\n      .filter((src, i) => src === tgtParts[i])\n      .join(\":\");\n    if (!edgeGroups[commonPrefix]) {\n      edgeGroups[commonPrefix] = [];\n    }\n    edgeGroups[commonPrefix].push(edge);\n  }\n\n  const seenSubgraphs = new Set<string>();\n\n  // sort prefixes by path length for correct nesting\n  function sortPrefixesByDepth(prefixes: string[]): string[] {\n    return [...prefixes].sort((a, b) => {\n      return a.split(\":\").length - b.split(\":\").length;\n    });\n  }\n\n  function addSubgraph(edges: Edge[], prefix: string): void {\n    const selfLoop = edges.length === 1 && edges[0].source === edges[0].target;\n    if (prefix && !selfLoop) {\n      const subgraph = prefix.split(\":\").pop()!;\n\n      if (seenSubgraphs.has(prefix)) {\n        throw new Error(\n          `Found duplicate subgraph '${subgraph}' at '${prefix} -- this likely means that ` +\n            \"you're reusing a subgraph node with the same name. \" +\n            \"Please adjust your graph to have subgraph nodes with unique names.\"\n        );\n      }\n\n      seenSubgraphs.add(prefix);\n      mermaidGraph += `\\tsubgraph ${subgraph}\\n`;\n    }\n\n    // all nested prefixes for this level, sorted by depth\n    const nestedPrefixes = sortPrefixesByDepth(\n      Object.keys(edgeGroups).filter(\n        (nestedPrefix) =>\n          nestedPrefix.startsWith(`${prefix}:`) &&\n          nestedPrefix !== prefix &&\n          nestedPrefix.split(\":\").length === prefix.split(\":\").length + 1\n      )\n    );\n\n    for (const nestedPrefix of nestedPrefixes) {\n      addSubgraph(edgeGroups[nestedPrefix], nestedPrefix);\n    }\n\n    for (const edge of edges) {\n      const { source, target, data, conditional } = edge;\n\n      let edgeLabel = \"\";\n      if (data !== undefined) {\n        let edgeData = data;\n        const words = edgeData.split(\" \");\n        if (words.length > wrapLabelNWords) {\n          edgeData = Array.from(\n            { length: Math.ceil(words.length / wrapLabelNWords) },\n            (_, i) =>\n              words\n                .slice(i * wrapLabelNWords, (i + 1) * wrapLabelNWords)\n                .join(\" \")\n          ).join(\"&nbsp;<br>&nbsp;\");\n        }\n        edgeLabel = conditional\n          ? ` -. &nbsp;${edgeData}&nbsp; .-> `\n          : ` -- &nbsp;${edgeData}&nbsp; --> `;\n      } else {\n        edgeLabel = conditional ? \" -.-> \" : \" --> \";\n      }\n\n      mermaidGraph += `\\t${_escapeNodeLabel(\n        source\n      )}${edgeLabel}${_escapeNodeLabel(target)};\\n`;\n    }\n\n    if (prefix && !selfLoop) {\n      mermaidGraph += \"\\tend\\n\";\n    }\n  }\n\n  // Start with the top-level edges (no common prefix)\n  addSubgraph(edgeGroups[\"\"] ?? [], \"\");\n\n  // Add remaining top-level subgraphs\n  for (const prefix in edgeGroups) {\n    if (!prefix.includes(\":\") && prefix !== \"\") {\n      addSubgraph(edgeGroups[prefix], prefix);\n    }\n  }\n\n  // Add custom styles for nodes\n  if (withStyles) {\n    mermaidGraph += _generateMermaidGraphStyles(nodeColors ?? {});\n  }\n\n  return mermaidGraph;\n}\n\n/**\n * Renders Mermaid graph using the Mermaid.INK API.\n *\n * @example\n * ```javascript\n * const image = await drawMermaidImage(mermaidSyntax, {\n *   backgroundColor: \"white\",\n *   imageType: \"png\",\n * });\n * fs.writeFileSync(\"image.png\", image);\n * ```\n *\n * @param mermaidSyntax - The Mermaid syntax to render.\n * @param config - The configuration for the image.\n * @returns The image as a Blob.\n */\nexport async function drawMermaidImage(\n  mermaidSyntax: string,\n  config?: {\n    /**\n     * The type of image to render.\n     * @default \"png\"\n     */\n    imageType?: \"png\" | \"jpeg\" | \"webp\";\n    backgroundColor?: string;\n  }\n) {\n  let backgroundColor = config?.backgroundColor ?? \"white\";\n  const imageType = config?.imageType ?? \"png\";\n\n  const mermaidSyntaxEncoded = toBase64Url(mermaidSyntax);\n\n  // Check if the background color is a hexadecimal color code using regex\n  if (backgroundColor !== undefined) {\n    const hexColorPattern = /^#(?:[0-9a-fA-F]{3}){1,2}$/;\n    if (!hexColorPattern.test(backgroundColor)) {\n      backgroundColor = `!${backgroundColor}`;\n    }\n  }\n  const imageUrl = `https://mermaid.ink/img/${mermaidSyntaxEncoded}?bgColor=${backgroundColor}&type=${imageType}`;\n  const res = await fetch(imageUrl);\n  if (!res.ok) {\n    throw new Error(\n      [\n        `Failed to render the graph using the Mermaid.INK API.`,\n        `Status code: ${res.status}`,\n        `Status text: ${res.statusText}`,\n      ].join(\"\\n\")\n    );\n  }\n  const content = await res.blob();\n  return content;\n}\n"],"mappings":";;AAGA,SAAS,iBAAiB,WAA2B;CAEnD,OAAO,UAAU,QAAQ,mBAAmB,GAAG;AACjD;AAEA,MAAM,yBAAyB;CAAC;CAAK;CAAK;AAAG;AAE7C,SAAS,4BACP,YACQ;CACR,IAAI,SAAS;CACb,KAAK,MAAM,CAAC,WAAW,UAAU,OAAO,QAAQ,UAAU,GACxD,UAAU,cAAc,UAAU,GAAG,MAAM;CAE7C,OAAO;AACT;;;;AAKA,SAAgB,YACd,OACA,OACA,QAQQ;CACR,MAAM,EACJ,WACA,UACA,YACA,aAAa,MACb,aAAa,UACb,kBAAkB,MAChB,UAAU,CAAC;CAEf,IAAI,eAAe,aACf,qCAAqC,WAAW,uBAChD;CACJ,IAAI,YAAY;EAEd,MAAM,oBAAoB;EAC1B,MAAM,aAAqC,GACxC,oBAAoB,WACvB;EACA,IAAI,cAAc,KAAA,GAChB,WAAW,aAAa;EAE1B,IAAI,aAAa,KAAA,GACf,WAAW,YAAY;EAIzB,KAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAAQ,KAAK,GAAG;GAC/C,MAAM,WAAW,KAAK,KAAK,MAAM,GAAG,CAAC,CAAC,IAAI,KAAK;GAO/C,IAAI,aANU,uBAAuB,MAClC,SAAS,SAAS,WAAW,IAAI,KAAK,SAAS,SAAS,IAAI,CAC/D,IACI,MAAM,SAAS,QACf;GAGJ,IAAI,OAAO,KAAK,KAAK,YAAY,CAAC,CAAC,CAAC,CAAC,QACnC,cAAc,mBAAmB,OAAO,QAAQ,KAAK,YAAY,CAAC,CAAC,CAAC,CACjE,KAAK,CAAC,GAAG,OAAO,GAAG,EAAE,KAAK,GAAG,CAAC,CAC9B,KAAK,IAAI,EAAE;GAGhB,MAAM,aAAa,WAAW,QAAQ,WAAW,mBAAA,CAC9C,QAAQ,OAAO,iBAAiB,GAAG,CAAC,CAAC,CACrC,QAAQ,OAAO,UAAU;GAE5B,gBAAgB,KAAK,UAAU;EACjC;CACF;CAGA,MAAM,aAAqC,CAAC;CAC5C,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,WAAW,KAAK,OAAO,MAAM,GAAG;EACtC,MAAM,WAAW,KAAK,OAAO,MAAM,GAAG;EACtC,MAAM,eAAe,SAClB,QAAQ,KAAK,MAAM,QAAQ,SAAS,EAAE,CAAC,CACvC,KAAK,GAAG;EACX,IAAI,CAAC,WAAW,eACd,WAAW,gBAAgB,CAAC;EAE9B,WAAW,aAAa,CAAC,KAAK,IAAI;CACpC;CAEA,MAAM,gCAAgB,IAAI,IAAY;CAGtC,SAAS,oBAAoB,UAA8B;EACzD,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC,MAAM,GAAG,MAAM;GAClC,OAAO,EAAE,MAAM,GAAG,CAAC,CAAC,SAAS,EAAE,MAAM,GAAG,CAAC,CAAC;EAC5C,CAAC;CACH;CAEA,SAAS,YAAY,OAAe,QAAsB;EACxD,MAAM,WAAW,MAAM,WAAW,KAAK,MAAM,EAAE,CAAC,WAAW,MAAM,EAAE,CAAC;EACpE,IAAI,UAAU,CAAC,UAAU;GACvB,MAAM,WAAW,OAAO,MAAM,GAAG,CAAC,CAAC,IAAI;GAEvC,IAAI,cAAc,IAAI,MAAM,GAC1B,MAAM,IAAI,MACR,6BAA6B,SAAS,QAAQ,OAAO,iJAGvD;GAGF,cAAc,IAAI,MAAM;GACxB,gBAAgB,cAAc,SAAS;EACzC;EAGA,MAAM,iBAAiB,oBACrB,OAAO,KAAK,UAAU,CAAC,CAAC,QACrB,iBACC,aAAa,WAAW,GAAG,OAAO,EAAE,KACpC,iBAAiB,UACjB,aAAa,MAAM,GAAG,CAAC,CAAC,WAAW,OAAO,MAAM,GAAG,CAAC,CAAC,SAAS,CAClE,CACF;EAEA,KAAK,MAAM,gBAAgB,gBACzB,YAAY,WAAW,eAAe,YAAY;EAGpD,KAAK,MAAM,QAAQ,OAAO;GACxB,MAAM,EAAE,QAAQ,QAAQ,MAAM,gBAAgB;GAE9C,IAAI,YAAY;GAChB,IAAI,SAAS,KAAA,GAAW;IACtB,IAAI,WAAW;IACf,MAAM,QAAQ,SAAS,MAAM,GAAG;IAChC,IAAI,MAAM,SAAS,iBACjB,WAAW,MAAM,KACf,EAAE,QAAQ,KAAK,KAAK,MAAM,SAAS,eAAe,EAAE,IACnD,GAAG,MACF,MACG,MAAM,IAAI,kBAAkB,IAAI,KAAK,eAAe,CAAC,CACrD,KAAK,GAAG,CACf,CAAC,CAAC,KAAK,kBAAkB;IAE3B,YAAY,cACR,aAAa,SAAS,eACtB,aAAa,SAAS;GAC5B,OACE,YAAY,cAAc,WAAW;GAGvC,gBAAgB,KAAK,iBACnB,MACF,IAAI,YAAY,iBAAiB,MAAM,EAAE;EAC3C;EAEA,IAAI,UAAU,CAAC,UACb,gBAAgB;CAEpB;CAGA,YAAY,WAAW,OAAO,CAAC,GAAG,EAAE;CAGpC,KAAK,MAAM,UAAU,YACnB,IAAI,CAAC,OAAO,SAAS,GAAG,KAAK,WAAW,IACtC,YAAY,WAAW,SAAS,MAAM;CAK1C,IAAI,YACF,gBAAgB,4BAA4B,cAAc,CAAC,CAAC;CAG9D,OAAO;AACT;;;;;;;;;;;;;;;;;AAkBA,eAAsB,iBACpB,eACA,QAQA;CACA,IAAI,kBAAkB,QAAQ,mBAAmB;CACjD,MAAM,YAAY,QAAQ,aAAa;CAEvC,MAAM,uBAAuB,YAAY,aAAa;CAGtD,IAAI,oBAAoB,KAAA,GAElB;MAAA,CAAC,6BAAgB,KAAK,eAAe,GACvC,kBAAkB,IAAI;CAAA;CAG1B,MAAM,WAAW,2BAA2B,qBAAqB,WAAW,gBAAgB,QAAQ;CACpG,MAAM,MAAM,MAAM,MAAM,QAAQ;CAChC,IAAI,CAAC,IAAI,IACP,MAAM,IAAI,MACR;EACE;EACA,gBAAgB,IAAI;EACpB,gBAAgB,IAAI;CACtB,CAAC,CAAC,KAAK,IAAI,CACb;CAGF,OAAO,MADe,IAAI,KAAK;AAEjC"}
+{"version":3,"file":"graph_mermaid.js","names":[],"sources":["../../src/runnables/graph_mermaid.ts"],"sourcesContent":["import { Edge, Node } from \"./types.js\";\nimport { toBase64Url } from \"./utils.js\";\n\nfunction _escapeNodeLabel(nodeLabel: string): string {\n  // Escapes the node label for Mermaid syntax.\n  return nodeLabel.replace(/[^a-zA-Z-_0-9]/g, \"_\");\n}\n\nconst MARKDOWN_SPECIAL_CHARS = [\"*\", \"_\", \"`\"];\n\nconst MERMAID_ENTITY_CODES: Record<string, string> = {\n  \"#\": \"#35;\",\n  \"[\": \"#91;\",\n  \"]\": \"#93;\",\n  \"(\": \"#40;\",\n  \")\": \"#41;\",\n  \"{\": \"#123;\",\n  \"}\": \"#125;\",\n  '\"': \"#quot;\",\n  \"<\": \"#60;\",\n  \">\": \"#62;\",\n  \"|\": \"#124;\",\n};\n\nfunction _escapeMetadataText(text: string): string {\n  return text.replace(/[#[\\](){}\"<>|]/g, (char) => MERMAID_ENTITY_CODES[char]);\n}\n\nfunction _isScalar(value: unknown): value is string | number | boolean {\n  return (\n    typeof value === \"string\" ||\n    typeof value === \"number\" ||\n    typeof value === \"boolean\"\n  );\n}\n\nfunction _formatMetadataValue(value: unknown): string | undefined {\n  if (_isScalar(value)) {\n    return String(value);\n  }\n  if (Array.isArray(value) && value.every(_isScalar)) {\n    return value.join(\",\");\n  }\n  return undefined;\n}\n\nfunction _generateMermaidGraphStyles(\n  nodeColors: Record<string, string>\n): string {\n  let styles = \"\";\n  for (const [className, color] of Object.entries(nodeColors)) {\n    styles += `\\tclassDef ${className} ${color};\\n`;\n  }\n  return styles;\n}\n\n/**\n * Draws a Mermaid graph using the provided graph data\n */\nexport function drawMermaid(\n  nodes: Record<string, Node>,\n  edges: Edge[],\n  config?: {\n    firstNode?: string;\n    lastNode?: string;\n    curveStyle?: string;\n    withStyles?: boolean;\n    nodeColors?: Record<string, string>;\n    wrapLabelNWords?: number;\n  }\n): string {\n  const {\n    firstNode,\n    lastNode,\n    nodeColors,\n    withStyles = true,\n    curveStyle = \"linear\",\n    wrapLabelNWords = 9,\n  } = config ?? {};\n  // Initialize Mermaid graph configuration\n  let mermaidGraph = withStyles\n    ? `%%{init: {'flowchart': {'curve': '${curveStyle}'}}}%%\\ngraph TD;\\n`\n    : \"graph TD;\\n\";\n  if (withStyles) {\n    // Node formatting templates\n    const defaultClassLabel = \"default\";\n    const formatDict: Record<string, string> = {\n      [defaultClassLabel]: \"{0}({1})\",\n    };\n    if (firstNode !== undefined) {\n      formatDict[firstNode] = \"{0}([{1}]):::first\";\n    }\n    if (lastNode !== undefined) {\n      formatDict[lastNode] = \"{0}([{1}]):::last\";\n    }\n\n    // Add nodes to the graph\n    for (const [key, node] of Object.entries(nodes)) {\n      const nodeName = node.name.split(\":\").pop() ?? \"\";\n      const label = MARKDOWN_SPECIAL_CHARS.some(\n        (char) => nodeName.startsWith(char) && nodeName.endsWith(char)\n      )\n        ? `<p>${nodeName}</p>`\n        : nodeName;\n\n      let finalLabel = label;\n      const metadataLines = Object.entries(node.metadata ?? {}).flatMap(\n        ([k, v]) => {\n          const value = _formatMetadataValue(v);\n          return value === undefined\n            ? []\n            : [_escapeMetadataText(`${k} = ${value}`)];\n        }\n      );\n      if (metadataLines.length) {\n        finalLabel += `<hr/><small><em>${metadataLines.join(\n          \"\\n\"\n        )}</em></small>`;\n      }\n\n      const nodeLabel = (formatDict[key] ?? formatDict[defaultClassLabel])\n        .replace(\"{0}\", _escapeNodeLabel(key))\n        .replace(\"{1}\", finalLabel);\n\n      mermaidGraph += `\\t${nodeLabel}\\n`;\n    }\n  }\n\n  // Group edges by their common prefixes\n  const edgeGroups: Record<string, Edge[]> = {};\n  for (const edge of edges) {\n    const srcParts = edge.source.split(\":\");\n    const tgtParts = edge.target.split(\":\");\n    const commonPrefix = srcParts\n      .filter((src, i) => src === tgtParts[i])\n      .join(\":\");\n    if (!edgeGroups[commonPrefix]) {\n      edgeGroups[commonPrefix] = [];\n    }\n    edgeGroups[commonPrefix].push(edge);\n  }\n\n  const seenSubgraphs = new Set<string>();\n\n  // sort prefixes by path length for correct nesting\n  function sortPrefixesByDepth(prefixes: string[]): string[] {\n    return [...prefixes].sort((a, b) => {\n      return a.split(\":\").length - b.split(\":\").length;\n    });\n  }\n\n  function addSubgraph(edges: Edge[], prefix: string): void {\n    const selfLoop = edges.length === 1 && edges[0].source === edges[0].target;\n    if (prefix && !selfLoop) {\n      const subgraph = prefix.split(\":\").pop()!;\n\n      if (seenSubgraphs.has(prefix)) {\n        throw new Error(\n          `Found duplicate subgraph '${subgraph}' at '${prefix} -- this likely means that ` +\n            \"you're reusing a subgraph node with the same name. \" +\n            \"Please adjust your graph to have subgraph nodes with unique names.\"\n        );\n      }\n\n      seenSubgraphs.add(prefix);\n      mermaidGraph += `\\tsubgraph ${subgraph}\\n`;\n    }\n\n    // all nested prefixes for this level, sorted by depth\n    const nestedPrefixes = sortPrefixesByDepth(\n      Object.keys(edgeGroups).filter(\n        (nestedPrefix) =>\n          nestedPrefix.startsWith(`${prefix}:`) &&\n          nestedPrefix !== prefix &&\n          nestedPrefix.split(\":\").length === prefix.split(\":\").length + 1\n      )\n    );\n\n    for (const nestedPrefix of nestedPrefixes) {\n      addSubgraph(edgeGroups[nestedPrefix], nestedPrefix);\n    }\n\n    for (const edge of edges) {\n      const { source, target, data, conditional } = edge;\n\n      let edgeLabel = \"\";\n      if (data !== undefined) {\n        let edgeData = data;\n        const words = edgeData.split(\" \");\n        if (words.length > wrapLabelNWords) {\n          edgeData = Array.from(\n            { length: Math.ceil(words.length / wrapLabelNWords) },\n            (_, i) =>\n              words\n                .slice(i * wrapLabelNWords, (i + 1) * wrapLabelNWords)\n                .join(\" \")\n          ).join(\"&nbsp;<br>&nbsp;\");\n        }\n        edgeLabel = conditional\n          ? ` -. &nbsp;${edgeData}&nbsp; .-> `\n          : ` -- &nbsp;${edgeData}&nbsp; --> `;\n      } else {\n        edgeLabel = conditional ? \" -.-> \" : \" --> \";\n      }\n\n      mermaidGraph += `\\t${_escapeNodeLabel(\n        source\n      )}${edgeLabel}${_escapeNodeLabel(target)};\\n`;\n    }\n\n    if (prefix && !selfLoop) {\n      mermaidGraph += \"\\tend\\n\";\n    }\n  }\n\n  // Start with the top-level edges (no common prefix)\n  addSubgraph(edgeGroups[\"\"] ?? [], \"\");\n\n  // Add remaining top-level subgraphs\n  for (const prefix in edgeGroups) {\n    if (!prefix.includes(\":\") && prefix !== \"\") {\n      addSubgraph(edgeGroups[prefix], prefix);\n    }\n  }\n\n  // Add custom styles for nodes\n  if (withStyles) {\n    mermaidGraph += _generateMermaidGraphStyles(nodeColors ?? {});\n  }\n\n  return mermaidGraph;\n}\n\n/**\n * Renders Mermaid graph using the Mermaid.INK API.\n *\n * @example\n * ```javascript\n * const image = await drawMermaidImage(mermaidSyntax, {\n *   backgroundColor: \"white\",\n *   imageType: \"png\",\n * });\n * fs.writeFileSync(\"image.png\", image);\n * ```\n *\n * @param mermaidSyntax - The Mermaid syntax to render.\n * @param config - The configuration for the image.\n * @returns The image as a Blob.\n */\nexport async function drawMermaidImage(\n  mermaidSyntax: string,\n  config?: {\n    /**\n     * The type of image to render.\n     * @default \"png\"\n     */\n    imageType?: \"png\" | \"jpeg\" | \"webp\";\n    backgroundColor?: string;\n  }\n) {\n  let backgroundColor = config?.backgroundColor ?? \"white\";\n  const imageType = config?.imageType ?? \"png\";\n\n  const mermaidSyntaxEncoded = toBase64Url(mermaidSyntax);\n\n  // Check if the background color is a hexadecimal color code using regex\n  if (backgroundColor !== undefined) {\n    const hexColorPattern = /^#(?:[0-9a-fA-F]{3}){1,2}$/;\n    if (!hexColorPattern.test(backgroundColor)) {\n      backgroundColor = `!${backgroundColor}`;\n    }\n  }\n  const imageUrl = `https://mermaid.ink/img/${mermaidSyntaxEncoded}?bgColor=${backgroundColor}&type=${imageType}`;\n  const res = await fetch(imageUrl);\n  if (!res.ok) {\n    throw new Error(\n      [\n        `Failed to render the graph using the Mermaid.INK API.`,\n        `Status code: ${res.status}`,\n        `Status text: ${res.statusText}`,\n      ].join(\"\\n\")\n    );\n  }\n  const content = await res.blob();\n  return content;\n}\n"],"mappings":";;AAGA,SAAS,iBAAiB,WAA2B;CAEnD,OAAO,UAAU,QAAQ,mBAAmB,GAAG;AACjD;AAEA,MAAM,yBAAyB;CAAC;CAAK;CAAK;AAAG;AAE7C,MAAM,uBAA+C;CACnD,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;CACL,MAAK;CACL,KAAK;CACL,KAAK;CACL,KAAK;AACP;AAEA,SAAS,oBAAoB,MAAsB;CACjD,OAAO,KAAK,QAAQ,oBAAoB,SAAS,qBAAqB,KAAK;AAC7E;AAEA,SAAS,UAAU,OAAoD;CACrE,OACE,OAAO,UAAU,YACjB,OAAO,UAAU,YACjB,OAAO,UAAU;AAErB;AAEA,SAAS,qBAAqB,OAAoC;CAChE,IAAI,UAAU,KAAK,GACjB,OAAO,OAAO,KAAK;CAErB,IAAI,MAAM,QAAQ,KAAK,KAAK,MAAM,MAAM,SAAS,GAC/C,OAAO,MAAM,KAAK,GAAG;AAGzB;AAEA,SAAS,4BACP,YACQ;CACR,IAAI,SAAS;CACb,KAAK,MAAM,CAAC,WAAW,UAAU,OAAO,QAAQ,UAAU,GACxD,UAAU,cAAc,UAAU,GAAG,MAAM;CAE7C,OAAO;AACT;;;;AAKA,SAAgB,YACd,OACA,OACA,QAQQ;CACR,MAAM,EACJ,WACA,UACA,YACA,aAAa,MACb,aAAa,UACb,kBAAkB,MAChB,UAAU,CAAC;CAEf,IAAI,eAAe,aACf,qCAAqC,WAAW,uBAChD;CACJ,IAAI,YAAY;EAEd,MAAM,oBAAoB;EAC1B,MAAM,aAAqC,GACxC,oBAAoB,WACvB;EACA,IAAI,cAAc,KAAA,GAChB,WAAW,aAAa;EAE1B,IAAI,aAAa,KAAA,GACf,WAAW,YAAY;EAIzB,KAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAAQ,KAAK,GAAG;GAC/C,MAAM,WAAW,KAAK,KAAK,MAAM,GAAG,CAAC,CAAC,IAAI,KAAK;GAO/C,IAAI,aANU,uBAAuB,MAClC,SAAS,SAAS,WAAW,IAAI,KAAK,SAAS,SAAS,IAAI,CAC/D,IACI,MAAM,SAAS,QACf;GAGJ,MAAM,gBAAgB,OAAO,QAAQ,KAAK,YAAY,CAAC,CAAC,CAAC,CAAC,SACvD,CAAC,GAAG,OAAO;IACV,MAAM,QAAQ,qBAAqB,CAAC;IACpC,OAAO,UAAU,KAAA,IACb,CAAC,IACD,CAAC,oBAAoB,GAAG,EAAE,KAAK,OAAO,CAAC;GAC7C,CACF;GACA,IAAI,cAAc,QAChB,cAAc,mBAAmB,cAAc,KAC7C,IACF,EAAE;GAGJ,MAAM,aAAa,WAAW,QAAQ,WAAW,mBAAA,CAC9C,QAAQ,OAAO,iBAAiB,GAAG,CAAC,CAAC,CACrC,QAAQ,OAAO,UAAU;GAE5B,gBAAgB,KAAK,UAAU;EACjC;CACF;CAGA,MAAM,aAAqC,CAAC;CAC5C,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,WAAW,KAAK,OAAO,MAAM,GAAG;EACtC,MAAM,WAAW,KAAK,OAAO,MAAM,GAAG;EACtC,MAAM,eAAe,SAClB,QAAQ,KAAK,MAAM,QAAQ,SAAS,EAAE,CAAC,CACvC,KAAK,GAAG;EACX,IAAI,CAAC,WAAW,eACd,WAAW,gBAAgB,CAAC;EAE9B,WAAW,aAAa,CAAC,KAAK,IAAI;CACpC;CAEA,MAAM,gCAAgB,IAAI,IAAY;CAGtC,SAAS,oBAAoB,UAA8B;EACzD,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC,MAAM,GAAG,MAAM;GAClC,OAAO,EAAE,MAAM,GAAG,CAAC,CAAC,SAAS,EAAE,MAAM,GAAG,CAAC,CAAC;EAC5C,CAAC;CACH;CAEA,SAAS,YAAY,OAAe,QAAsB;EACxD,MAAM,WAAW,MAAM,WAAW,KAAK,MAAM,EAAE,CAAC,WAAW,MAAM,EAAE,CAAC;EACpE,IAAI,UAAU,CAAC,UAAU;GACvB,MAAM,WAAW,OAAO,MAAM,GAAG,CAAC,CAAC,IAAI;GAEvC,IAAI,cAAc,IAAI,MAAM,GAC1B,MAAM,IAAI,MACR,6BAA6B,SAAS,QAAQ,OAAO,iJAGvD;GAGF,cAAc,IAAI,MAAM;GACxB,gBAAgB,cAAc,SAAS;EACzC;EAGA,MAAM,iBAAiB,oBACrB,OAAO,KAAK,UAAU,CAAC,CAAC,QACrB,iBACC,aAAa,WAAW,GAAG,OAAO,EAAE,KACpC,iBAAiB,UACjB,aAAa,MAAM,GAAG,CAAC,CAAC,WAAW,OAAO,MAAM,GAAG,CAAC,CAAC,SAAS,CAClE,CACF;EAEA,KAAK,MAAM,gBAAgB,gBACzB,YAAY,WAAW,eAAe,YAAY;EAGpD,KAAK,MAAM,QAAQ,OAAO;GACxB,MAAM,EAAE,QAAQ,QAAQ,MAAM,gBAAgB;GAE9C,IAAI,YAAY;GAChB,IAAI,SAAS,KAAA,GAAW;IACtB,IAAI,WAAW;IACf,MAAM,QAAQ,SAAS,MAAM,GAAG;IAChC,IAAI,MAAM,SAAS,iBACjB,WAAW,MAAM,KACf,EAAE,QAAQ,KAAK,KAAK,MAAM,SAAS,eAAe,EAAE,IACnD,GAAG,MACF,MACG,MAAM,IAAI,kBAAkB,IAAI,KAAK,eAAe,CAAC,CACrD,KAAK,GAAG,CACf,CAAC,CAAC,KAAK,kBAAkB;IAE3B,YAAY,cACR,aAAa,SAAS,eACtB,aAAa,SAAS;GAC5B,OACE,YAAY,cAAc,WAAW;GAGvC,gBAAgB,KAAK,iBACnB,MACF,IAAI,YAAY,iBAAiB,MAAM,EAAE;EAC3C;EAEA,IAAI,UAAU,CAAC,UACb,gBAAgB;CAEpB;CAGA,YAAY,WAAW,OAAO,CAAC,GAAG,EAAE;CAGpC,KAAK,MAAM,UAAU,YACnB,IAAI,CAAC,OAAO,SAAS,GAAG,KAAK,WAAW,IACtC,YAAY,WAAW,SAAS,MAAM;CAK1C,IAAI,YACF,gBAAgB,4BAA4B,cAAc,CAAC,CAAC;CAG9D,OAAO;AACT;;;;;;;;;;;;;;;;;AAkBA,eAAsB,iBACpB,eACA,QAQA;CACA,IAAI,kBAAkB,QAAQ,mBAAmB;CACjD,MAAM,YAAY,QAAQ,aAAa;CAEvC,MAAM,uBAAuB,YAAY,aAAa;CAGtD,IAAI,oBAAoB,KAAA,GAElB;MAAA,CAAC,6BAAgB,KAAK,eAAe,GACvC,kBAAkB,IAAI;CAAA;CAG1B,MAAM,WAAW,2BAA2B,qBAAqB,WAAW,gBAAgB,QAAQ;CACpG,MAAM,MAAM,MAAM,MAAM,QAAQ;CAChC,IAAI,CAAC,IAAI,IACP,MAAM,IAAI,MACR;EACE;EACA,gBAAgB,IAAI;EACpB,gBAAgB,IAAI;CACtB,CAAC,CAAC,KAAK,IAAI,CACb;CAGF,OAAO,MADe,IAAI,KAAK;AAEjC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@langchain/core",
-  "version": "1.3.0",
+  "version": "1.3.2",
   "description": "Core LangChain.js abstractions and schemas",
   "type": "module",
   "engines": {