dijkstra算法matlab实现

Dijkstra算法是一种计算最短路径的算法，在Matlab中可以实现该算法。通常需要用到Matlab中的图论工具箱来实现。以下是一个简单的Dijkstra算法Matlab实现的示例代码：

function [dist, path] = dijkstra(graph, startNode)

% 初始化
n = size(graph, 1);
dist = inf(n, 1);
dist(startNode) = 0;
visited = false(n, 1);

% 开始遍历
while sum(visited) < n
    [~, curNode] = min(dist .* ~(visited));
    visited(curNode) = true;
    neighbors = find(graph(curNode, :));
    for i = 1:length(neighbors)
        neighbor = neighbors(i);
        if ~visited(neighbor)
            newDist = dist(curNode) + graph(curNode, neighbor);
            if newDist < dist(neighbor)
                dist(neighbor) = newDist;
                path{neighbor} = [path{curNode} neighbor];
            end
        end
    end
end

end

这个函数接受两个参数：一个代表图的邻接矩阵和一个代表起点的节点号。函数返回一个代表从起点到每个节点的最短距离的向量和一个路径的单元数组，路径单元数组中的每个单元都代表到达每个节点的最短路径。