@eko-ai/eko 2.1.9 → 2.2.0

package/dist/common/xml.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"xml.d.ts","sourceRoot":"","sources":["../../src/common/xml.ts"],"names":[],"mappings":"AAEA,OAAO,EACL,QAAQ,EAMT,MAAM,qBAAqB,CAAC;AAE7B,wBAAgB,aAAa,CAC3B,MAAM,EAAE,MAAM,EACd,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,OAAO,EACb,QAAQ,CAAC,EAAE,MAAM,GAChB,QAAQ,GAAG,IAAI,CAyEjB;AA6DD,wBAAgB,iBAAiB,CAC/B,QAAQ,EAAE,MAAM,EAChB,cAAc,EAAE,MAAM,EACtB,YAAY,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,KAAK,IAAI,UA0BtD;AAED,wBAAgB,mBAAmB,CACjC,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,MAAM,GACb,OAAO,GAAG,IAAI,CAqBhB;AAED,wBAAgB,WAAW,CAAC,IAAI,EAAE,OAAO,GAAG,MAAM,CAOjD;AAED,wBAAgB,WAAW,CAAC,IAAI,EAAE,OAAO,GAAG,MAAM,CAGjD;AAED,wBAAgB,wBAAwB,CAAC,EACvC,MAAM,EACN,IAAI,EACJ,SAAS,EACT,IAAI,EACJ,SAAS,GACV,EAAE;IACD,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;CACtB,GAAG,QAAQ,CA4BX;AAED,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,QA8DlD"}
+{"version":3,"file":"xml.d.ts","sourceRoot":"","sources":["../../src/common/xml.ts"],"names":[],"mappings":"AAEA,OAAO,EACL,QAAQ,EAMT,MAAM,qBAAqB,CAAC;AAG7B,wBAAgB,aAAa,CAC3B,MAAM,EAAE,MAAM,EACd,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,OAAO,EACb,QAAQ,CAAC,EAAE,MAAM,GAChB,QAAQ,GAAG,IAAI,CA6FjB;AA6DD,wBAAgB,iBAAiB,CAC/B,QAAQ,EAAE,MAAM,EAChB,cAAc,EAAE,MAAM,EACtB,YAAY,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,KAAK,IAAI,UA0BtD;AAED,wBAAgB,mBAAmB,CACjC,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,MAAM,GACb,OAAO,GAAG,IAAI,CAqBhB;AAED,wBAAgB,WAAW,CAAC,IAAI,EAAE,OAAO,GAAG,MAAM,CAOjD;AAED,wBAAgB,WAAW,CAAC,IAAI,EAAE,OAAO,GAAG,MAAM,CAGjD;AAED,wBAAgB,wBAAwB,CAAC,EACvC,MAAM,EACN,IAAI,EACJ,SAAS,EACT,IAAI,EACJ,SAAS,GACV,EAAE;IACD,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;CACtB,GAAG,QAAQ,CA8BX;AAED,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,QA8DlD"}

package/dist/core/index.d.ts

