DeepSeek + Function Call：基于 Eino 的“计划——执行”多智能体范式实战

package plan_execute
import (    "github.com/cloudwego/eino/components/model"    "github.com/cloudwego/eino/compose"    "github.com/cloudwego/eino/schema")
// Config “计划——执行”多智能体的配置.type Config struct {    PlannerModel        model.ChatModel // planner 智能体使用的大模型    PlannerSystemPrompt string          // planner 智能体的 system prompt
    ExecutorModel        model.ChatModel         // executor 智能体使用的大模型    ToolsConfig          compose.ToolsNodeConfig // executor 智能体使用的工具执行器配置    ExecutorSystemPrompt string                  // executor 智能体的 system prompt
    ReviserModel        model.ChatModel // reviser 智能体使用的大模型    ReviserSystemPrompt string          // reviser 智能体的 system prompt
    MaxStep int




    
 // 多智能体的最大执行步骤数，避免无限循环}
// PlanExecuteMultiAgent “计划——执行”多智能体.type PlanExecuteMultiAgent struct {    // 图编排后的可执行体，输入是 Message 数组，输出是单条 Message    runnable compose.Runnable[[]*schema.Message, *schema.Message]}

// NewMultiAgent 根据配置编排一个“计划——执行”多智能体.func NewMultiAgent(ctx context.Context, config *Config) (*PlanExecuteMultiAgent, error) {    var (       toolInfos      []*schema.ToolInfo       toolsNode      *compose.ToolsNode       err            error       plannerPrompt  = config.PlannerSystemPrompt       executorPrompt = config.ExecutorSystemPrompt       reviserPrompt  = config.ReviserSystemPrompt       maxStep        = config.MaxStep    )    if len(plannerPrompt) == 0 {       plannerPrompt = defaultPlannerPrompt    }    if len(executorPrompt) == 0 {       executorPrompt = defaultExecutorPrompt    }    if len(reviserPrompt) == 0 {       reviserPrompt = defaultReviserPrompt    }    if maxStep == 0 {       maxStep = defaultMaxStep    }    if toolInfos, err = genToolInfos(ctx, config.ToolsConfig); err != nil {       return nil




    
, err    }    // 为 Executor 配置工具    if err = config.ExecutorModel.BindTools(toolInfos); err != nil {       return nil, err    }    // 初始化 Tool 执行器节点，传入可执行的工具    if toolsNode, err = compose.NewToolNode(ctx, &config.ToolsConfig); err != nil {       return nil, err    }    // 创建一个待编排的 graph，规定整体的输入输出类型    graph := compose.NewGraph[[]*schema.Message, *schema.Message]()    // 定义 Executor 后的分支判断用的条件函数。该函数的输出是运行时选中的 NodeKey    executorPostBranchCondition := func(_ context.Context, msg *schema.Message) (endNode string, err error) {        if len(msg.ToolCalls) == 0 {           return nodeKeyExecutorToList, nil        }            return nodeKeyTools, nil    }    // 定义 Reviser 后的分支判断用的条件函数。    reviserPostBranchCondition := func(_ context.Context, sr *schema.StreamReader[*schema.Message]) (endNode string, err error) {       defer sr.Close()       var content string       for {          msg, err := sr.Recv()          if err != nil {             if err == io.EOF {                return nodeKeyReviserToList, nil             }             return "", err          }          content += msg.Content          if strings.Contains(content, "最终答案") {             return compose.END, nil          }          if len(content) > 20 {             return nodeKeyReviserToList, nil          }       }    }    // 添加 Planner 节点    _ = graph.AddChatModelNode(nodeKeyPlanner, config.PlannerModel, compose.WithNodeName(nodeKeyPlanner))    // 添加 Executor 节点    _ = graph.AddChatModelNode(nodeKeyExecutor, config.ExecutorModel, compose.WithNodeName(nodeKeyExecutor))    // 添加 Reviser 节点    _ = graph.AddChatModelNode(nodeKeyReviser, config.ReviserModel, compose.WithNodeName(nodeKeyReviser))    // 添加 Tool 执行器节点    _ = graph.AddToolsNode(nodeKeyTools, toolsNode)    // 添加三个 ToList 转换节点    _ = graph.AddLambdaNode(nodeKeyPlannerToList, compose.ToList[*schema.Message]())    _ = graph.AddLambdaNode(nodeKeyExecutorToList, compose.ToList[*schema.Message]())    _ = graph.AddLambdaNode(nodeKeyReviserToList, compose.ToList[*schema.Message]())    // 添加节点之间的边和分支    _ = graph.AddEdge(compose.START, nodeKeyPlanner)    _ = graph.AddEdge(nodeKeyPlanner, nodeKeyPlannerToList)    _ = graph.AddEdge(nodeKeyPlannerToList, nodeKeyExecutor)    _ = graph.AddBranch(nodeKeyExecutor, compose.NewStreamGraphBranch(executorPostBranchCondition, map[string]bool{       nodeKeyTools:          true,       nodeKeyExecutorToList: true,    }))    _ = graph.AddEdge(nodeKeyTools, nodeKeyExecutor)    _ = graph.AddEdge(nodeKeyExecutorToList, nodeKeyReviser)    _ = graph.AddBranch(nodeKeyReviser, compose.NewStreamGraphBranch(reviserPostBranchCondition, map[string]bool{       nodeKeyReviserToList: true,       compose.END:          true,    }))    _ = graph.AddEdge(nodeKeyReviserToList, nodeKeyExecutor)    // 编译 graph，将节点、边、分支转化为面向运行时的结构。由于 graph 中存在环，使用 AnyPredecessor 模式，同时设置运行时最大步数。    runnable, err := graph.Compile(ctx, compose.WithNodeTriggerMode(compose.AnyPredecessor), compose.WithMaxRunSteps(maxStep))    if err != nil {       return nil, err    }    return &PlanExecuteMultiAgent{       runnable: runnable,    }, nil}

type ActivityType string
const