matlab最短路径算法代码

可以使用Dijkstra算法或者A*算法来求解最短路径，以下是一个简单的Dijkstra算法的Matlab代码：

function [shortestPath, totalDistance] = dijkstra(adjacencyMatrix, startNode, endNode)

numNodes = size(adjacencyMatrix, 1);
distance = inf(1, numNodes);
visited = false(1, numNodes);
previousNode = zeros(1, numNodes);

distance(startNode) = 0;

for i = 1:numNodes
% find the node with the shortest distance
[minDistance, currentNode] = min(distance);
if currentNode == endNode
break;
end
visited(currentNode) = true;
% update the distance and previous node of the neighbors
for j = 1:numNodes
if adjacencyMatrix(currentNode, j) > 0 && ~visited(j)
newDistance = minDistance + adjacencyMatrix(currentNode, j);
if newDistance < distance(j)
distance(j) = newDistance;
previousNode(j) = currentNode;
end
end
end
end

% trace back the shortest path
shortestPath = [endNode];
while previousNode(shortestPath(1)) ~= 0
shortestPath = [previousNode(shortestPath(1)) shortestPath];
end

if shortestPath(1) ~= startNode
shortestPath = [];
end

totalDistance = distance(endNode);
end