@langchain/core 0.3.5-rc.0 → 0.3.6-rc.0

package/dist/runnables/graph.cjs

@@ -126,24 +126,10 @@ class Graph {
         return edge;
     }
     firstNode() {
-        const targets = new Set(this.edges.map((edge) => edge.target));
-        const found = [];
-        Object.values(this.nodes).forEach((node) => {
-            if (!targets.has(node.id)) {
-                found.push(node);
-            }
-        });
-        return found[0];
+        return _firstNode(this);
     }
     lastNode() {
-        const sources = new Set(this.edges.map((edge) => edge.source));
-        const found = [];
-        Object.values(this.nodes).forEach((node) => {
-            if (!sources.has(node.id)) {
-                found.push(node);
-            }
-        });
-        return found[0];
+        return _lastNode(this);
     }
     /**
      * Add all nodes and edges from another graph.
@@ -179,20 +165,14 @@ class Graph {
     }
     trimFirstNode() {
         const firstNode = this.firstNode();
-        if (firstNode) {
-            const outgoingEdges = this.edges.filter((edge) => edge.source === firstNode.id);
-            if (Object.keys(this.nodes).length === 1 || outgoingEdges.length === 1) {
-                this.removeNode(firstNode);
-            }
+        if (firstNode && _firstNode(this, [firstNode.id])) {
+            this.removeNode(firstNode);
         }
     }
     trimLastNode() {
         const lastNode = this.lastNode();
-        if (lastNode) {
-            const incomingEdges = this.edges.filter((edge) => edge.target === lastNode.id);
-            if (Object.keys(this.nodes).length === 1 || incomingEdges.length === 1) {
-                this.removeNode(lastNode);
-            }
+        if (lastNode && _lastNode(this, [lastNode.id])) {
+            this.removeNode(lastNode);
         }
     }
     /**
@@ -252,3 +232,39 @@ class Graph {
     }
 }
 exports.Graph = Graph;
+/**
+ * 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;
+}
+/**
+ * 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;
+}

package/dist/runnables/graph.js

@@ -123,24 +123,10 @@ export class Graph {
         return edge;
     }
     firstNode() {
-        const targets = new Set(this.edges.map((edge) => edge.target));
-        const found = [];
-        Object.values(this.nodes).forEach((node) => {
-            if (!targets.has(node.id)) {
-                found.push(node);
-            }
-        });
-        return found[0];
+        return _firstNode(this);
     }
     lastNode() {
-        const sources = new Set(this.edges.map((edge) => edge.source));
-        const found = [];
-        Object.values(this.nodes).forEach((node) => {
-            if (!sources.has(node.id)) {
-                found.push(node);
-            }
-        });
-        return found[0];
+        return _lastNode(this);
     }
     /**
      * Add all nodes and edges from another graph.
@@ -176,20 +162,14 @@ export class Graph {
     }
     trimFirstNode() {
         const firstNode = this.firstNode();
-        if (firstNode) {
-            const outgoingEdges = this.edges.filter((edge) => edge.source === firstNode.id);
-            if (Object.keys(this.nodes).length === 1 || outgoingEdges.length === 1) {
-                this.removeNode(firstNode);
-            }
+        if (firstNode && _firstNode(this, [firstNode.id])) {
+            this.removeNode(firstNode);
         }
     }
     trimLastNode() {
         const lastNode = this.lastNode();
-        if (lastNode) {
-            const incomingEdges = this.edges.filter((edge) => edge.target === lastNode.id);
-            if (Object.keys(this.nodes).length === 1 || incomingEdges.length === 1) {
-                this.removeNode(lastNode);
-            }
+        if (lastNode && _lastNode(this, [lastNode.id])) {
+            this.removeNode(lastNode);
         }
     }
     /**
@@ -248,3 +228,39 @@ export class Graph {
         });
     }
 }
+/**
+ * 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;
+}
+/**
+ * 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;
+}

package/dist/runnables/graph_mermaid.cjs

@@ -41,8 +41,8 @@ function drawMermaid(nodes, edges, config) {
                 ? `<p>${nodeName}</p>`
                 : nodeName;
             let finalLabel = label;
-            if (node.metadata) {
-                finalLabel += `<hr/><small><em>${Object.entries(node.metadata)
+            if (Object.keys(node.metadata ?? {}).length) {
+                finalLabel += `<hr/><small><em>${Object.entries(node.metadata ?? {})
                     .map(([k, v]) => `${k} = ${v}`)
                     .join("\n")}</em></small>`;
             }
@@ -82,7 +82,7 @@ function drawMermaid(nodes, edges, config) {
             const { source, target, data, conditional } = edge;
             let edgeLabel = "";
             if (data !== undefined) {
-                let edgeData = String(data);
+                let edgeData = data;
                 const words = edgeData.split(" ");
                 if (words.length > wrapLabelNWords) {
                     edgeData = Array.from({ length: Math.ceil(words.length / wrapLabelNWords) }, (_, i) => words

package/dist/runnables/graph_mermaid.js

@@ -38,8 +38,8 @@ export function drawMermaid(nodes, edges, config) {
                 ? `<p>${nodeName}</p>`
                 : nodeName;
             let finalLabel = label;
-            if (node.metadata) {
-                finalLabel += `<hr/><small><em>${Object.entries(node.metadata)
+            if (Object.keys(node.metadata ?? {}).length) {
+                finalLabel += `<hr/><small><em>${Object.entries(node.metadata ?? {})
                     .map(([k, v]) => `${k} = ${v}`)
                     .join("\n")}</em></small>`;
             }
@@ -79,7 +79,7 @@ export function drawMermaid(nodes, edges, config) {
             const { source, target, data, conditional } = edge;
             let edgeLabel = "";
             if (data !== undefined) {
-                let edgeData = String(data);
+                let edgeData = data;
                 const words = edgeData.split(" ");
                 if (words.length > wrapLabelNWords) {
                     edgeData = Array.from({ length: Math.ceil(words.length / wrapLabelNWords) }, (_, i) => words

package/package.json

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