文件名称:Dijkstra
- 所属分类：
- 人工智能/神经网络/遗传算法
- 资源属性：
- [Matlab] [源码]
- 上传时间：
- 2012-11-26
- 文件大小：
- 1kb
- 下载次数：
- 0次
- 提 供 者：
- 童*
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
图与网络论中求最短路径的Dijkstra算法 M-函数
格式 [S,D]=minroute(i,m,W)
i为最短路径的起始点,m为图顶点数,W为图的带权邻接矩阵，
不构成边的两顶点之间的权用inf表示。显示结果为：S的每
一列从上到下记录了从始点到终点的最短路径所经顶点的序号；
D是一行向量，记录了S中所示路径的大小 -Graph and network theory Dijkstra' s shortest path algorithm M-function the format [S, D] = minroute (i, m, W) i is the starting point of the shortest path, m is the graph vertices, W is the graph with adjacency matrix power, does not constitute the edge between two vertices of the right to use the inf that. Showing results: S a top to bottom of each record from the beginning to the end point of the shortest path through the vertices of the serial number D is a row vector to record the path shown in the size of S
格式 [S,D]=minroute(i,m,W)
i为最短路径的起始点,m为图顶点数,W为图的带权邻接矩阵，
不构成边的两顶点之间的权用inf表示。显示结果为：S的每
一列从上到下记录了从始点到终点的最短路径所经顶点的序号；
D是一行向量，记录了S中所示路径的大小 -Graph and network theory Dijkstra' s shortest path algorithm M-function the format [S, D] = minroute (i, m, W) i is the starting point of the shortest path, m is the graph vertices, W is the graph with adjacency matrix power, does not constitute the edge between two vertices of the right to use the inf that. Showing results: S a top to bottom of each record from the beginning to the end point of the shortest path through the vertices of the serial number D is a row vector to record the path shown in the size of S
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Dijkstra\MINROUTE.M
Dijkstra
Dijkstra