搜索资源列表
Astar
- A星号算法求最短路径，不同于传统的最短路径算法，迪杰斯特拉和弗洛伊德算法-A star algorithms for the shortest path
Dijkstra
- 迪杰斯特拉算法的matlab源文件。输出最短距离及路劲
dijkstra
- 在matlab编译环境下，下实现迪杰斯特拉算法。 程序鲁棒，速度较快。-the implementation of Dijstla algorithm
matlab
- 迪杰斯特拉算法求最短路径，经典的求解最短路径算法等-Dijstrala algorithm solve the shortest—paths problems
Dijkstra
- 迪杰斯特拉算法求最短路径matlab的实现算法-Dijkstra shortest path algorithm
shuxuejianmoGongJiaoLuXian
- 数学建模公交线路问题 该程序利用迪杰斯特拉算法经行求解，使用该代码前最好先阅读Readme.doc-Bus lines mathematical modeling problem using Dijkstra algorithm for the program through the line solution, a good idea to use the code to read Readme.doc
Graph-Theory
- 图论算法，迪杰斯特拉和弗洛伊德尤其好用，简洁方便-Graph Theory
Centrality-measures
- 文件包括：1.计算平均最短路径；2.计算每个顶点相邻节点的平均度；3.计算每个节点的邻近中心度；4.计算节点的介数（slow）；5.计算节点的介数（faster）；6.计算每条边的介数值；7.快速迪杰斯特拉算法；8.经典迪杰斯特拉算法。-1.the average shortest path in the graph 2.the average degree of neighboring nodes for every vertex 3.computes the closeness centra
Dijkstra-algorithm
- 迪杰斯特拉算法是由荷兰计算机科学家狄克斯特拉于1959 年提出的，因此又叫狄克斯特拉算法。是从一个顶点到其余各顶点的最短路径算法，解决的是有向图中最短路径问题。迪杰斯特拉算法主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。-Dijkstra algorithm is a Dutch computer scientist Dijkstra proposed in 1959, the so called Dijkstra algorithm. From one vertex to each
ShortestPath
- 迪杰斯特拉算法求解最小路径，只用给出节点信息以及邻接矩阵即可求出节点对间最短路径，最短路径存于元胞内。文件中有测试的数据，可以替换。-Dijkstra algorithm minimum path, and the only information given node adjacency matrix you can find the shortest path between nodes, the shortest path within the cellular memory. File
T_Dijstra
- matlab实现图上需找最短路径的迪杰斯特拉算法，寻找任一点和其他点之间的最短距离，最终结果为最短路径度量矩阵和正序路由矩阵-matlab implementation on the map to find the shortest path Dijkstra algorithm to find the shortest distance between any point and other points, the final result is the shortest path metri
pathPlanning4m
- 基于迪杰斯特拉算法输入起点和终点和障碍物列表，规划出最短的路径-Based on the Dijkstra algorithm, enter the starting point and the end and the list of obstacles, and plan the shortest path
Dijkstra算法
- 迪杰斯特拉算法求最短路径距离，可用于流形测地距离计算中。(Dijkstra algorithm for the shortest path distance, can be used for manifold geodesic distance calculation.)
dijkstra algorithm with GUI
- 改进版的迪杰斯特拉算法，主要用于路径规划，效果良好(Improved version of the Dijkstra algorithm, mainly for path planning, the effect is good)
dijkstra
- 迪杰斯特拉算法是由荷兰计算机科学家狄克斯特拉于1959 年提出的，因此又叫狄克斯特拉算法。是从一个顶点到其余各顶点的最短路径算法，解决的是有向图中最短路径问题。迪杰斯特拉算法主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。(Dijkstra algorithm was proposed by Dijkstra, a computer scientist in Holland in 1959, so it is also called Dijkstra algorithm. Is the
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
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