搜索资源列表
duoduantudongtaiguihua
- 多段图问题的动态规划算法设计 1. 掌握有向网的成本邻接矩阵表示法 2. 能用程序设计语言实现多段图问题的动态规划递推算法 3. 基本掌握动态规划法的原理方法.-The issue of multi-stage plan the design of a dynamic programming algorithm. Grasp of the cost to the network adjacency matrix representation 2. Can be used pro
xulie
- 利用动态规划法求解次最长公共子序列问题。-The use of dynamic programming method for solving second longest common subsequence problem.
CommonAlgorithmDesign
- 常用的算法设计方法集合，主要有迭代法、穷举搜索法、递推法、贪婪法、回溯法、分治法、动态规划法-Algorithm commonly used method of collection, mainly iterative, exhaustive search methods, recursion, greedy method, backtracking, divide and conquer, dynamic programming
AlgorithmCode
- C++版本的各类算法源代码，包括动态规划法、分治法、贪心法、回溯法、分支限界法、概率算法-C++ source code version of the various algorithms, including dynamic programming, divide and conquer, greedy method, backtracking, branch and bound method, probability algorithm
algorithm2
- 最大子段和/三种方法/c++语言/(内有报告) 蛮力法，动态规划法，分治法。 可比较时间，随机输入数据...... -The largest sub-segment and/three methods/c++ language/(within report) brute force method, dynamic programming, divide and conquer. Comparable time, the random input data ......
LCSLength
- 动态规划法实现最长公共子序列，C++实现，可直接运行-a realization of LCSLength
knapsack
- 蛮力法和动态规划法解决01背包问题。输入文件"backpack.in"：第一行两个整数：物品个数N，背包容量.之后N行每行两个整数，分别为物品重量和物品价值-Dynamic programming method to solve the 01 backpacks problem. The input file backpack.in,: two integers: the first line items number N, backpack capacity after two integer
dongtaiguihua
- 动态规划法所有算法，测试多段图最短路径程序代码，测试Floyd算法程序等-All dynamic programming algorithm to test multi-stage shortest path map program code, test procedures Floyd algorithm
dynamic
- 背包问题是NP完全问题，本程序通过动态规划法优化实现了一种背包问题。-Knapsack problem is NP-complete problems, this program through dynamic programming optimization implements a knapsack problem.
The-longest-common-substring
- 最长公共子串，包括一个动态规划法的两个字符串最长公共子串的计算，和多个字符串最长公共子串的C代码-Longest common substring, including two strings of a dynamic programming method of computing the longest common substring, and multiple string longest common substring of C code
matrix_chain
- 动态规划法之矩阵链乘问题，算法导论（第二版）第十五章内容-Matrix chain multiplication problem of dynamic programming algorithm Introduction (Second Edition) Chapter XV content
dhtcvp
- 用动态规划法-解决流水作业调度的问题,得出最优解,很好的案例-Solve with dynamic programming- line production scheduling problem, it is concluded that the optimal solution, a good case
子段和问题
- 用贪婪法 动态规划法 分治法三种方法求解最大子段和问题(Solving the largest sub segment sum)
Maxsum
- 用蛮力法、分治法、动态规划法实现最大子段和(There is MaxSums in three way.)
fonctionpane
- 用动态规划法计算目标函数最小化的优化程序,实用性很强,()
Subsets
- 数据输入：由文件input.txt提供输入的数据。文件第一行有2个正整数n和c，n表示S的大小，c是子集和的目标值。接下来的1行中，有n个正整数，表示集合S中的元素。 结果输出：将子集和问题的解输出到文件output.txt。当问题无解时，输出“No Solution”。(Data Entry: The input data provided by the file input.txt. The first line of the file has two positive integers
jwsj
- 该程序是一个用动态规划法解决0-1背包问题的小程序,可以为学习动态规划法遇到困难的同学提供帮助()
马的周游
- 一个小算法，实现了骑士周游，主要使用了动态规划法，运行速度也快。(A small algorithm to achieve the Knight Tour, the main use of dynamic programming method, the speed is also fast.)
JTTCLW
- 本算法实现2-10集合划分问题,采用动态规划法和大整数方法()