function dfsWithTimestamp(graph, startNode) visited = zeros(1, length(graph)); visited = zeros(1, length(graph)); timestamp = 1; stack = startNode; timestamps = zeros(1, length(graph)); while ~isempty(stack) node = stack(end); stack(end) = []; if visited(node) == 0 visited(node) = 1; timestamps(node) = timestamp; timestamp = timestamp + 1; % 这里可以根据实际需求进行相应的操作，例如输出节点值 disp(['Visited Node ', num2str(node)]); neighbors = find(graph(node, :)); % 获取相邻节点 for i = length(neighbors):-1:1 if visited(neighbors(i)) == 0 stack(end+1) = neighbors(i); end end end end disp('Timestamps:'); disp(timestamps); end 结束里边有错误visited = zeros(1, length(graph)); 这个问题

非常抱歉，我之前的回答中有误导。我再次检查了您提供的代码，发现确实存在问题。错误出现在第3行和第4行，这两行都是将`visited`数组初始化为全零向量。

您应该只保留其中一行初始化代码，并删除另一行。以下是已经修复的代码示例：

function dfsWithTimestamp(graph, startNode)
    visited = zeros(1, length(graph));
    timestamp = 1;
    stack = startNode;
    timestamps = zeros(1, length(graph));
    
    while ~isempty(stack)
        node = stack(end);
        stack(end) = [];
        
        if visited(node) == 0
            visited(node) = 1;
            timestamps(node) = timestamp;
            timestamp = timestamp + 1;
            
            % 这里可以根据实际需求进行相应的操作，例如输出节点值
            disp(['Visited Node ', num2str(node)]);
            
            neighbors = find(graph(node, :)); % 获取相邻节点
            for i = length(neighbors):-1:1
                if visited(neighbors(i)) == 0
                    stack(end+1) = neighbors(i);
                end
            end
        end
    end
    
    disp('Timestamps:');
    disp(timestamps);
end

请注意，我已经删除了第3行中的重复初始化代码。非常抱歉给您带来困惑，并感谢您的指正。请尝试使用修复后的代码并再次运行。