使用Dijkstra算法求最短路matlab程序

以下是Matlab实现的Dijkstra算法来求一个有向图中从源节点到目标节点的最短路径的程序：

function [path, totalDist] = dijkstra(adjMatrix, source, target)

numNodes = size(adjMatrix, 1);
dist = inf(1, numNodes);
visited = false(1, numNodes);
previous = zeros(1, numNodes);

dist(source) = 0;

for i = 1:numNodes
    [minDist, current] = min(dist);
    
    if current == target
        break;
    end
    
    visited(current) = true;
    neighbors = find(adjMatrix(current, :));
    
    for neighbor = neighbors
        if ~visited(neighbor)
            tentativeDist = dist(current) + adjMatrix(current, neighbor);
            if tentativeDist < dist(neighbor)
                dist(neighbor) = tentativeDist;
                previous(neighbor) = current;
            end
        end
    end
end

if dist(target) == inf
    path = [];
    totalDist = NaN;
else
    path = target;
    totalDist = dist(target);
    while previous(path(1)) ~= 0
        path = [previous(path(1)), path];
    end
    if path(1) ~= source
        path = [];
        totalDist = NaN;
    end
end

其中，adjMatrix是一个邻接矩阵，source是源节点，target是目标节点。函数返回最短路径和路径的总长度。如果找不到从源节点到目标节点的路径，则返回空路径和NaN的总长度。