搜索资源列表
DIJKSTRA
- 最短路径问题是重要的最优化问题之一，在现实生活中具有重要意义，比如：管道铺设、线路安排。-The shortest path problem is an important one of the most optimization problems, in real life is of great significance, such as: pipeline, line arrangement.
jsjy20070288
- :针对遗传算法易陷入局部最优的不足,在标准遗传算法基础上加入了三个新的操作- 复原、重构和录优操作,使改 进后的遗传算法收敛于全局最优,并在此基础上以路边约束、动态避障和路径最短作为适应度函数,提出了动态避障的路径 规划方法。通过实验仿真验证了算法的有效性、准确性和实时性,并与基于以往的遗传算法的路径规划方法进行比较,结果 表明本文提出的方法在产生的路径长度和算法运行时间上都具有更优的性能。-: Genetic algorithm for the lack of easy to
Dijs
- 求从源点到其余各顶点的最短路径，用Dijkstra算法 程序要输入各边顶点和边长，用Dijkstra输出最短路径长度和最短路径 -Demand from the source point to the rest of the vertices of the shortest path using Dijkstra algorithm program to enter each side of vertex and edge length, with the output of Dijks
DijkstraAlgorithm_src
- algorithm that finds the shortest path within a graph.
Optimization
- matlab优化方面的例子，包括最短路、生成树等常见的例子-matlab optimization examples, including the shortest path, spanning trees and other common examples of
Optimization
- matlab优化案例，有最小生成树，最短路等源代码-matlab optimization case, there is minimum spanning tree, shortest path and so the source code
shortest_path
- 图论中求最短路径问题的lingo实现代码，包含用0-1变量规划和用动态规划的源码。-Graph theory in order to achieve the shortest path problem of the lingo code, including 0-1 variables with the planning and dynamic planning source.
GATSP
- 通过此程序能够利用遗传算法解决TSP问题，即图论中从某一点出发经过所有点一次的最短路径求解问题-Through this program can take advantage of genetic algorithm to solve the TSP problem, namely, graph theory starting from a point in time through all the points for solving the shortest path problem
spfa_algorithm_fengzee
- 最短路径 之 SPFA算法 作者:fengzee 日期:2008-02-15 SPFA——Shortest Path Faster Algorithm，它可以在O(kE)的时间复杂度内求出源点到其他所有点的最短路径，可以处理负边。SPFA的实现甚至比Dijkstra或者Bellman_Ford还要简单-The shortest path algorithm for the SPFA Author: fengzee Date :2008-02-15 SPFA- Shortest Path Fa
MathematicalModelingandMathematical
- 数学建模与数学实验（第3版） 第1讲 数学建模简介 第2讲 MATLAB入门 第3讲 MATLAB作图 第4讲 线性规 第5讲 无约束优化划 第6讲 非线性规划 第7讲 微分方 第8讲 最短路问题程 第9讲 行遍性问题-Mathematical Modeling and Mathematical Experiments (3rd edition) Section 1 Introduction to Mathematical Modeling 2 speaker
Astar
- 代码很好的实现了基于a-star的最短路径寻找算法，并可以对寻找的路径有一个限制-Code is a good realization of a-star-based shortest path search algorithms, and can find the path there is a limit
poj
- pku 3613 Cow Relays 题意：给一个无向图，求从起点s到终点e尽力n条边的路径最小值。 边的数量2<=t<=100(每条边可以重复遍历) 算法：利用dp求出 path[ l ] [ i ] [ k ]=MIN(path[ l ][ i ] [ k ] , path[ l ][ i ] [ j ] + path[ l ][ j ] [ k ]) l 表示的是2的指数，假设 i 到 k 要途径 2^l 条边，那么他可以被分为两段 途径2
vb-Mapinfo-zuiduanlujin
- vb,Mapinfo,最短路径。调试通过。值得学习。-vb, Mapinfo, the shortest path. Debugging through. Worth learning.
suanfa
- 算法 单源最短路径实现方法 计算机上机实验 算法课程-Single-source shortest path algorithm is a computer-on Implementation of Experimental Algorithms Course
Floyd
- 采用了动态规划法即FLOYD算法利用矩阵求多源最短路径的JAVA实现-Using a dynamic programming method that is FLOYD algorithm uses matrix Multi-source shortest path to achieve JAVA
Noname1
- 用无向网表示你所在学校的校园景点平面图，图中定点表示主要景点，存放 景点的编号、名称、简介等信息。要求能够回答有关景点介绍、游览路经等问题。 要求：(1)查询各景点相关信息； (2)查询图中任意两个景点的最短路径。 (3)查询图中任意两个景点的所有路径。 --Free to the net means that the school campus attractions in your plans, the figure fixed-point of their main a
OptimalPathAlgorithm
- 用VB6.0实现的最短路径分析，采用了优化的方法（搜索方向一致性）-Using VB6.0 to achieve the shortest path analysis, using optimization methods (search direction consistency)
we
- 动态规划求最短路径 求S到T的最短距离-Seek the shortest path dynamic programming
Graph
- c写的贪心算法，利用指针来搜索最短路径，以及可以扩展成一般最短路径的求法-c write greedy algorithm, using a pointer to search for the shortest path, as well as the shortest path can be extended into a general law of demand
mdijkstra
- this to find out the shortest path for various nodes-this is to find out the shortest path for various nodes