dijkstra matlab代码

以下是使用Matlab实现Dijkstra算法的示例代码：

function [distances, path] = Dijkstra(graph, startNode)
    % 初始化距离数组和前驱节点数组
    n = size(graph, 1);
    distances = inf(1, n);
    distances(startNode) = 0;
    visited = false(1, n);
    path = zeros(1, n);

    for i = 1:n-1
        % 选择当前距离最小的节点
        [~, current] = min(distances .* ~visited);

        % 标记该节点已访问
        visited(current) = true;

        % 更新相邻节点的距离和前驱节点
        for j = 1:n
            if graph(current, j) ~= 0 && ~visited(j)
                if distances(current) + graph(current, j) < distances(j)
                    distances(j) = distances(current) + graph(current, j);
                    path(j) = current;
                end
            end
        end
    end
end

这段代码实现了Dijkstra算法，输入参数为图的邻接矩阵和起始节点，输出为最短路径距离数组和前驱节点数组。你可以根据自己的需求修改代码来适应不同的场景。