Description: 一种快速求得最短路径的经典算法，可以在运筹规划或在统筹安排中使用-Express obtained a classic shortest path algorithm, can be planned or in operation in co-ordinating arrangements for the use of Platform: |
Size: 51200 |
Author:chendong |
Hits:
Description: 最短路径的matlab文件，最短路径无论是在数据结构还是在图论中，都占有比较重要的地位-The shortest path of matlab files, shortest path, whether in data structures or graph theory has played an important role compared Platform: |
Size: 3072 |
Author:小明 |
Hits:
Description: 经典最短路径算法，内含多个工程项目，可下载-The classic shortest path algorithm, contain a number of projects, can be downloaded Platform: |
Size: 84992 |
Author:y.g |
Hits:
Description: 蚁群算法 适合寻找最优问题，实现最短路径。-Ant colony algorithm for finding the optimal problem, the realization of the shortest path. Platform: |
Size: 3072 |
Author:孙根本 |
Hits:
Description: Dijkstra的算法的c++小程序演示解决的最短路径的问题,希望对大家有用-Dijkstra' s Algorithm in c++ small program demonstrates the shortest path to solve the problem, we want to be useful Platform: |
Size: 533504 |
Author:王鹏 |
Hits:
Description: 用matlab程序编写的遗传算法路径规划程序用来实现最短路径问题。-Programming using genetic algorithm matlab path planning process used to achieve the shortest path problem. Platform: |
Size: 2048 |
Author:丁彪 |
Hits:
Description: 求一个图的最短路径的问题，程序在dos的界面下运行 程序还输出了最短路径的问题-Find a map of the shortest path problem, the program interface run in the dos program also outputs the shortest path problem Platform: |
Size: 210944 |
Author:马浩原 |
Hits:
Description: 这是一个用VC++求解最短路径的程序，在求解最短路径时可以绕过障碍物。-This is a VC++ using the procedure for solving the shortest path, shortest path in the solution can bypass the obstacles. Platform: |
Size: 21504 |
Author:ljg |
Hits:
Description: 最短路径问题。两个点A与B之间有多条路，从A到B有多条方案。求A到B的最短路径-The shortest path problem.There are several paths from point A to B.Now we want to know which path is the shortest.Ihis program can help us desolve the Transportation problem
Platform: |
Size: 4096 |
Author:zhangyue |
Hits:
Description: 本科的毕业设计，基于matlab的最短路径规划设计仿真算法，可以来看一看-Undergraduate course graduation design, the shortest path planning based on matlab simulation algorithm design, can take a look Platform: |
Size: 4096 |
Author:廖灿 |
Hits:
Description: 在实际问题中，边的权值一般以正权的形式出现，但是很多情况下负权也是存在的。这个时候，最短路径不一定存在。我们无法得到像dijkstra算法那样时间复杂度较低的算法，但是，仍然可以用bellman-ford迭代算法去解决问题。
bellman-ford算法是迭代算法，它不像dijkstra算法，按照一定的顺序直接算出每个点的距离值，而是不断地修改每个点的当前最小距离值，直到求出真正的最短距离为止。
-In practical problems, the edge weight is generally in the form of being the right, but many cases the negative right to exist. This time, the shortest path may not exist. We can not get the algorithm dijkstra algorithm time complexity is low, but you can still use the bellman-ford iterative algorithm to solve the problem.
The bellman-ford algorithm is an iterative algorithm, it is not the dijkstra algorithm to directly calculate the distance value of each point in a certain order, but modify each point of the current minimum distance value, until you find the real shortest distance so far . Platform: |
Size: 14336 |
Author:liuyunyang |
Hits:
Description: 最短路径的matlab实现，应用于数学建模时程序参考-Matlab implementation of the shortest path used in the mathematical modeling program reference Platform: |
Size: 2048 |
Author:曲存全 |
Hits:
Description: 求有向图的最短路劲，根据所给图的边长和顶点，建立有向图，以邻接表的方式存储，并编写程序求从有向图任一点出发的最短路径-according to the graph with sides and vertex, establish a directed graph, and write a program find the shortest path from one of the point of the chart
Platform: |
Size: 2048 |
Author:陆言 |
Hits:
Search - the shortest path