matlab最短路径算法代码

下面是Matlab中Dijkstra算法的最短路径代码实现：

function [dist, path] = dijkstra(graph, start_node, end_node)
% graph为邻接矩阵，start_node为起点，end_node为终点
% dist为起点到所有节点的最短路径距离，path为路径

num_nodes = size(graph, 1);
dist = inf(1, num_nodes);
path = repmat({[]}, 1, num_nodes);
visited = false(1, num_nodes);

dist(start_node) = 0;

for i = 1:num_nodes
    [~, u] = min(dist(~visited)); % 找到未访问节点中距离最小的节点
    if isempty(u)
        break;
    end
    visited(u) = true;
    for v = 1:num_nodes
        if graph(u, v) ~= 0 && ~visited(v)
            alt = dist(u) + graph(u, v);
            if alt < dist(v)
                dist(v) = alt;
                path{v} = [path{u}, u];
            end
        end
    end
end

path = [path{end_node}, end_node];
end

其中，graph为邻接矩阵，start_node为起点，end_node为终点，dist为起点到所有节点的最短路径距离，path为路径。