文件名称：Dijkstra：Dijkstra在MATLAB中的实现
文件大小：392KB
文件格式：ZIP
更新时间：2024-03-10 05:27:56
MATLAB
迪克斯特拉 在MATLAB中实现Dijkstra以查找给定图的最短路径 迪克斯特拉 用法： [dist,path] = dijkstra(nodes, segments, start_ID, end_ID) Note: All arguments are mandatory 输入： NODES is a Nx3 with the format [ID X Y] where ID is each node's ID and (X, Y) are coordinates for node SEGMENTS is a Nx3 matrix with the format [ID N1 N2]where ID is unique segment ID and N1 and N2 are nodeIDs START_ID nodeID for starting node END_ID
【文件预览】：
Dijkstra-master
----dijkstra.asv(3KB)
----small maze 2_nodiagonals.png(13KB)
----trial_movie.avi(415KB)
----Small Maze 2.png(12KB)
----planningLab.asv(5KB)
----Small Maze.png(13KB)
----dijkstra.m(3KB)
----bigMaze.mat(2KB)
----planningLab.m(6KB)
----Maze_10_v2_nodiag_solved.png(13KB)
----Big Maze.PNG(151KB)
----gif.m(5KB)
----myfile.gif(131KB)
----README.md(1KB)
----maze.mat(210B)
----small_nodiagonals.fig(38KB)
----Maze_10_v2_nodiag.png(11KB)