搜索资源列表
DijkstraMatlab
- 最大邻接点存储的单元最短路径算法,在一个网络中，各结点的邻接接点的最大值称为该网络的最大邻接结点数。取网络的最大邻接结点数作为矩阵的列，网络的结点总数作为矩阵的行，构造邻接结点矩阵M-PJ来描述网络结构，邻接结点矩阵的行按结点号从小到大顺序排列，与结点I邻接的结点号写在矩阵的第I行，如果结点I的邻接点数小于最大邻接点数，则以0填充，直到填满为止。对照邻接结点矩阵，把邻接结点矩阵中各元素邻接关系对应边的权值填在同一位置上，构造相应的初始判断矩阵M-PDJ。根据邻接结点矩阵和初始判断矩阵，就可以求网
LabeledIconWndDemo
- 使用VC++编写的城市间最短路径问题的演示程序，具有图形化界面，采用Dijkstra算法，能够生成任意两个城市间的路径长度和具体路径。-This project is programmed in VC++ to demonstrate a demo which solves shortest path problem between two cities。This program has a city network GUI, utilizes Dijkstra algorithm and c
xiaoyuandaoyoutu
- 校园导游图，根据已建立的稀疏矩阵存储校园个景点的编号和相应的权值，查找任意两点的最短路径并显示相应的信息内容-Campus Tour map, based on an established tourist attractions in sparse matrix storage on campus number and the corresponding weights, find the shortest path between any two points and displays th
hljsjtzzxt
- 黑龙江省交通咨询系统，可以查询13个城市中每两个城市的最短路径，最少花费和最少中转-Traffic Advisory System in Heilongjiang Province, you can check in 13 cities in the two cities each shortest path, minimum cost and minimum transit
traffic
- .建立一个全国铁路交通咨询系统，该系统具备自动查找任意两城市间铁路交通的最短路径和最少花费的功能。-. To establish a national rail transportation consulting system, the system automatically looks for any two cities with rail traffic between the shortest path and minimum cost function.
floyd
- 最短路径的floyd算法，求解某区所有n个点之间的最短距离，坐标数据和公路数据可根据自行情况设置-the finest round trip method of shortest path combination