搜索资源列表
MatrixMul
- 矩阵连乘算法，实现几个矩阵相乘的最优顺序，并计算出复杂度-matrix continually multiply algorithm, achieving several matrix multiplication, the optimal sequence and calculated complexity
migong-c
- 迷宫算法！通过递归算法实现！找到最优路径，完成迷宫出口的查找！-maze algorithm! Through recursive algorithm! To find the optimal path to complete the maze exports to search!
最优化
- 运筹学中，用单纯性算法来实现最优化max准则的源程序。 因为是初学者， 可能有些不标准请谅解-tacticians, and use simple algorithms to achieve optimal max guidelines of the source. Because beginners, some may not please standards of Understanding
getd
- 最优化设计程序之一.共轭剃度法.给出步长和初值.-optimal design procedures one. Conjugate tonsure law. And given initial step.
quanguojiaotongzixun
- 用最短路径解决. 提供三种最优决策:最快到达,最少费用,最少中转站.-solution with the shortest path. For three optimal decision : fastest to reach at least cost, at least transfer stations.
LimitBin
- 装箱问题：在装箱问题中，有若干个容量为c 的箱子和n 个待装载入箱子中的物品。物品i 需占 用s[i]个单元（0< s[i]≤c）。成功装载是指能把所有物品都装入箱子。最优装载是指使用最 少箱子的成功装载。 例如某运输公司要把包裹装入卡车中，每个包裹都有一定的重量，且每辆卡车也有其载 重限制（假设每辆卡车的载重都一样）。在卡车装载问题中，希望用最少的卡车来装载包裹。 此问题可看作装箱问题。卡车对应于箱子，包裹对应于物品。 解装箱问题的Best Fit 算法： 设
010101
- 快速最优通道布线算法 快速最优通道布线算法-rapid Optimal Routing Algorithm for fast access channel Optimal Routing Algorithm for fast access Optimal Routing Algorithm
lqx100003
- 最优合并问题 给定K个排好序的序列s1,s2,...,sk,用2 路合并算法将这k个序列合并成一个序列。 假设所采用的2路合并算法合并2个长度分另为m 和n的序列需要m+n-1次比较。试设计一个算法确定合并这个序列的最优合并顺序，使所需的总比较次数最少。-optimal merging given K platoons good sequence of sequence s1, s2 ,..., sk. using 2-way merger of this algorithm k se
FJS
- 按作业效益非增序输入作业的截止期限，要求使用上述规则设计出一个算法，使得输出为一个作业可行集j[]。即如果作业i可以在截止期限前执行完毕则将其加入j[]。这样得出的一个结果是最优解，可以获得最大的效益值。-operating efficiency by increasing non-operating input sequence that the deadline for requests to use these rules to design a lgorithm, the output
beibaowenti007
- 用动态规划的向后处理法求解背包问题的最优决策序列。即给定一个背包序列的重量和相对应的效益值。做出一个最优决策序列Xi(i=1~n)，使得最终效益和最大。-dynamic planning backward processing method knapsack problem of optimal decision-making sequence. That is, given a sequence of backpack weight and the relative value of the
fjdjf
- 用分支界限法解决的几个问题:包括0-1背包问题,最大团问题,电路布线问题,最大装载问题.作业最优处理问韪.-branch line with the law to solve several problems : including 0-1 knapsack problem, the largest group, circuit wiring problem, the greatest problem loading. Optimal handling operations Q premises
tangxin
- 贪心算法求磁盘最优存储问题,能够解决此问题.不失为一种好办法.-greedy algorithm for optimal disk storage, to solve this problem. It is a good approach.
asdcv
- 利用哈希函数对学生姓名进行最优化查找 可选择从键盘输入和文件输入,需输入名字最大长度-hash function to the students find the most optimal choice from the keyboard input and the input document, name must be imported maximum length
eightdirection
- 以八个方位为主的迷宫问题解法，列出所有可能解法，并找出最短路径及计算出最佳解的个数。-mainly to the eight position maze Solutions, listing all possible solutions, and find the shortest path and calculate the number of the optimal solution.
matrix_mult
- 矩阵链的相乘的源代码，采用动态归还算法求解得到最优解。-chain matrix multiplication of the source code, the return of dynamic algorithm to obtain the optimal solution.
wTin
- tin生成源代码，用于产生最优tin，具体详见代码-tin generate source code, for the purpose of generating optimal tin, detailed specific code
finddepth
- 集合算法，最优二分搜索树，最长公共子序列，union—find算法的应用与推广-Collection algorithm, the optimal binary search tree, the longest common subsequence, union-find algorithm of the application and promotion of
The-optimal-route-inquires-bus
- C开发，利用Floyd算法找出按时间的所有两站之间的最优路径，按时间最优的路线选择，按价格最优的路线选择-C,Floyd，Find out optimal path，by time, by price
Optimal-binary-search-tree-algorithm
- 最优二叉搜索树算法，Optimal binary search tree algorithm-Optimal binary search tree algorithm
Optimal-trade-problem
- 最优贸易问题，数据结构课程设计，内含具体题目要求及完整的工程文件，供大家学习参考。-Optimal trade issues, data structure curriculum design, including specific subject requirements and complete project file, for everyone to learn.