动态规划算法的最短路径问题的MATLAB代码

以下是一个简单的MATLAB代码实现Dijkstra算法解决最短路径问题，其中使用了动态规划的思想：

function [dist, path] = Dijkstra(graph, source)
    n = size(graph, 1);
    dist = inf(1, n);
    visited = false(1, n);
    prev = zeros(1, n);
    dist(source) = 0;

    for i = 1:n-1
        u = find(!visited & dist == min(dist));
        u = u(1);
        visited(u) = true;

        for v = 1:n
            if (!visited(v) && graph(u, v) ~= inf)
                alt = dist(u) + graph(u, v);
                if (alt < dist(v))
                    dist(v) = alt;
                    prev(v) = u;
                endif
            endif
        endfor
    endfor

    path = zeros(1, n);
    path(1) = source;
    for i = 2:n
        path(i) = prev(path(i-1));
    endfor
    path = fliplr(path);
endfunction

使用方法：`[dist, path] = Dijkstra(graph, source)`，其中`graph`是一个邻接矩阵，`source`是起点，`dist`返回最短距离数组，`path`返回最短路径数组。