matlab中怎么定义dijkstra算法

以下是使用Matlab定义Dijkstra算法的示例代码：

function [dist, path] = dijkstra(graph, start, dest)
% Dijkstra's algorithm implementation in Matlab
% Input: graph - adjacency matrix of the graph (NxN)
%        start - starting node index
%        dest - destination node index
% Output: dist - shortest path distance from start to dest
%         path - shortest path from start to dest (list of node indices)
%
% Written by Xiaotian Dai, 2021

N = size(graph, 1); % number of nodes
dist = inf(1, N); % initialize distances
prev = zeros(1, N); % initialize previous node indices
visited = false(1, N); % initialize visited flags

dist(start) = 0; % distance to starting node is 0

while any(~visited) % while there are unvisited nodes
    % find the node with the smallest distance
    [~, u] = min(dist + visited .* inf);
    if u == dest % if the destination node is reached
        break;
    end
    visited(u) = true; % mark the node as visited
    for v = 1:N % for all neighbors of u
        if graph(u, v) > 0 % if there is an edge from u to v
            alt = dist(u) + graph(u, v); % calculate alternative distance
            if alt < dist(v) % if the alternative distance is shorter
                dist(v) = alt; % update distance
                prev(v) = u; % update previous node
            end
        end
    end
end

% construct the shortest path
path = [];
if dist(dest) < inf % if a path exists
    u = dest;
    while u ~= start % traverse the path backwards
        path = [u path];
        u = prev(u);
    end
    path = [start path];
end
end

该函数的输入参数为邻接矩阵、起点和终点，输出为最短路径长度和路径节点列表。算法使用了一个while循环，每次找到距离起点最近且未被访问的节点进行松弛操作。当找到终点时，算法终止。最后，通过回溯记录前驱节点，构造最短路径。