dijkstra 算法matlab代码

以下是基于Matlab的Dijkstra算法实现代码示例：

function [dist, path] = dijkstra(G, start)
% Dijkstra's algorithm for single source shortest path problem
% G is a square matrix representing the weighted adjacency matrix of a graph
% start is the index of the starting vertex
% dist is a vector of the shortest distances from the starting vertex to all other vertices
% path is a vector of the shortest path from the starting vertex to each vertex

n = size(G, 1);
dist = inf(1, n);
path = zeros(1, n);
visited = false(1, n);
dist(start) = 0;

for i = 1:n-1
    % find the vertex with the minimum distance
    [~, u] = min(dist .* ~visited);
    visited(u) = true;
    
    % update the distances of the neighboring vertices
    for v = 1:n
        if G(u, v) ~= 0 && ~visited(v)
            alt = dist(u) + G(u, v);
            if alt < dist(v)
                dist(v) = alt;
                path(v) = u;
            end
        end
    end
end
end

其中，G是一个n×n的矩阵，表示加权邻接矩阵。start是起始点的索引，dist是一个包含起始点到所有其他点的最短距离的向量，path是一个包含路径的向量。visited是一个包含所有节点是否已被访问的布尔向量。