Example: % dijkstra; % calculates shortest path and distance between two nodes ... end % [d, p] = dijkstra(nodes, segments, 1, 10) % for n = 2:length(p) ...
確定! 回上一頁