@@ -11,6 +11,7 @@ export declare class Eko {
     run(taskPrompt: string, taskId?: string, contextParams?: Record<string, any>): Promise<EkoResult>;
     initContext(workflow: Workflow, contextParams?: Record<string, any>): Promise<Context>;
     private doRunWorkflow;
+    private runAgent;
     getTask(taskId: string): Context | undefined;
     getAllTaskId(): string[];
     deleteTask(taskId: string): boolean;

package/dist/core/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/core/index.ts"],"names":[],"mappings":"AACA,OAAO,OAAO,MAAM,WAAW,CAAC;AAChC,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AAMjC,OAAO,EACL,SAAS,EACT,SAAS,EACT,QAAQ,EAET,MAAM,qBAAqB,CAAC;AAE7B,qBAAa,GAAG;IACd,OAAO,CAAC,MAAM,CAAY;IAC1B,OAAO,CAAC,OAAO,CAAuB;gBAE1B,MAAM,EAAE,SAAS;IAKhB,QAAQ,CACnB,UAAU,EAAE,MAAM,EAClB,MAAM,GAAE,MAAiB,EACzB,aAAa,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAClC,OAAO,CAAC,QAAQ,CAAC;IAwBP,MAAM,CACjB,MAAM,EAAE,MAAM,EACd,gBAAgB,EAAE,MAAM,GACvB,OAAO,CAAC,QAAQ,CAAC;IAcP,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,CAAC;IAyB3C,GAAG,CACd,UAAU,EAAE,MAAM,EAClB,MAAM,GAAE,MAAiB,EACzB,aAAa,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAClC,OAAO,CAAC,SAAS,CAAC;IAKR,WAAW,CACtB,QAAQ,EAAE,QAAQ,EAClB,aAAa,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAClC,OAAO,CAAC,OAAO,CAAC;YAoBL,aAAa;IA4EpB,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,GAAG,SAAS;IAI5C,YAAY,IAAI,MAAM,EAAE;IAIxB,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO;IASnC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,OAAO;IAYnD,SAAS,CACd,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,OAAO,EACd,gBAAgB,CAAC,EAAE,OAAO,EAC1B,MAAM,CAAC,EAAE,MAAM,GACd,OAAO;IAWH,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,SAAS;IAQlE,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,IAAI;YAKrB,YAAY;CAa3B"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/core/index.ts"],"names":[],"mappings":"AACA,OAAO,OAAO,MAAM,WAAW,CAAC;AAChC,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AAMjC,OAAO,EACL,SAAS,EACT,SAAS,EACT,QAAQ,EAET,MAAM,qBAAqB,CAAC;AAE7B,qBAAa,GAAG;IACd,OAAO,CAAC,MAAM,CAAY;IAC1B,OAAO,CAAC,OAAO,CAAuB;gBAE1B,MAAM,EAAE,SAAS;IAKhB,QAAQ,CACnB,UAAU,EAAE,MAAM,EAClB,MAAM,GAAE,MAAiB,EACzB,aAAa,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAClC,OAAO,CAAC,QAAQ,CAAC;IAwBP,MAAM,CACjB,MAAM,EAAE,MAAM,EACd,gBAAgB,EAAE,MAAM,GACvB,OAAO,CAAC,QAAQ,CAAC;IAcP,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,CAAC;IAyB3C,GAAG,CACd,UAAU,EAAE,MAAM,EAClB,MAAM,GAAE,MAAiB,EACzB,aAAa,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAClC,OAAO,CAAC,SAAS,CAAC;IAKR,WAAW,CACtB,QAAQ,EAAE,QAAQ,EAClB,aAAa,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAClC,OAAO,CAAC,OAAO,CAAC;YAoBL,aAAa;YA0Fb,QAAQ;IA2Cf,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,GAAG,SAAS;IAI5C,YAAY,IAAI,MAAM,EAAE;IAIxB,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO;IASnC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,OAAO;IAYnD,SAAS,CACd,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,OAAO,EACd,gBAAgB,CAAC,EAAE,OAAO,EAC1B,MAAM,CAAC,EAAE,MAAM,GACd,OAAO;IAWH,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,SAAS;IAQlE,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,IAAI;YAKrB,YAAY;CAa3B"}

package/dist/index.cjs.js

