Dijkstra最短路径算法

建不了的模。

Dijkstra最短路径算法
Dijkstra's Shortest Path Algorithm

calculates the shortest path and distance between two nodes on a map

This function can  
    1. Find the shortest path and distance from a starting node to an ending node on a map**  
    2. Find the shortest paths and distances from a starting node to ALL other nodes on a map**  

**The map should consist of nodes and segments, such that:  
    1. nodes have the format [ID X Y] or [ID X Y Z] (with ID being an integer, and X,Y,Z representing position coordinates and of type double)  
    2. segments have the format [ID N1 N2] (with ID being an integer, and N1 N2 representing IDs from the nodes list such that there is an [undirected] edgefile:///C:\DOCUME~1\ADMINI~1\LOCALS~1\Temp\V7(XMWRN]{G8~CI}BCCR3QC.gifgment between node N1 and node N2, and obviously of integer type also)  

Note:  
    The function generates a random map of nodes and segments that it uses if no inputs are given. This way, it acts like a script if it is run with no inputs, and it acts like a function otherwise.

游客，如果您要查看本帖隐藏内容请回复

娜写年华

很不错的一个算法，刚好解决了我的问题

娜写年华

不错不错不错不错不错不错不错

娜写年华

不错不错不错不错不错不错不错

阳光的起点

谢谢楼主

Mr.Vt

快捷键狂欢节和刻录机

北方阳光

不错~想看看~收集好资料

霏V彽↘调★V

想看一下，有用没

Moyago

！！！！！！！！！！！！！！！！！！！！！1

Moyago

！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！