Unity C#实现BFS最短路径时报CS1001标识符预期错误求助

核心报错原因（CS1001：标识符应为） #

该报错由BFS函数的定义语法不符合C#规范直接导致，原函数首行存在多处语法错误：

• 结构顺序错误：C#函数标准定义格式为访问修饰符 返回值类型 函数名(参数列表)，你把返回值类型、函数名、参数列表的顺序完全写乱
• 返回值声明冲突：同时写了代表无返回值的void和代表返回节点列表的List<NodeScript>，二者互斥
• 参数格式无效：错误把函数名Breadthwise写到了参数列表的位置，参数声明格式不合法

修复后的BFS函数代码 #

private List<NodeScript> Breadthwise(NodeScript start, NodeScript end)
{
    // 函数内声明结果变量，避免全局变量污染
    List<NodeScript> result = new List<NodeScript>();
    List<NodeScript> visited = new List<NodeScript>();
    Queue<NodeScript> work = new Queue<NodeScript>();

    start.history = new List<NodeScript>();
    visited.Add(start);
    work.Enqueue(start);

    while (work.Count > 0)
    {
        NodeScript current = work.Dequeue();
        if (current == end)
        {
            // 找到终点
            result = current.history;
            result.Add(current);
            return result;
        }
        else
        {
            // 未找到终点，遍历邻居节点
            for (int i = 0; i < current.neighbors.Length; i++)
            {
                NodeScript currentNeighbor = current.neighbors[i];
                if (!visited.Contains(currentNeighbor))
                {
                    currentNeighbor.history = new List<NodeScript>(current.history);
                    currentNeighbor.history.Add(current);
                    visited.Add(currentNeighbor);
                    work.Enqueue(currentNeighbor);
                }
            }
        }
    }
    // 未找到有效路径
    return null;
}

可选优化建议 #

你当前直接修改NodeScript实例的history字段会产生副作用：多次调用BFS函数时，上一次的路径数据会覆盖节点的历史记录，多次运行可能出现逻辑错误。建议改为用字典存储每个节点的路径历史，避免修改节点本身的属性：

private List<NodeScript> Breadthwise(NodeScript start, NodeScript end)
{
    List<NodeScript> visited = new List<NodeScript>();
    Queue<NodeScript> work = new Queue<NodeScript>();
    // 用字典存储每个节点对应的路径，不修改节点本身属性
    Dictionary<NodeScript, List<NodeScript>> nodePathMap = new Dictionary<NodeScript, List<NodeScript>>();

    nodePathMap[start] = new List<NodeScript>();
    visited.Add(start);
    work.Enqueue(start);

    while (work.Count > 0)
    {
        NodeScript current = work.Dequeue();
        if (current == end)
        {
            var result = nodePathMap[current];
            result.Add(current);
            return result;
        }
        else
        {
            for (int i = 0; i < current.neighbors.Length; i++)
            {
                NodeScript currentNeighbor = current.neighbors[i];
                if (!visited.Contains(currentNeighbor))
                {
                    nodePathMap[currentNeighbor] = new List<NodeScript>(nodePathMap[current]);
                    nodePathMap[currentNeighbor].Add(current);
                    visited.Add(currentNeighbor);
                    work.Enqueue(currentNeighbor);
                }
            }
        }
    }
    return null;
}

内容的提问来源于stack exchange，提问作者יאיר מרקובסקי