@@ -16880,6 +16880,159 @@ function requireDomParser () {
 
 var domParserExports = requireDomParser();
 
+function buildAgentTree(agents) {
+    // Detect and handle circular dependencies
+    const safeAgents = detectAndBreakCycles(agents);
+    if (safeAgents.length === 0) {
+        throw new Error("No executable agent");
+    }
+    // Establish dependency relationship mapping
+    const agentMap = new Map();
+    const dependents = new Map();
+    for (const agent of safeAgents) {
+        agentMap.set(agent.id, agent);
+        dependents.set(agent.id, []);
+    }
+    for (const agent of safeAgents) {
+        for (const depId of agent.dependsOn) {
+            if (dependents.has(depId)) {
+                dependents.get(depId).push(agent);
+            }
+        }
+    }
+    let entryAgents = safeAgents.filter((agent) => agent.dependsOn.length === 0);
+    if (entryAgents.length === 0) {
+        entryAgents = safeAgents.filter((agent) => agent.dependsOn.length == 1 && agent.dependsOn[0].endsWith("00"));
+    }
+    const processedAgents = new Set();
+    function buildNodeRecursive(currentAgents) {
+        if (currentAgents.length === 0) {
+            return undefined;
+        }
+        for (const agent of currentAgents) {
+            processedAgents.add(agent.id);
+        }
+        const nextLevelAgents = [];
+        const nextLevelSet = new Set();
+        for (const agent of currentAgents) {
+            const dependentAgents = dependents.get(agent.id) || [];
+            for (const dependentAgent of dependentAgents) {
+                const allDependenciesProcessed = dependentAgent.dependsOn.every((depId) => processedAgents.has(depId));
+                if (allDependenciesProcessed && !nextLevelSet.has(dependentAgent.id)) {
+                    nextLevelAgents.push(dependentAgent);
+                    nextLevelSet.add(dependentAgent.id);
+                }
+            }
+        }
+        const nextNode = buildNodeRecursive(nextLevelAgents);
+        if (currentAgents.length === 1) {
+            return {
+                type: "normal",
+                agent: currentAgents[0],
+                nextAgent: nextNode,
+            };
+        }
+        else {
+            const parallelNodes = currentAgents.map((agent) => ({
+                type: "normal",
+                agent: agent,
+                nextAgent: undefined,
+            }));
+            return {
+                type: "parallel",
+                agents: parallelNodes,
+                nextAgent: nextNode,
+            };
+        }
+    }
+    const rootNode = buildNodeRecursive(entryAgents);
+    if (!rootNode) {
+        throw new Error("Unable to build execution tree");
+    }
+    return rootNode;
+}
+function detectAndBreakCycles(agents) {
+    // Detect cyclic dependencies and return a safe dependency relationship
+    // Use topological sorting algorithm to detect cycles, if a cycle is found, break some dependencies.
+    const agentMap = new Map();
+    const inDegree = new Map();
+    const adjList = new Map();
+    for (const agent of agents) {
+        agentMap.set(agent.id, agent);
+        inDegree.set(agent.id, 0);
+        adjList.set(agent.id, []);
+    }
+    for (const agent of agents) {
+        for (const depId of agent.dependsOn) {
+            if (agentMap.has(depId)) {
+                // depId -> agent.id indicates that the agent depends on depId.
+                adjList.get(depId).push(agent.id);
+                inDegree.set(agent.id, inDegree.get(agent.id) + 1);
+            }
+        }
+    }
+    // Topological Sorting Detects Cycles
+    const queue = [];
+    const processedCount = new Map();
+    for (const [agentId, degree] of inDegree.entries()) {
+        if (degree === 0) {
+            queue.push(agentId);
+        }
+        processedCount.set(agentId, 0);
+    }
+    let processedNodes = 0;
+    while (queue.length > 0) {
+        const currentId = queue.shift();
+        processedNodes++;
+        for (const neighborId of adjList.get(currentId)) {
+            const newInDegree = inDegree.get(neighborId) - 1;
+            inDegree.set(neighborId, newInDegree);
+            if (newInDegree === 0) {
+                queue.push(neighborId);
+            }
+        }
+    }
+    if (processedNodes < agents.length) {
+        console.warn("Detected a circular dependency, automatically disconnecting the circular link...");
+        const cyclicNodes = new Set();
+        for (const [agentId, degree] of inDegree.entries()) {
+            if (degree > 0) {
+                cyclicNodes.add(agentId);
+            }
+        }
+        const fixedAgents = [];
+        for (const agent of agents) {
+            if (cyclicNodes.has(agent.id)) {
+                const filteredDependsOn = agent.dependsOn.filter((depId) => !cyclicNodes.has(depId) || !agentMap.has(depId));
+                // Preserve the shortest path dependency
+                if (filteredDependsOn.length === 0 && agent.dependsOn.length > 0) {
+                    const firstValidDep = agent.dependsOn.find((depId) => agentMap.has(depId));
+                    if (firstValidDep && !cyclicNodes.has(firstValidDep)) {
+                        filteredDependsOn.push(firstValidDep);
+                    }
+                }
+                agent.dependsOn = filteredDependsOn;
+                fixedAgents.push(agent);
+                if (filteredDependsOn.length !== agent.dependsOn.length) {
+                    console.warn(`The partial cyclic dependency of agent ${agent.id} has been disconnected.`);
+                }
+            }
+            else {
+                // Non-cyclic node, filter out non-existent dependencies
+                const validDependsOn = agent.dependsOn.filter((depId) => agentMap.has(depId));
+                agent.dependsOn = validDependsOn;
+                fixedAgents.push(agent);
+            }
+        }
+        return fixedAgents;
+    }
+    // No loops, just need to filter out non-existent dependencies
+    return agents.map((agent) => {
+        agent.dependsOn = agent.dependsOn.filter((depId) => agentMap.has(depId));
+        return agent;
+    });
+}
+
 function parseWorkflow(taskId, xml, done, thinking) {
     let _workflow = null;
     try {
@@ -16936,6 +17089,8 @@ function parseWorkflow(taskId, xml, done, thinking) {
                 dependsOn: dependsOn.split(",").filter(idx => idx.trim() != "").map(idx => getAgentId(taskId, idx)),
                 task: agentNode.getElementsByTagName("task")[0]?.textContent || "",
                 nodes: nodes,
+                status: "init",
+                parallel: undefined,
                 xml: agentNode.toString(),
             };
             let xmlNodes = agentNode.getElementsByTagName("nodes");
@@ -16944,6 +17099,25 @@ function parseWorkflow(taskId, xml, done, thinking) {
             }
             agents.push(agent);
         }
+        if (done) {
+            let agentTree = buildAgentTree(workflow.agents);
+            while (true) {
+                if (agentTree.type === "normal") {
+                    agentTree.agent.parallel = false;
+                }
+                else {
+                    const parallelAgents = agentTree.agents;
+                    for (let i = 0; i < parallelAgents.length; i++) {
+                        const agentNode = parallelAgents[i];
+                        agentNode.agent.parallel = true;
+                    }
+                }
+                if (!agentTree.nextAgent) {
+                    break;
+                }
+                agentTree = agentTree.nextAgent;
+            }
+        }
         return workflow;
     }
     catch (e) {
@@ -17084,6 +17258,8 @@ function buildSimpleAgentWorkflow({ taskId, name, agentName, task, taskNodes, })
                         text: node,
                     };
                 }),
