搜索资源列表
D@F
- 最短路径问题 迪克斯特拉算法和弗洛伊德算法-Dijkstra algorithm for shortest path problem
Dijkstra
- 用弗洛伊德算法和狄克斯特拉算法实现求最短路径-Algorithm and狄克斯特拉with Freud for the shortest path algorithm
finalshortpath
- 这是计算机网络中的迪杰斯特啦的最短路由算法演示程序，很好用啊-This is a computer network in the shortest you迪杰斯特routing algorithm demo program, with very good ah ... ...
dij(2)
- 迪克斯特拉算法 迪克斯特拉算法-fasdfgdh
han6
- 迪杰斯特拉最短路径分析的cpp代码，希望对大家有用-Dijkstra shortest path analysis of the cpp code, we want to be useful! ! !
Desktop
- POJ3268题解。因为只有1000，所以可以两次迪杰斯特拉搞定，-POJ3268 problem solutions. Because only 1000, so you can Dijkstra buttoned twice, ha ha
Traffic-Advisory-System
- 吴泽乐 Traffic Advisory System 交通咨询系统 最短路径 数据结构 迪杰斯特拉 Dijkstra-wuzele Traffic Advisory System Traffic Advisory System data structure Dijkstra shortest path Dijkstra
sitela
- 迪杰斯特拉求解单源点最短路径,不能有负权值存在-the shortest path
dijstra
- 实现迪杰斯特拉的选路功能，在matlab仿真中计算最短路径-Realize the routing function of Dijkstra, in the shortest path calculation matlab simulation
dijstla-(2)
- 数据结构中用邻接矩阵实现的迪杰斯特拉最短路径的路径输出-Data structure using adjacency matrix of the Dijkstra shortest path path output
DIJandFloyd
- 输入一个邻接矩阵，求一个图的最短路径，2种方法：迪杰斯特拉发和弗洛伊德法-Enter an adjacency matrix, the shortest path of a graph, two kinds of methods: Dijkstra hair and Freud Act
dijkstranewstring
- 数据结构的图知识，寻找最短路径，采用迪杰斯特拉Dijkstra方法-FIG knowledge of data structures, find the shortest path using Dijkstra Dijkstra method
ZOJ1002
- 类似迪杰斯特拉求最短路径求解ZOJ-1002-fire net.-Similar Dijkstrav shortest path to solve ZOJ-1002-fire net.
dijkstra
- 迪杰斯特拉算法是由荷兰计算机科学家狄克斯特拉于1959 年提出的，因此又叫狄克斯特拉算法。是从一个顶点到其余各顶点的最短路径算法，解决的是有向图中最短路径问题。迪杰斯特拉算法主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。(Dijkstra algorithm was proposed by Dijkstra, a computer scientist in Holland in 1959, so it is also called Dijkstra algorithm. Is the
logistic
- 用于模式识别中分类器的实现，罗杰斯特回归的实现 ，有数据实例，能够观察到分类结果和收敛曲线(logistics regression)
dijkstra
- 是从一个顶点到其余各顶点的最短路径算法，解决的是有向图中最短路径问题。迪杰斯特拉算法主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止(It is the shortest path algorithm from one vertex to the other vertices, and the shortest path problem in the directed graph is solved. The main feature of the Dijkstra algorithm
code
- 迪杰斯特拉算法的实现 只需要改变邻接矩阵可以直接使用 返回l和z是结果 floyd算法 同样改变邻接矩阵A，调用函数即可使用 带有数据(The implementation of the Dijkstra algorithm only needs to change the adjacency matrix and can be used directly to return to L and Z as a result The Floyd algorithm also
Astar
- A*算法是一种静态路网中求解最短路径最有效直接的搜索方法，也是许多其他问题的常用启发式算法，他考虑了全局的信息，可以在一些情况下蜕化为迪杰斯特拉算法以及扫描时算法，本程序文件是利用A*算法进行一个航路规划(A * algorithm is a static road network to solve the shortest path is the most effective and direct search method, is also a lot of other problems c
Djiskstra
- 算法第四版书配套大作业第四题，用迪杰斯特拉算法计算导入的文件中各城市的最短路径。(The fourth edition of the algorithm is supported by fourth major tasks, and the shortest path of each city in the imported files is calculated by Dijkstra algorithm.)
校园导航系统
- 校园导航系统，用邻接矩阵和迪杰斯特拉算法(Campus Navigation System Using Adjacency Matrix and Dijkstra Algorithms)