搜索资源列表
Dijkstra-Shortest-Path
- 一种快速求得最短路径的经典算法,可以在运筹规划或在统筹安排中使用-Express obtained a classic shortest path algorithm, can be planned or in operation in co-ordinating arrangements for the use of
FLOYD
- 用 Floyd 算法求任意两点间的最短路径及最短路长. D0 是图的邻接矩阵-Floyd algorithm used for any shortest path between two points and the most long-short-circuit. D0 is the graph adjacency matrix
ShortestPath_Djk-complexnetworks
- 复杂网络最短路径算法,详细而有条理,很有帮助-Complex network shortest path algorithm, detailed and structured, very helpful
JAVA
- 在城市智能交通中,经常会用到最短路径的问题,比如找最佳的行车路线等,Dijkstra算法做为最经典的求解方法,为我们指明了方向.不过真正想让我了解该算法的原因是在学习ICTCLAS的N-最短路径算法。-Intelligent Transportation in the city, often used the issue of the shortest path, for example, to find the best travel
AStarShotDistance
- 这是利用.net来实现的A*最短路径算法,其实现由人机进行交互进行设置,不失为一个最小路径的好方法-This is use. Net to achieve the A* shortest path algorithm, the realization of human-computer interaction by setting, is a good way to minimize the path
xq
- 图论中最短路算法,最小生成树,最大匹配与最佳匹配的算法,旅行商问题,求最大流的Ford--Fulkerson 标号算法-Shortest path graph algorithm, minimum spanning tree, the largest and best match matching algorithms, traveling salesman problem, maximum flow for the Ford- Ful
Graph_Theory
- 图论模型及方法 搞计算机算法和数学建模的人都知道图论是一个很重要的内容。本资料介绍了图论中的最短路算法、匹配、邮递员和货郎问题、最小生成树、网络流等经典问题。而且有非常经典易懂的Matlab程序。-Graph theory and methodology of engaging in computer algorithms and mathematical modeling of the people know that graph t
Floyd
- 采用了动态规划法即FLOYD算法利用矩阵求多源最短路径的JAVA实现-Using a dynamic programming method that is FLOYD algorithm uses matrix Multi-source shortest path to achieve JAVA
shuyouguandao
- 问题描述: 某石油公司计划建造一条由东向西的主输油管道。该管道要穿过一个有n 口油井的油田。从每口油井都要有一条输油管道沿最短路经(或南或北)与主管道相连。如果给定n口油井的位置,即它们的x 坐标(东西向)和y 坐标(南北向),应如何确定主管道的最优位置,即使各油井到主管道之间的输油管道长度总和最小的位置? 编程任务: 给定n 口油井的位置,编程计算各油井到主管道之间的输油管道最小长度总和。-Problem Descr
matlabCode
- floyd最短路算法、dijkstra最短路算法、求网络的最小费用最大流-floyd shortest path algorithm, dijkstra shortest path algorithm, find the minimum cost maximum flow networks
Huffman
- 用vc++实现用最短路径查找哈弗曼树。n个权值构成n棵二叉树的集合F={T1, T2, …, Tn},其中每棵二叉树Ti中只有一个带树为Ti的根结点。-Achieved with the vc++ to find the shortest path tree Havermann. n-weight constitutes a collection of n binary trees F = (T1, T2, ..., Tn), whic
daima
- 用C#语言编写的用dijkstra算法求两点间的最短路径-Written using C# language requirements using dijkstra algorithm shortest path between two points
MINROUTE
- 我们编的MATLAB程序,实现了用最短路算法求最短路径。这是我们在学校国际赛模拟题做的东西,相信对数模很有用。-We compiled MATLAB program, using the shortest path algorithm to achieve the shortest path. This is our international competition simulation title in the school do
aocMatlab
- 使用蚁群算法解决最短路径问题的通用的Matlab程序-The shortest path using ant colony algorithm to solve a common problem in Matlab
蚁群算法最短路径matlab程序
- 下面的程序是蚁群算法在最短路中的应用,稍加扩展即可应用于机器人路径规划
min_dis_Dij
- min_dis_Dij.zip:利用Dijkstra算法求最短路(Use Dijkstra to solve the minimum distance problem)
交通配流编程
- 包含最短路径算法,用户均衡交通流分配,以及包含大型测试网络(Contains the shortest path algorithm, user equilibrium traffic flow assignment, and contains large test networks)
floyd
- Floyd算法又称为弗洛伊德算法、插点法,是一种用于寻找给定的加权图中顶点间最短路径的算法。(Floyd algorithm, also known as plug-in method, is an algorithm for finding the shortest path between vertices in a given weighted graph.)
Dijkstra算法求任意两点间最短路径
- dijkstra算法,解决两点间最短路的问题(Dijkstra algorithm to solve the problem of the shortest path between two points)
Ant colony algorithm
- 通过蚁群算法 避障寻找最短路径(Obstacle avoidance by ant colony algorithm to find the shortest path)