+                status: "init",
+                parallel: false,
                 xml: "",
             },
         ],
@@ -18325,7 +18501,7 @@ During the task execution process, you can use the \`${TOOL_NAME$3}\` tool to in
 `;
 const VARIABLE_PROMPT = `
 * VARIABLE STORAGE
-If you need to read and write the input/output variables in the node, require the use of the \`${TOOL_NAME$1}\` tool.
+When a step node has input/output variable attributes, use the \`${TOOL_NAME$1}\` tool to read from and write to these variables, these variables enable context sharing and coordination between multiple agents.
 `;
 const FOR_EACH_NODE = `
     <!-- duplicate task node, items support list and variable -->
@@ -19199,163 +19375,6 @@ class Planner {
     }
 }
 
-function buildAgentTree(agents) {
-    // Detect and handle circular dependencies
-    const safeAgents = detectAndBreakCycles(agents);
-    if (safeAgents.length === 0) {
-        throw new Error("No executable agent");
-    }
-    // Establish dependency relationship mapping
-    const agentMap = new Map();
-    const dependents = new Map();
-    for (const agent of safeAgents) {
-        agentMap.set(agent.id, agent);
-        dependents.set(agent.id, []);
-    }
-    for (const agent of safeAgents) {
-        for (const depId of agent.dependsOn) {
-            if (dependents.has(depId)) {
-                dependents.get(depId).push(agent);
-            }
-        }
-    }
-    let entryAgents = safeAgents.filter((agent) => agent.dependsOn.length === 0);
-    if (entryAgents.length === 0) {
-        entryAgents = safeAgents.filter((agent) => agent.dependsOn.length == 1 && agent.dependsOn[0].endsWith("00"));
-    }
-    const processedAgents = new Set();
-    function buildNodeRecursive(currentAgents) {
-        if (currentAgents.length === 0) {
-            return undefined;
-        }
-        for (const agent of currentAgents) {
-            processedAgents.add(agent.id);
-        }
-        const nextLevelAgents = [];
-        const nextLevelSet = new Set();
-        for (const agent of currentAgents) {
-            const dependentAgents = dependents.get(agent.id) || [];
-            for (const dependentAgent of dependentAgents) {
-                const allDependenciesProcessed = dependentAgent.dependsOn.every((depId) => processedAgents.has(depId));
-                if (allDependenciesProcessed && !nextLevelSet.has(dependentAgent.id)) {
-                    nextLevelAgents.push(dependentAgent);
-                    nextLevelSet.add(dependentAgent.id);
-                }
-            }
-        }
-        const nextNode = buildNodeRecursive(nextLevelAgents);
-        if (currentAgents.length === 1) {
-            return {
-                type: "normal",
-                agent: currentAgents[0],
-                nextAgent: nextNode,
-            };
-        }
-        else {
-            const parallelNodes = currentAgents.map((agent) => ({
-                type: "normal",
-                agent: agent,
-                nextAgent: undefined,
-            }));
-            return {
-                type: "parallel",
-                agents: parallelNodes,
-                nextAgent: nextNode,
-            };
-        }
-    }
-    const rootNode = buildNodeRecursive(entryAgents);
-    if (!rootNode) {
-        throw new Error("Unable to build execution tree");
-    }
-    return rootNode;
-}
-function detectAndBreakCycles(agents) {
-    // Detect cyclic dependencies and return a safe dependency relationship
-    // Use topological sorting algorithm to detect cycles, if a cycle is found, break some dependencies.
-    const agentMap = new Map();
-    const inDegree = new Map();
-    const adjList = new Map();
-    for (const agent of agents) {
-        agentMap.set(agent.id, agent);
-        inDegree.set(agent.id, 0);
-        adjList.set(agent.id, []);
-    }
-    for (const agent of agents) {
-        for (const depId of agent.dependsOn) {
-            if (agentMap.has(depId)) {
-                // depId -> agent.id indicates that the agent depends on depId.
-                adjList.get(depId).push(agent.id);
-                inDegree.set(agent.id, inDegree.get(agent.id) + 1);
-            }
-        }
-    }
-    // Topological Sorting Detects Cycles
-    const queue = [];
-    const processedCount = new Map();
-    for (const [agentId, degree] of inDegree.entries()) {
-        if (degree === 0) {
-            queue.push(agentId);
-        }
-        processedCount.set(agentId, 0);
-    }
-    let processedNodes = 0;
-    while (queue.length > 0) {
-        const currentId = queue.shift();
-        processedNodes++;
-        for (const neighborId of adjList.get(currentId)) {
-            const newInDegree = inDegree.get(neighborId) - 1;
-            inDegree.set(neighborId, newInDegree);
-            if (newInDegree === 0) {
-                queue.push(neighborId);
-            }
-        }
-    }
-    if (processedNodes < agents.length) {
-        console.warn("Detected a circular dependency, automatically disconnecting the circular link...");
-        const cyclicNodes = new Set();
-        for (const [agentId, degree] of inDegree.entries()) {
-            if (degree > 0) {
-                cyclicNodes.add(agentId);
-            }
-        }
-        const fixedAgents = [];
-        for (const agent of agents) {
-            if (cyclicNodes.has(agent.id)) {
-                const filteredDependsOn = agent.dependsOn.filter((depId) => !cyclicNodes.has(depId) || !agentMap.has(depId));
-                // Preserve the shortest path dependency
-                if (filteredDependsOn.length === 0 && agent.dependsOn.length > 0) {
-                    const firstValidDep = agent.dependsOn.find((depId) => agentMap.has(depId));
-                    if (firstValidDep && !cyclicNodes.has(firstValidDep)) {
-                        filteredDependsOn.push(firstValidDep);
-                    }
-                }
-                fixedAgents.push({
-                    ...agent,
-                    dependsOn: filteredDependsOn,
-                });
-                if (filteredDependsOn.length !== agent.dependsOn.length) {
-                    console.warn(`The partial cyclic dependency of agent ${agent.id} has been disconnected.`);
-                }
-            }
-            else {
-                // Non-cyclic node, filter out non-existent dependencies
-                const validDependsOn = agent.dependsOn.filter((depId) => agentMap.has(depId));
-                fixedAgents.push({
-                    ...agent,
-                    dependsOn: validDependsOn,
-                });
-            }
-        }
-        return fixedAgents;
-    }
-    // No loops, just need to filter out non-existent dependencies
-    return agents.map((agent) => ({
-        ...agent,
-        dependsOn: agent.dependsOn.filter((depId) => agentMap.has(depId)),
-    }));
-}
-
 class Eko {
     constructor(config) {
         this.config = config;
@@ -19463,7 +19482,7 @@ class Eko {
                 const agentNode = agentTree.agent;
                 const agentChain = new AgentChain(agentNode);
                 context.chain.push(agentChain);
-                agentTree.result = await agent.run(context, agentChain);
+                agentTree.result = await this.runAgent(context, agent, agentTree, agentChain);
                 results.push(agentTree.result);
             }
             else {
@@ -19475,8 +19494,9 @@ class Eko {
                         throw new Error("Unknown Agent: " + agentNode.agent.name);
                     }
                     const agentChain = new AgentChain(agentNode.agent);
-                    agentNode.result = await agent.run(context, agentChain);
-                    return { result: agentNode.result, agentChain, index };
+                    context.chain.push(agentChain);
+                    const result = await this.runAgent(context, agent, agentNode, agentChain);
+                    return { result: result, agentChain, index };
                 };
                 let agent_results = [];
                 let agentParallel = context.variables.get("agentParallel");
@@ -19515,6 +19535,44 @@ class Eko {
             taskId: context.taskId,
         };
     }
+    async runAgent(context, agent, agentNode, agentChain) {
+        try {
+            agentNode.agent.status = "running";
+            this.config.callback &&
+                (await this.config.callback.onMessage({
+                    taskId: context.taskId,
+                    agentName: agentNode.agent.name,
+                    nodeId: agentNode.agent.id,
+                    type: "agent_start",
+                    agentNode: agentNode.agent,
+                }));
+            agentNode.result = await agent.run(context, agentChain);
+            agentNode.agent.status = "done";
+            this.config.callback &&
+                (await this.config.callback.onMessage({
+                    taskId: context.taskId,
+                    agentName: agentNode.agent.name,
+                    nodeId: agentNode.agent.id,
+                    type: "agent_result",
+                    agentNode: agentNode.agent,
+                    result: agentNode.result,
+                }, agent.AgentContext));
+            return agentNode.result;
+        }
+        catch (e) {
+            agentNode.agent.status = "error";
+            this.config.callback &&
+                (await this.config.callback.onMessage({
+                    taskId: context.taskId,
+                    agentName: agentNode.agent.name,
+                    nodeId: agentNode.agent.id,
+                    type: "agent_result",
+                    agentNode: agentNode.agent,
+                    error: e,
+                }, agent.AgentContext));
+            throw e;
+        }
+    }
     getTask(taskId) {
         return this.taskMap.get(taskId);
     }
@@ -21195,7 +21253,7 @@ class BaseBrowserLabelsAgent extends BaseBrowserAgent {
     constructor(llms, ext_tools, mcpClient) {
         const description = `You are a browser operation agent, use structured commands to interact with the browser.
 * This is a browser GUI interface where you need to analyze webpages by taking screenshot and page element structures, and specify action sequences to complete designated tasks.
