搜索资源列表
SourFile
- 高效率的并查集。 使用rank来优化。-Efficient and check collection. To optimize the use of rank.
TestDijkstraWithGPHeapSort
- 使用堆优化的最短路径算法,速度非常快,建议下载-Optimize the use of heap shortest path algorithm, very fast
SPFA
- 自己写的SPFA,可以给初学者参考,速度比优化Dijkstra要慢-Wrote it myself SPFA, can give a reference for beginners, speed slower than Dijkstra Optimize
DP
- 三篇关于动态规划优化的文章，四边形不等式优化以及一些其他特殊情况下的优化-3 on the dynamic programming to optimize the article, optimization of quadrilateral inequality as well as some other exceptional circumstances, the optimization ... ...
LLK
- 连连看游戏设计，最短路径的寻找，判断两个图形是否可消，怎样优化寻路算法。-Lianliankan game design, to find the shortest path to determine whether the two graphic consumption and how to optimize the way-finding algorithm.
3230
- 带堆优化的贪心，从题意中我们可以得到的最暴力解法就是，每天都搜索整个数组，找出符合条件的题目并且它的经验是最大的，这样找M天就好了。接下来就是如何优化，在每次找的时候我们只要找经验最大的，因为可以用大顶堆组织可以做的题目，每次升级之后加入新的可以做的题目就OK了。-Optimized with a greedy heap, from the meaning of the questions, we can get the most violent solution is that every d
Mesh
- 摘要：针对传统的DP算法存在条纹瑕疵，提出了一种改进的垂直性约束动态规划立体匹配算法，通过利用扫描线间的相关信息来约束动态规划过程，使得处理每一条扫描线时都能充分利用以前扫描线的匹配信息。实验结果表明，该算法可以明显地消除传统DP算法的视差图的条纹瑕疵，匹配精度高, 而且执行时间短。-ABSTRACT Although network speed has been increased over the years,bandwidth limitation continues to pos
AFSA
- 人工鱼群算法在调整和优化机器人路径中的应用-Artificial fish swarm algorithm to adjust and optimize the paths of the robot
uuy
- 最优化问题之一的算啊与代码 多级安全中敏感标记的最优化挖掘 C++算法与分析-Optimization problem with one count ah multi-level security code in the most sensitive marker of the C++ algorithms to optimize mining and analysis
Dijstra
- Dijstra算法c源代码。优化完整版。-Dijstra algorithm c source code. Optimize the full version.
BAB
- 使用分支定界法进行特征选择，是基于单调准则函数进行优化搜索的一种方法。-Feature selection using the branch and bound method, a method based on a monotonic criterion function to optimize the search.
hdu3480Division
- hdu3480Division的源码，解法是斜率优化DP-hdu3480Division source, Solution slope optimize DP
regedit_7
- vb写的无判断注册码程序，优化大师曾经用过！-No judgment registration code of vb programs, optimize once used by the master!
quickSortApp
- 对经典的递归快速排序采用选择法和栈进行优化，提高了算法的运行效率，使得对快速排序的理解更加深入。-The classical recursive quick sort and stack using the selection method to optimize and improve the operating efficiency of the algorithm, such that for more in-depth understanding of quick sort.
sudoku
- //一个解数独的程序，纯C编写，不依赖特殊库，移植容易。个人原创！ //采用的回溯法，剪枝程序采用动态规划思想进行了大量优化，比一般数独程序可以统计用多少步，中间碰到多少分支，侧面反映题目难度，虽然不能和人的技巧相比，也可以参考一下。 //对于研究数独方法或许没有帮助，但是可以帮助验证结果，统计难度。对于出题时可以去掉的项，也可用其验证。有代码，看懂后可以随便修改。 //解世界上最难数独大概1s左右 //程序作者：原建业-Sudoku @ a program written in
LCS
- 优化的最长公共子序列算法，可以输出优化值得矩阵以及最后结果-Longest common subsequence algorithm optimization, you can optimize the output matrix and the final result is worth
Genetic
- 此為求解最佳化流程之基因演算法，應用mathcad來編寫，mathcad為一簡易好上手之模擬軟體，若只是想跑小系統之初新者，建議使用-This is the process of solving the genetic algorithm to optimize the application mathcad to write, mathcad for a simple simulation software to use it well, if only wanted to run at th
BinarySearchTree
- java实现二叉树搜索树的查找查找关键字进行优化路径查找-Java implementation of the two binary tree search tree search to find the key word to find the path to optimize the path
sort
- 对快速排序进行优化，对测试数据的前1000个进行排序，并比较优化前和优化后的时间性能差异；实现至少两种线性时间排序算法。(Optimize the quick sorting, sort the first 1000 of the test data, and compare the time performance difference before and after optimization; implement at least two linear time sorting algor