@langchain/core 0.3.72 → 1.0.0-alpha.2

package/dist/runnables/graph.d.ts

@@ -1,44 +1,52 @@
-import type { RunnableInterface, RunnableIOSchema, Node, Edge } from "./types.js";
-export { Node, Edge };
-export declare class Graph {
+import { Edge, Node, RunnableConfig, RunnableIOSchema, RunnableInterface } from "./types.js";
+
+//#region src/runnables/graph.d.ts
+declare class Graph {
+  nodes: Record<string, Node>;
+  edges: Edge[];
+  constructor(params?: {
     nodes: Record<string, Node>;
     edges: Edge[];
-    constructor(params?: {
-        nodes: Record<string, Node>;
-        edges: Edge[];
-    });
-    toJSON(): Record<string, any>;
-    addNode(data: RunnableInterface | RunnableIOSchema, id?: string, metadata?: Record<string, any>): Node;
-    removeNode(node: Node): void;
-    addEdge(source: Node, target: Node, data?: string, conditional?: boolean): Edge;
-    firstNode(): Node | undefined;
-    lastNode(): Node | undefined;
-    /**
-     * Add all nodes and edges from another graph.
-     * Note this doesn't check for duplicates, nor does it connect the graphs.
-     */
-    extend(graph: Graph, prefix?: string): ({
-        id: string;
-        data: RunnableIOSchema | RunnableInterface<any, any, import("./types.js").RunnableConfig<Record<string, any>>>;
-    } | undefined)[];
-    trimFirstNode(): void;
-    trimLastNode(): void;
-    /**
-     * Return a new graph with all nodes re-identified,
-     * using their unique, readable names where possible.
-     */
-    reid(): Graph;
-    drawMermaid(params?: {
-        withStyles?: boolean;
-        curveStyle?: string;
-        nodeColors?: Record<string, string>;
-        wrapLabelNWords?: number;
-    }): string;
-    drawMermaidPng(params?: {
-        withStyles?: boolean;
-        curveStyle?: string;
-        nodeColors?: Record<string, string>;
-        wrapLabelNWords?: number;
-        backgroundColor?: string;
-    }): Promise<Blob>;
+  });
+  // Convert the graph to a JSON-serializable format.
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  toJSON(): Record<string, any>;
+  addNode(data: RunnableInterface | RunnableIOSchema, id?: string,
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  metadata?: Record<string, any>): Node;
+  removeNode(node: Node): void;
+  addEdge(source: Node, target: Node, data?: string, conditional?: boolean): Edge;
+  firstNode(): Node | undefined;
+  lastNode(): Node | undefined;
+  /**
+   * Add all nodes and edges from another graph.
+   * Note this doesn't check for duplicates, nor does it connect the graphs.
+   */
+  extend(graph: Graph, prefix?: string): ({
+    id: string;
+    data: RunnableIOSchema | RunnableInterface<any, any, RunnableConfig<Record<string, any>>>;
+  } | undefined)[];
+  trimFirstNode(): void;
+  trimLastNode(): void;
+  /**
+   * Return a new graph with all nodes re-identified,
+   * using their unique, readable names where possible.
+   */
+  reid(): Graph;
+  drawMermaid(params?: {
+    withStyles?: boolean;
+    curveStyle?: string;
+    nodeColors?: Record<string, string>;
+    wrapLabelNWords?: number;
+  }): string;
+  drawMermaidPng(params?: {
+    withStyles?: boolean;
+    curveStyle?: string;
+    nodeColors?: Record<string, string>;
+    wrapLabelNWords?: number;
+    backgroundColor?: string;
+  }): Promise<Blob>;
 }
+//#endregion
+export { Edge, Graph, Node };
+//# sourceMappingURL=graph.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graph.d.ts","names":["RunnableInterface","RunnableIOSchema","Node","Edge","Graph","Record","__types_js0","RunnableConfig","Blob","Promise"],"sources":["../../src/runnables/graph.d.ts"],"sourcesContent":["import type { RunnableInterface, RunnableIOSchema, Node, Edge } from \"./types.js\";\nexport { Node, Edge };\nexport declare class Graph {\n    nodes: Record<string, Node>;\n    edges: Edge[];\n    constructor(params?: {\n        nodes: Record<string, Node>;\n        edges: Edge[];\n    });\n    // Convert the graph to a JSON-serializable format.\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    toJSON(): Record<string, any>;\n    addNode(data: RunnableInterface | RunnableIOSchema, id?: string, \n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    metadata?: Record<string, any>): Node;\n    removeNode(node: Node): void;\n    addEdge(source: Node, target: Node, data?: string, conditional?: boolean): Edge;\n    firstNode(): Node | undefined;\n    lastNode(): Node | undefined;\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?: string): ({\n        id: string;\n        data: RunnableIOSchema | RunnableInterface<any, any, import(\"./types.js\").RunnableConfig<Record<string, any>>>;\n    } | undefined)[];\n    trimFirstNode(): void;\n    trimLastNode(): void;\n    /**\n     * Return a new graph with all nodes re-identified,\n     * using their unique, readable names where possible.\n     */\n    reid(): Graph;\n    drawMermaid(params?: {\n        withStyles?: boolean;\n        curveStyle?: string;\n        nodeColors?: Record<string, string>;\n        wrapLabelNWords?: number;\n    }): string;\n    drawMermaidPng(params?: {\n        withStyles?: boolean;\n        curveStyle?: string;\n        nodeColors?: Record<string, string>;\n        wrapLabelNWords?: number;\n        backgroundColor?: string;\n    }): Promise<Blob>;\n}\n"],"mappings":";;;cAEqBI,KAAAA;EAAAA,KAAAA,EACVC,MADe,CAAA,MAAA,EACAH,IADA,CAAA;EAAA,KAAA,EAEfC,IAFe,EAAA;EAAA,WACAD,CAAAA,MACX,CADWA,EAAAA;IAAfG,KAAAA,EAGIA,MAHJA,CAAAA,MAAAA,EAGmBH,IAHnBG,CAAAA;IACAF,KAAAA,EAGIA,IAHJA,EAAAA;EAAI,CAAA;EAEmB;EAAb;EACF,MAILE,CAAAA,CAAAA,EAAAA,MAAAA,CAAAA,MAAAA,EAAAA,GAAAA,CAAAA;EAAM,OACFL,CAAAA,IAAAA,EAAAA,iBAAAA,GAAoBC,gBAApBD,EAAAA,EAAAA,CAAAA,EAAAA,MAAAA;EAAiB;EAAmB,QAEvCK,CAAAA,EAAAA,MAAAA,CAAAA,MAAAA,EAAAA,GAAAA,CAAAA,CAAAA,EAAsBH,IAAtBG;EAAM,UAAgBH,CAAAA,IAAAA,EAChBA,IADgBA,CAAAA,EAAAA,IAAAA;EAAI,OACpBA,CAAAA,MAAAA,EACDA,IADCA,EAAAA,MAAAA,EACaA,IADbA,EAAAA,IAAAA,CAAAA,EAAAA,MAAAA,EAAAA,WAAAA,CAAAA,EAAAA,OAAAA,CAAAA,EAC0DC,IAD1DD;EAAI,SACLA,CAAAA,CAAAA,EACHA,IADGA,GAAAA,SAAAA;EAAI,QAAUA,CAAAA,CAAAA,EAElBA,IAFkBA,GAAAA,SAAAA;EAAI;;;;EAOf,MAETD,CAAAA,KAAAA,EAFIG,KAEJH,EAAAA,MAAAA,CAAAA,EAAAA,MAAAA,CAAAA,EAAAA,CAAAA;IAAmFI,EAAAA,EAAAA,MAAAA;IAAM,IAAA,EAAzFJ,gBAAyF,GAAtED,iBAAsE,CAAA,GAAA,EAAA,GAAA,EAAA,cAAA,CAANK,MAAM,CAAA,MAAA,EAAA,GAAA,CAAA,CAAA,CAAA;EAAP,CAAA,GAA/DL,SAAAA,CAAAA,EAAAA;EAAiB,aAQtCI,CAAAA,CAAAA,EAAAA,IAAAA;EAAK,YAIIC,CAAAA,CAAAA,EAAAA,IAAAA;EAAM;;;AASZ;UAbHD;;;;iBAISC;;;;;;iBAMAA;;;MAGbI,QAAQD"}

package/dist/runnables/graph.js

@@ -1,266 +1,219 @@
-import { v4 as uuidv4, validate as isUuid } from "uuid";
+import { __export } from "../_virtual/rolldown_runtime.js";
 import { isRunnableInterface } from "./utils.js";
 import { drawMermaid, drawMermaidPng } from "./graph_mermaid.js";
 import { toJsonSchema } from "../utils/json_schema.js";
+import { v4, validate } from "uuid";
+
+//#region src/runnables/graph.ts
+var graph_exports = {};
+__export(graph_exports, { Graph: () => Graph });
 function nodeDataStr(id, data) {
-    if (id !== undefined && !isUuid(id)) {
-        return id;
-    }
-    else if (isRunnableInterface(data)) {
-        try {
-            let dataStr = data.getName();
-            dataStr = dataStr.startsWith("Runnable")
-                ? dataStr.slice("Runnable".length)
-                : dataStr;
-            return dataStr;
-        }
-        catch (error) {
-            return data.getName();
-        }
-    }
-    else {
-        return data.name ?? "UnknownSchema";
-    }
+	if (id !== void 0 && !validate(id)) return id;
+	else if (isRunnableInterface(data)) try {
+		let dataStr = data.getName();
+		dataStr = dataStr.startsWith("Runnable") ? dataStr.slice(8) : dataStr;
+		return dataStr;
+	} catch (error) {
+		return data.getName();
+	}
+	else return data.name ?? "UnknownSchema";
 }
 function nodeDataJson(node) {
-    // if node.data implements Runnable
-    if (isRunnableInterface(node.data)) {
-        return {
-            type: "runnable",
-            data: {
-                id: node.data.lc_id,
-                name: node.data.getName(),
-            },
-        };
-    }
-    else {
-        return {
-            type: "schema",
-            data: { ...toJsonSchema(node.data.schema), title: node.data.name },
-        };
-    }
-}
-export class Graph {
-    constructor(params) {
-        Object.defineProperty(this, "nodes", {
-            enumerable: true,
-            configurable: true,
-            writable: true,
-            value: {}
-        });
-        Object.defineProperty(this, "edges", {
-            enumerable: true,
-            configurable: true,
-            writable: true,
-            value: []
-        });
-        this.nodes = params?.nodes ?? this.nodes;
-        this.edges = params?.edges ?? this.edges;
-    }
-    // Convert the graph to a JSON-serializable format.
-    // eslint-disable-next-line @typescript-eslint/no-explicit-any
-    toJSON() {
-        const stableNodeIds = {};
-        Object.values(this.nodes).forEach((node, i) => {
-            stableNodeIds[node.id] = isUuid(node.id) ? i : node.id;
-        });
-        return {
-            nodes: Object.values(this.nodes).map((node) => ({
-                id: stableNodeIds[node.id],
-                ...nodeDataJson(node),
-            })),
-            edges: this.edges.map((edge) => {
-                const item = {
-                    source: stableNodeIds[edge.source],
-                    target: stableNodeIds[edge.target],
-                };
-                if (typeof edge.data !== "undefined") {
-                    item.data = edge.data;
-                }
-                if (typeof edge.conditional !== "undefined") {
-                    item.conditional = edge.conditional;
-                }
-                return item;
-            }),
-        };
-    }
-    addNode(data, id, 
-    // eslint-disable-next-line @typescript-eslint/no-explicit-any
-    metadata) {
-        if (id !== undefined && this.nodes[id] !== undefined) {
-            throw new Error(`Node with id ${id} already exists`);
-        }
-        const nodeId = id ?? uuidv4();
-        const node = {
-            id: nodeId,
-            data,
-            name: nodeDataStr(id, data),
-            metadata,
-        };
-        this.nodes[nodeId] = node;
-        return node;
-    }
-    removeNode(node) {
-        // Remove the node from the nodes map
-        delete this.nodes[node.id];
-        // Filter out edges connected to the node
-        this.edges = this.edges.filter((edge) => edge.source !== node.id && edge.target !== node.id);
-    }
-    addEdge(source, target, data, conditional) {
-        if (this.nodes[source.id] === undefined) {
-            throw new Error(`Source node ${source.id} not in graph`);
-        }
-        if (this.nodes[target.id] === undefined) {
-            throw new Error(`Target node ${target.id} not in graph`);
-        }
-        const edge = {
-            source: source.id,
-            target: target.id,
-            data,
-            conditional,
-        };
-        this.edges.push(edge);
-        return edge;
-    }
-    firstNode() {
-        return _firstNode(this);
-    }
-    lastNode() {
-        return _lastNode(this);
-    }
-    /**
-     * Add all nodes and edges from another graph.
-     * Note this doesn't check for duplicates, nor does it connect the graphs.
-     */
-    extend(graph, prefix = "") {
-        let finalPrefix = prefix;
-        const nodeIds = Object.values(graph.nodes).map((node) => node.id);
-        if (nodeIds.every(isUuid)) {
-            finalPrefix = "";
-        }
-        const prefixed = (id) => {
-            return finalPrefix ? `${finalPrefix}:${id}` : id;
-        };
-        Object.entries(graph.nodes).forEach(([key, value]) => {
-            this.nodes[prefixed(key)] = { ...value, id: prefixed(key) };
-        });
-        const newEdges = graph.edges.map((edge) => {
-            return {
-                ...edge,
-                source: prefixed(edge.source),
-                target: prefixed(edge.target),
-            };
-        });
-        // Add all edges from the other graph
-        this.edges = [...this.edges, ...newEdges];
-        const first = graph.firstNode();
-        const last = graph.lastNode();
-        return [
-            first ? { id: prefixed(first.id), data: first.data } : undefined,
-            last ? { id: prefixed(last.id), data: last.data } : undefined,
-        ];
-    }
-    trimFirstNode() {
-        const firstNode = this.firstNode();
-        if (firstNode && _firstNode(this, [firstNode.id])) {
-            this.removeNode(firstNode);
-        }
-    }
-    trimLastNode() {
-        const lastNode = this.lastNode();
-        if (lastNode && _lastNode(this, [lastNode.id])) {
-            this.removeNode(lastNode);
-        }
-    }
-    /**
-     * Return a new graph with all nodes re-identified,
-     * using their unique, readable names where possible.
-     */
-    reid() {
-        const nodeLabels = Object.fromEntries(Object.values(this.nodes).map((node) => [node.id, node.name]));
-        const nodeLabelCounts = new Map();
-        Object.values(nodeLabels).forEach((label) => {
-            nodeLabelCounts.set(label, (nodeLabelCounts.get(label) || 0) + 1);
-        });
-        const getNodeId = (nodeId) => {
-            const label = nodeLabels[nodeId];
-            if (isUuid(nodeId) && nodeLabelCounts.get(label) === 1) {
-                return label;
-            }
-            else {
-                return nodeId;
-            }
-        };
-        return new Graph({
-            nodes: Object.fromEntries(Object.entries(this.nodes).map(([id, node]) => [
-                getNodeId(id),
-                { ...node, id: getNodeId(id) },
-            ])),
-            edges: this.edges.map((edge) => ({
-                ...edge,
-                source: getNodeId(edge.source),
-                target: getNodeId(edge.target),
-            })),
-        });
-    }
-    drawMermaid(params) {
-        const { withStyles, curveStyle, nodeColors = {
-            default: "fill:#f2f0ff,line-height:1.2",
-            first: "fill-opacity:0",
-            last: "fill:#bfb6fc",
-        }, wrapLabelNWords, } = params ?? {};
-        const graph = this.reid();
-        const firstNode = graph.firstNode();
-        const lastNode = graph.lastNode();
-        return drawMermaid(graph.nodes, graph.edges, {
-            firstNode: firstNode?.id,
-            lastNode: lastNode?.id,
-            withStyles,
-            curveStyle,
-            nodeColors,
-            wrapLabelNWords,
-        });
-    }
-    async drawMermaidPng(params) {
-        const mermaidSyntax = this.drawMermaid(params);
-        return drawMermaidPng(mermaidSyntax, {
-            backgroundColor: params?.backgroundColor,
-        });
-    }
+	if (isRunnableInterface(node.data)) return {
+		type: "runnable",
+		data: {
+			id: node.data.lc_id,
+			name: node.data.getName()
+		}
+	};
+	else return {
+		type: "schema",
+		data: {
+			...toJsonSchema(node.data.schema),
+			title: node.data.name
+		}
+	};
 }
+var Graph = class Graph {
+	nodes = {};
+	edges = [];
+	constructor(params) {
+		this.nodes = params?.nodes ?? this.nodes;
+		this.edges = params?.edges ?? this.edges;
+	}
+	toJSON() {
+		const stableNodeIds = {};
+		Object.values(this.nodes).forEach((node, i) => {
+			stableNodeIds[node.id] = validate(node.id) ? i : node.id;
+		});
+		return {
+			nodes: Object.values(this.nodes).map((node) => ({
+				id: stableNodeIds[node.id],
+				...nodeDataJson(node)
+			})),
+			edges: this.edges.map((edge) => {
+				const item = {
+					source: stableNodeIds[edge.source],
+					target: stableNodeIds[edge.target]
+				};
+				if (typeof edge.data !== "undefined") item.data = edge.data;
+				if (typeof edge.conditional !== "undefined") item.conditional = edge.conditional;
+				return item;
+			})
+		};
+	}
+	addNode(data, id, metadata) {
+		if (id !== void 0 && this.nodes[id] !== void 0) throw new Error(`Node with id ${id} already exists`);
+		const nodeId = id ?? v4();
+		const node = {
+			id: nodeId,
+			data,
+			name: nodeDataStr(id, data),
+			metadata
+		};
+		this.nodes[nodeId] = node;
+		return node;
+	}
+	removeNode(node) {
+		delete this.nodes[node.id];
+		this.edges = this.edges.filter((edge) => edge.source !== node.id && edge.target !== node.id);
+	}
+	addEdge(source, target, data, conditional) {
+		if (this.nodes[source.id] === void 0) throw new Error(`Source node ${source.id} not in graph`);
+		if (this.nodes[target.id] === void 0) throw new Error(`Target node ${target.id} not in graph`);
+		const edge = {
+			source: source.id,
+			target: target.id,
+			data,
+			conditional
+		};
+		this.edges.push(edge);
+		return edge;
+	}
+	firstNode() {
+		return _firstNode(this);
+	}
+	lastNode() {
+		return _lastNode(this);
+	}
+	/**
+	* Add all nodes and edges from another graph.
+	* Note this doesn't check for duplicates, nor does it connect the graphs.
+	*/
+	extend(graph, prefix = "") {
+		let finalPrefix = prefix;
+		const nodeIds = Object.values(graph.nodes).map((node) => node.id);
+		if (nodeIds.every(validate)) finalPrefix = "";
+		const prefixed = (id) => {
+			return finalPrefix ? `${finalPrefix}:${id}` : id;
+		};
+		Object.entries(graph.nodes).forEach(([key, value]) => {
+			this.nodes[prefixed(key)] = {
+				...value,
+				id: prefixed(key)
+			};
+		});
+		const newEdges = graph.edges.map((edge) => {
+			return {
+				...edge,
+				source: prefixed(edge.source),
+				target: prefixed(edge.target)
+			};
+		});
+		this.edges = [...this.edges, ...newEdges];
+		const first = graph.firstNode();
+		const last = graph.lastNode();
+		return [first ? {
+			id: prefixed(first.id),
+			data: first.data
+		} : void 0, last ? {
+			id: prefixed(last.id),
+			data: last.data
+		} : void 0];
+	}
+	trimFirstNode() {
+		const firstNode = this.firstNode();
+		if (firstNode && _firstNode(this, [firstNode.id])) this.removeNode(firstNode);
+	}
+	trimLastNode() {
+		const lastNode = this.lastNode();
+		if (lastNode && _lastNode(this, [lastNode.id])) this.removeNode(lastNode);
+	}
+	/**
+	* Return a new graph with all nodes re-identified,
+	* using their unique, readable names where possible.
+	*/
+	reid() {
+		const nodeLabels = Object.fromEntries(Object.values(this.nodes).map((node) => [node.id, node.name]));
+		const nodeLabelCounts = /* @__PURE__ */ new Map();
+		Object.values(nodeLabels).forEach((label) => {
+			nodeLabelCounts.set(label, (nodeLabelCounts.get(label) || 0) + 1);
+		});
+		const getNodeId = (nodeId) => {
+			const label = nodeLabels[nodeId];
+			if (validate(nodeId) && nodeLabelCounts.get(label) === 1) return label;
+			else return nodeId;
+		};
+		return new Graph({
+			nodes: Object.fromEntries(Object.entries(this.nodes).map(([id, node]) => [getNodeId(id), {
+				...node,
+				id: getNodeId(id)
+			}])),
+			edges: this.edges.map((edge) => ({
+				...edge,
+				source: getNodeId(edge.source),
+				target: getNodeId(edge.target)
+			}))
+		});
+	}
+	drawMermaid(params) {
+		const { withStyles, curveStyle, nodeColors = {
+			default: "fill:#f2f0ff,line-height:1.2",
+			first: "fill-opacity:0",
+			last: "fill:#bfb6fc"
+		}, wrapLabelNWords } = params ?? {};
+		const graph = this.reid();
+		const firstNode = graph.firstNode();
+		const lastNode = graph.lastNode();
+		return drawMermaid(graph.nodes, graph.edges, {
+			firstNode: firstNode?.id,
+			lastNode: lastNode?.id,
+			withStyles,
+			curveStyle,
+			nodeColors,
+			wrapLabelNWords
+		});
+	}
+	async drawMermaidPng(params) {
+		const mermaidSyntax = this.drawMermaid(params);
+		return drawMermaidPng(mermaidSyntax, { backgroundColor: params?.backgroundColor });
+	}
+};
 /**
- * Find the single node that is not a target of any edge.
- * Exclude nodes/sources with ids in the exclude list.
- * If there is no such node, or there are multiple, return undefined.
- * When drawing the graph, this node would be the origin.
- */
+* Find the single node that is not a target of any edge.
+* Exclude nodes/sources with ids in the exclude list.
+* If there is no such node, or there are multiple, return undefined.
+* When drawing the graph, this node would be the origin.
+*/
 function _firstNode(graph, exclude = []) {
-    const targets = new Set(graph.edges
-        .filter((edge) => !exclude.includes(edge.source))
-        .map((edge) => edge.target));
-    const found = [];
-    for (const node of Object.values(graph.nodes)) {
-        if (!exclude.includes(node.id) && !targets.has(node.id)) {
-            found.push(node);
-        }
-    }
-    return found.length === 1 ? found[0] : undefined;
+	const targets = new Set(graph.edges.filter((edge) => !exclude.includes(edge.source)).map((edge) => edge.target));
+	const found = [];
+	for (const node of Object.values(graph.nodes)) if (!exclude.includes(node.id) && !targets.has(node.id)) found.push(node);
+	return found.length === 1 ? found[0] : void 0;
 }
 /**
- * Find the single node that is not a source of any edge.
- * Exclude nodes/targets with ids in the exclude list.
- * If there is no such node, or there are multiple, return undefined.
- * When drawing the graph, this node would be the destination.
- */
+* Find the single node that is not a source of any edge.
+* Exclude nodes/targets with ids in the exclude list.
+* If there is no such node, or there are multiple, return undefined.
+* When drawing the graph, this node would be the destination.
+*/
 function _lastNode(graph, exclude = []) {
-    const sources = new Set(graph.edges
-        .filter((edge) => !exclude.includes(edge.target))
-        .map((edge) => edge.source));
-    const found = [];
-    for (const node of Object.values(graph.nodes)) {
-        if (!exclude.includes(node.id) && !sources.has(node.id)) {
-            found.push(node);
-        }
-    }
-    return found.length === 1 ? found[0] : undefined;
+	const sources = new Set(graph.edges.filter((edge) => !exclude.includes(edge.target)).map((edge) => edge.source));
+	const found = [];
+	for (const node of Object.values(graph.nodes)) if (!exclude.includes(node.id) && !sources.has(node.id)) found.push(node);
+	return found.length === 1 ? found[0] : void 0;
 }
+
+//#endregion
+export { Graph, graph_exports };
+//# sourceMappingURL=graph.js.map

package/dist/runnables/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","names":["id: string | undefined","data: RunnableInterface | RunnableIOSchema","isUuid","node: Node","params?: { nodes: Record<string, Node>; edges: Edge[] }","stableNodeIds: Record<string, string | number>","item: Record<string, unknown>","id?: string","metadata?: Record<string, any>","uuidv4","source: Node","target: Node","data?: string","conditional?: boolean","edge: Edge","graph: Graph","id: string","nodeLabels: Record<string, string>","nodeId: string","params?: {\n    withStyles?: boolean;\n    curveStyle?: string;\n    nodeColors?: Record<string, string>;\n    wrapLabelNWords?: number;\n  }","params?: {\n    withStyles?: boolean;\n    curveStyle?: string;\n    nodeColors?: Record<string, string>;\n    wrapLabelNWords?: number;\n    backgroundColor?: string;\n  }","exclude: string[]","found: Node[]"],"sources":["../../src/runnables/graph.ts"],"sourcesContent":["import { v4 as uuidv4, validate as isUuid } from \"uuid\";\nimport type {\n  RunnableInterface,\n  RunnableIOSchema,\n  Node,\n  Edge,\n} from \"./types.js\";\nimport { isRunnableInterface } from \"./utils.js\";\nimport { drawMermaid, drawMermaidPng } 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 (error) {\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  // eslint-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    // eslint-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 drawMermaidPng(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,YACPA,IACAC,MACQ;AACR,KAAI,OAAO,UAAa,CAACC,SAAO,GAAG,CACjC,QAAO;UACE,oBAAoB,KAAK,CAClC,KAAI;EACF,IAAI,UAAU,KAAK,SAAS;EAC5B,UAAU,QAAQ,WAAW,WAAW,GACpC,QAAQ,MAAM,EAAkB,GAChC;AACJ,SAAO;CACR,SAAQ,OAAO;AACd,SAAO,KAAK,SAAS;CACtB;KAED,QAAO,KAAK,QAAQ;AAEvB;AAED,SAAS,aAAaC,MAAY;AAEhC,KAAI,oBAAoB,KAAK,KAAK,CAChC,QAAO;EACL,MAAM;EACN,MAAM;GACJ,IAAI,KAAK,KAAK;GACd,MAAM,KAAK,KAAK,SAAS;EAC1B;CACF;KAED,QAAO;EACL,MAAM;EACN,MAAM;GAAE,GAAG,aAAa,KAAK,KAAK,OAAO;GAAE,OAAO,KAAK,KAAK;EAAM;CACnE;AAEJ;AAED,IAAa,QAAb,MAAa,MAAM;CACjB,QAA8B,CAAE;CAEhC,QAAgB,CAAE;CAElB,YAAYC,QAAyD;EACnE,KAAK,QAAQ,QAAQ,SAAS,KAAK;EACnC,KAAK,QAAQ,QAAQ,SAAS,KAAK;CACpC;CAID,SAA8B;EAC5B,MAAMC,gBAAiD,CAAE;EACzD,OAAO,OAAO,KAAK,MAAM,CAAC,QAAQ,CAAC,MAAM,MAAM;GAC7C,cAAc,KAAK,MAAMH,SAAO,KAAK,GAAG,GAAG,IAAI,KAAK;EACrD,EAAC;AAEF,SAAO;GACL,OAAO,OAAO,OAAO,KAAK,MAAM,CAAC,IAAI,CAAC,UAAU;IAC9C,IAAI,cAAc,KAAK;IACvB,GAAG,aAAa,KAAK;GACtB,GAAE;GACH,OAAO,KAAK,MAAM,IAAI,CAAC,SAAS;IAC9B,MAAMI,OAAgC;KACpC,QAAQ,cAAc,KAAK;KAC3B,QAAQ,cAAc,KAAK;IAC5B;AAED,QAAI,OAAO,KAAK,SAAS,aACvB,KAAK,OAAO,KAAK;AAGnB,QAAI,OAAO,KAAK,gBAAgB,aAC9B,KAAK,cAAc,KAAK;AAE1B,WAAO;GACR,EAAC;EACH;CACF;CAED,QACEL,MACAM,IAEAC,UACM;AACN,MAAI,OAAO,UAAa,KAAK,MAAM,QAAQ,OACzC,OAAM,IAAI,MAAM,CAAC,aAAa,EAAE,GAAG,eAAe,CAAC;EAErD,MAAM,SAAS,MAAMC,IAAQ;EAC7B,MAAMN,OAAa;GACjB,IAAI;GACJ;GACA,MAAM,YAAY,IAAI,KAAK;GAC3B;EACD;EACD,KAAK,MAAM,UAAU;AACrB,SAAO;CACR;CAED,WAAWA,MAAkB;EAE3B,OAAO,KAAK,MAAM,KAAK;EAGvB,KAAK,QAAQ,KAAK,MAAM,OACtB,CAAC,SAAS,KAAK,WAAW,KAAK,MAAM,KAAK,WAAW,KAAK,GAC3D;CACF;CAED,QACEO,QACAC,QACAC,MACAC,aACM;AACN,MAAI,KAAK,MAAM,OAAO,QAAQ,OAC5B,OAAM,IAAI,MAAM,CAAC,YAAY,EAAE,OAAO,GAAG,aAAa,CAAC;AAEzD,MAAI,KAAK,MAAM,OAAO,QAAQ,OAC5B,OAAM,IAAI,MAAM,CAAC,YAAY,EAAE,OAAO,GAAG,aAAa,CAAC;EAEzD,MAAMC,OAAa;GACjB,QAAQ,OAAO;GACf,QAAQ,OAAO;GACf;GACA;EACD;EACD,KAAK,MAAM,KAAK,KAAK;AACrB,SAAO;CACR;CAED,YAA8B;AAC5B,SAAO,WAAW,KAAK;CACxB;CAED,WAA6B;AAC3B,SAAO,UAAU,KAAK;CACvB;;;;;CAMD,OAAOC,OAAc,SAAS,IAAI;EAChC,IAAI,cAAc;EAClB,MAAM,UAAU,OAAO,OAAO,MAAM,MAAM,CAAC,IAAI,CAAC,SAAS,KAAK,GAAG;AACjE,MAAI,QAAQ,MAAMb,SAAO,EACvB,cAAc;EAGhB,MAAM,WAAW,CAACc,OAAe;AAC/B,UAAO,cAAc,GAAG,YAAY,CAAC,EAAE,IAAI,GAAG;EAC/C;EAED,OAAO,QAAQ,MAAM,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,MAAM,KAAK;GACpD,KAAK,MAAM,SAAS,IAAI,IAAI;IAAE,GAAG;IAAO,IAAI,SAAS,IAAI;GAAE;EAC5D,EAAC;EAEF,MAAM,WAAW,MAAM,MAAM,IAAI,CAAC,SAAS;AACzC,UAAO;IACL,GAAG;IACH,QAAQ,SAAS,KAAK,OAAO;IAC7B,QAAQ,SAAS,KAAK,OAAO;GAC9B;EACF,EAAC;EAEF,KAAK,QAAQ,CAAC,GAAG,KAAK,OAAO,GAAG,QAAS;EACzC,MAAM,QAAQ,MAAM,WAAW;EAC/B,MAAM,OAAO,MAAM,UAAU;AAC7B,SAAO,CACL,QAAQ;GAAE,IAAI,SAAS,MAAM,GAAG;GAAE,MAAM,MAAM;EAAM,IAAG,QACvD,OAAO;GAAE,IAAI,SAAS,KAAK,GAAG;GAAE,MAAM,KAAK;EAAM,IAAG,MACrD;CACF;CAED,gBAAsB;EACpB,MAAM,YAAY,KAAK,WAAW;AAClC,MAAI,aAAa,WAAW,MAAM,CAAC,UAAU,EAAG,EAAC,EAC/C,KAAK,WAAW,UAAU;CAE7B;CAED,eAAqB;EACnB,MAAM,WAAW,KAAK,UAAU;AAChC,MAAI,YAAY,UAAU,MAAM,CAAC,SAAS,EAAG,EAAC,EAC5C,KAAK,WAAW,SAAS;CAE5B;;;;;CAMD,OAAc;EACZ,MAAMC,aAAqC,OAAO,YAChD,OAAO,OAAO,KAAK,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,KAAK,IAAK,EAAC,CAC9D;EACD,MAAM,kCAAkB,IAAI;EAC5B,OAAO,OAAO,WAAW,CAAC,QAAQ,CAAC,UAAU;GAC3C,gBAAgB,IAAI,QAAQ,gBAAgB,IAAI,MAAM,IAAI,KAAK,EAAE;EAClE,EAAC;EAEF,MAAM,YAAY,CAACC,WAA2B;GAC5C,MAAM,QAAQ,WAAW;AACzB,OAAIhB,SAAO,OAAO,IAAI,gBAAgB,IAAI,MAAM,KAAK,EACnD,QAAO;OAEP,QAAO;EAEV;AAED,SAAO,IAAI,MAAM;GACf,OAAO,OAAO,YACZ,OAAO,QAAQ,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,CAC7C,UAAU,GAAG,EACb;IAAE,GAAG;IAAM,IAAI,UAAU,GAAG;GAAE,CAC/B,EAAC,CACH;GACD,OAAO,KAAK,MAAM,IAAI,CAAC,UAAU;IAC/B,GAAG;IACH,QAAQ,UAAU,KAAK,OAAO;IAC9B,QAAQ,UAAU,KAAK,OAAO;GAC/B,GAAE;EACJ;CACF;CAED,YAAYiB,QAKD;EACT,MAAM,EACJ,YACA,YACA,aAAa;GACX,SAAS;GACT,OAAO;GACP,MAAM;EACP,GACD,iBACD,GAAG,UAAU,CAAE;EAChB,MAAM,QAAQ,KAAK,MAAM;EACzB,MAAM,YAAY,MAAM,WAAW;EAEnC,MAAM,WAAW,MAAM,UAAU;AAEjC,SAAO,YAAY,MAAM,OAAO,MAAM,OAAO;GAC3C,WAAW,WAAW;GACtB,UAAU,UAAU;GACpB;GACA;GACA;GACA;EACD,EAAC;CACH;CAED,MAAM,eAAeC,QAMH;EAChB,MAAM,gBAAgB,KAAK,YAAY,OAAO;AAC9C,SAAO,eAAe,eAAe,EACnC,iBAAiB,QAAQ,gBAC1B,EAAC;CACH;AACF;;;;;;;AAOD,SAAS,WAAWL,OAAcM,UAAoB,CAAE,GAAoB;CAC1E,MAAM,UAAU,IAAI,IAClB,MAAM,MACH,OAAO,CAAC,SAAS,CAAC,QAAQ,SAAS,KAAK,OAAO,CAAC,CAChD,IAAI,CAAC,SAAS,KAAK,OAAO;CAG/B,MAAMC,QAAgB,CAAE;AACxB,MAAK,MAAM,QAAQ,OAAO,OAAO,MAAM,MAAM,CAC3C,KAAI,CAAC,QAAQ,SAAS,KAAK,GAAG,IAAI,CAAC,QAAQ,IAAI,KAAK,GAAG,EACrD,MAAM,KAAK,KAAK;AAGpB,QAAO,MAAM,WAAW,IAAI,MAAM,KAAK;AACxC;;;;;;;AAQD,SAAS,UAAUP,OAAcM,UAAoB,CAAE,GAAoB;CACzE,MAAM,UAAU,IAAI,IAClB,MAAM,MACH,OAAO,CAAC,SAAS,CAAC,QAAQ,SAAS,KAAK,OAAO,CAAC,CAChD,IAAI,CAAC,SAAS,KAAK,OAAO;CAG/B,MAAMC,QAAgB,CAAE;AACxB,MAAK,MAAM,QAAQ,OAAO,OAAO,MAAM,MAAM,CAC3C,KAAI,CAAC,QAAQ,SAAS,KAAK,GAAG,IAAI,CAAC,QAAQ,IAAI,KAAK,GAAG,EACrD,MAAM,KAAK,KAAK;AAGpB,QAAO,MAAM,WAAW,IAAI,MAAM,KAAK;AACxC"}