搜索资源列表
knapsack
- 程序设计思路 在动态规划中,可将一个问题的解决方案视为一系列决策的结果,要考察每个最优决策序列中是否包含一个最优子序列。所以在最短路径问题中,假如在的第一次决策时到达了某个节点v,那么不管v 是怎样确定的,此后选择从v 到d 的路径时,都必须采用最优策略。利用最优序列由最优子序列构成的结论,可得到f 的递归式。f ( 1 ,c) 是初始时背包问题的最优解。可使用(1)中所示公式通过递归或迭代来求解f ( 1 ,c)。从f (n, * )开始迭式, f (n, * )由第一个式子得出,然后由
dongtaiguihua
- 该程序实现了动态规划问题,这样来求最短路径 绝对原创-The program achieved a dynamic programming problem, so that the shortest path to seeking absolute originality I would like to thank
SHORT
- 本程序采用了动态规划的方法来求最短路径的问题-This procedure uses dynamic programming approach to the problem of seeking the shortest path
ShortestWay
- 因为作业的关系,在前辈们的C++源码上改写成php源码。解决动态规划算法求解最短路径问题-Because the relationship between operations in the predecessors of the C++ source code to read the php source. Dynamic programming algorithm to solve shortest path problem
jsjy20070288
- :针对遗传算法易陷入局部最优的不足,在标准遗传算法基础上加入了三个新的操作- 复原、重构和录优操作,使改 进后的遗传算法收敛于全局最优,并在此基础上以路边约束、动态避障和路径最短作为适应度函数,提出了动态避障的路径 规划方法。通过实验仿真验证了算法的有效性、准确性和实时性,并与基于以往的遗传算法的路径规划方法进行比较,结果 表明本文提出的方法在产生的路径长度和算法运行时间上都具有更优的性能。-: Genetic algorithm for the lack of easy to
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.
we
- 动态规划求最短路径 求S到T的最短距离-Seek the shortest path dynamic programming
wtsf.tgz
- N皇后问题回溯算法.c 货郎担分枝限界图形演示.c 矩阵乘法动态规划.c 万年历 动态计算网络最长最短路线.c 货郎担限界算法.c 骑士遍历 网络最短路径Dijkstra算法.c-N queens problem backtracking algorithm. C TSP branch and bound graphical presentation. C matrix multiplication, dynamic programming. C calendar dynamic compu
GridSinglePaint
- 格路问题:经典的算法分析与设计题目,用动态规划的方法解决从一个网格起点到终点的最短路径问题-Lattice path problem: the classical algorithm analysis and design topics, with the dynamic programming solution to start from a grid to the end of the shortest path problem
mmmm
- 动态规划中图形算法中的最短路径算法 用类做的,分几个函数-The short road of dymta i don t know what is this program means,it is a c++ program !numeric recipes in C++
suanfaqxf
- 算法实验报告+源代码 实验一 1题 归并排序.cpp 11 实验一 2题 快速排序.cpp 12 实验二1题 贪心法求背包问题.cpp 13 实验二2题 贪心法求最短路径.cpp 16 实验三 动态规划求最短路径.cpp 17 实验四 回溯法求背包.cpp 18-Algorithm+ source code for test lab reports a problem for a merge sort. Cpp 11 question tes
ShortestPath
- 本程序是使用动态规划算法来解决单源最短路径问题。使用时,先输入每个头结点的邻接顶点个数,然后输入每个邻接顶点的数据。-This procedure is to use the dynamic programming algorithm to solve the single-source shortest path problem. When used, enter each of the first number of vertices adjacent node, and then ente
PSO-image-segmentation-algorithm
- 为了提高算法的执行效率, 应用粒子群算法求取图像中任意两点间最短路径来定位目标边界, 并与经典的基于Dijkstra 动态规划图搜索的Liv e Wire 算法进行比较.-In order to improve the efficiency of the algorithm, particle swarm algorithm to strike any of images to locate the shortest path between two object boundaries, and
DPAlgo
- 用分支定界算法求解一个点到点最短路径问题,并有最大开销限制。所用的数据矩阵很大,可以用来研究分支限界和动态规划。-Branch and bound algorithm for a point to point shortest path problem, and the maximum spending limits. The data matrix can be used to study branch and bound and dynamic programming.
floyd
- 动态规划的算法,求解所有的路径之间的最短路径,时间复杂度在O(n3)-Dynamic programming algorithm for solving the shortest path between all paths, the time complexity of O (n3)
dongtaiguihua
- java实现的动态规划算法,从指定文件中获取图,判断是否存在最短路径并求出其最短路径-java implementation of the dynamic programming algorithm to obtain the diagram from the specified file to determine whether there is a shortest path and calculate the shortest path
TSHORTTh
- 本程序采用了动态规划的方法来来求最短路径的问题可直接使用。 -This program uses a dynamic programming approach to the shortest path problem can be used directly.
zuiduanlujing
- 解决动态规划问题中的一个重要问题最短路径问题,通过各条路径的权重,最后得出最优的路径选择。-The shortest path problem, an important problem in the dynamic programming problem through various paths of the right weight, and finally arrive at the optimal path selection.
Multistage
- 多段图的最短路径问题使用的是动态规划算法,代码中包含了详细的过程且有程序实现的截图。-Multistage Graph shortest path problem using a dynamic programming algorithm, the code contains a detailed process and procedures to achieve the screenshots.
duoduantu
- 多段图问题的动态规划算法与实现 功能:求源点到汇点的最短路径及决策过程。 要求:用向前处理和向后处理方法分别对给出的数据,进行求解(注意在文档中画出多段图)。给出复杂性分析。 输入:多段图的段数,顶点数,以及每条边的权重。 输出:多段图的最短路径和决策过程。 -Many of the map of the dynamic programming algorithm and implementation features: seeking the source point to