-* For the first visit, please call the \`navigate_to\` or \`current_page\` tool first. After that, each of your actions will return a screenshot of the page and structured element information, both of which have been specially processed.
+* For your first visit, please start by calling either the \`navigate_to\` or \`current_page\` tool. After each action you perform, I will provide you with updated information about the current state, including page screenshots and structured element data that has been specially processed for easier analysis.
 * Screenshot description:
   - Screenshot are used to understand page layouts, with labeled bounding boxes corresponding to element indexes. Each bounding box and its label share the same color, with labels typically positioned in the top-right corner of the box.
   - Screenshot help verify element positions and relationships. Labels may sometimes overlap, so extracted elements are used to verify the correct elements.
@@ -21213,7 +21271,7 @@ class BaseBrowserLabelsAgent extends BaseBrowserAgent {
    - Handle popups/cookies by accepting or closing them
 * BROWSER OPERATION:
    - Use scroll to find elements you are looking for, When extracting content, prioritize using extract_page_content, only scroll when you need to load more content
-* During execution, please output user-friendly step information. Do not output element and index information to users, as this would cause user confusion.
+* During execution, please output user-friendly step information. Do not output HTML-related element and index information to users, as this would cause user confusion.
 `;
         const _tools_ = [];
         super({
@@ -21597,7 +21655,7 @@ class BaseBrowserLabelsAgent extends BaseBrowserAgent {
         return true;
     }
     async handleMessages(agentContext, messages, tools) {
-        const pseudoHtmlDescription = "This is the latest screenshot and page element information.\nindex and element:\n";
+        const pseudoHtmlDescription = "This is the environmental information after the operation, including the latest browser screenshot and page elements. Please perform the next operation based on the environmental information. Do not output the following elements and index information in your response.\n\nIndex and elements:\n";
         let lastTool = this.lastToolResult(messages);
         if (lastTool &&
             lastTool.toolName !== "extract_page_content" &&
@@ -21627,7 +21685,7 @@ class BaseBrowserLabelsAgent extends BaseBrowserAgent {
                     ...image_contents,
                     {
                         type: "text",
-                        text: pseudoHtmlDescription + result.pseudoHtml,
+                        text: pseudoHtmlDescription + "```html\n" + result.pseudoHtml + "\n```",
                     },
                 ],
             });