资源列表
GAs
- 使用遗传算法求一个多项式函数在区间[0，37]之间的极大值，编程环境采用Matlab6.0。-The use of genetic algorithm for a polynomial function in the interval [0,37] between the maximum value, the use of programming environment Matlab6.0.
node
- 自己编写的解八数码问题的简单算法，用c++实现-I have written eight digital solution of a simple algorithm for the problem.
Hamilton
- 利用回溯法求解hamilton回路的算法-Use of backtracking algorithms for solving circuit hamilton
perm
- 利用回溯法求解背包问题和全排列的算法，用c++实现。-The use of retrospective method knapsack problem and the whole array of algorithms, using c++ realize.
package
- 用动态规划来解背包问题,很不错的算法，可以学习学习-Using dynamic programming to solve knapsack problem, it is a good algorithm, you can learn
three-sample-of-Data-Structure
- 数据结构，一共有三个文件，多项式相加，二叉树几种操作，数组正负排序-Data structure, a total of three documents, the sum of polynomials, binary tree several operations to sort the array of plus or minus
SelectList
- 查询链表。数据结构中算法小程序。很适用哟！-Query list. Data structure algorithm applet. Very applicable yo!
DeleteList
- 删除链表。数据结构中算法小程序。初学者很适用的。-Delete list. Data structure algorithm applet. Beginners are applicable.
dui
- 堆排序，数据结构算法小程序。初学者很适用-HEAPSORT, data structure algorithm applet. Beginners are applicable. .
knapsack.ok
- 是一个背包算法程序，可以实现简单的背包原理算，对理解这一算法很有帮助。-this is a algorithm of napsake, can be achive application of napsake, it is useful to understanding the algorithm.
SUANFA
- 计算机算法课程中的实验 单源点最短路径问题 可以自由输入有向权图 -Computer algorithms course experiments, single source shortest path problem has to be free to enter the right of Figure
hannuota
- 算法思路： 1.如果只有一个金片，则把该金片从源移动到目标棒，结束。 2.如果有n个金片，则把前n-1个金片移动到辅助的棒，然后把自己移动到目标棒，最后再把前n-1个移动到目标棒. 3.单纯对于有N个金片要挪动的步数求出, 可以使用递推方法,满足递推方程f(i) = f(i - 1) * 2 + 1-Algorithm idea: 1. If there is only a gold film, while the gold from the source to the