搜索资源列表
经典约瑟夫环问题c语言版
- 数据结构中解决约瑟夫环问题的代码，里面只有源代码，大家用TC2编译一下就可以用了：）。-data structure to solve the problem of Josephus code, only the source code, we use TC2 compiler can use it with a :).
经典汉诺塔问题c语言版
- 汉诺塔是初学数据结构的同学最头疼的问题，这里是一个用递归函数解决汉诺塔问题的经典c语言程序，里面有代码和执行文件。-HANOR data structure is that when the students most headaches, here is a solution using a recursive function HANOR a classic c language program, which has code and the implementation document.
match(man&women)
- 回溯法 解决男女匹配问题 八男八女匹配-Backtracking address gender matching eight men and eight women match
Mase
- 用VC写的，用栈解决了数据结构基本的迷宫问题.没有用到MFC类库-VC wrote, with a stack data structure to solve the basic problem of the maze. Do not use MFC
unicode_ansi_chinese
- ansi和unicode之间的相互转化，解决了中文gb码的显示问题.为解决wince与windows通讯问题开发的-ansi and conversion among the resolve of the Chinese gb yards indication of the problem. For Jack and windows development of the communication problem
全排列
- 多种方法解决全排列的问题 在vb环境下编写-various methods to solve all problems with the environment in preparation vb
分支限界算法求解TSP问题
- 本程序用分支界限方法解决ＴＳＰ问题，即旅行商问题．-the procedures used branch line solution to TSP, the traveling salesman problem.
近邻算法求解TSP问题
- 本程序用另外一种算法即近邻算法解决ＴＳＰ，即旅行商问题，请高手指教．-this procedure with the other algorithms that solve the TSP neighbor algorithm, the traveling salesman problem, experts advise.
切割
- 这是一个分治解决的零件切割问题:给定一块宽度为W的矩形板，矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi，宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。问如何切割使得所使用的矩形板的高度h最小？加上一个小界面-This is a solution to the partition cutting parts : a given width of the rectangular plate W, the height of rectangular plat
ayangmovie
- 有关遗传算法的例子，可以解决诸如数学中函数近似最大值，最短路径的问题.vb开发的,很好的 .-example, can be resolved, such as mathematics function approximate maximum shortest path problem. Vb development, very good.
背包算法
- 高级算法中的背包问题求解，算法简便高效，主要解决动态规划0-1背包问题-senior algorithm to solve the knapsack problem, the algorithm is simple and efficient, dynamic programming solution 0-1 knapsack problem
贪婪算法解决背包
- 运用贪婪算法能够很好解决0/1背包问题，这是我编的一个小程序，运行过很好。-greedy algorithm can be used to solve a very good 0 / 1 knapsack problem, this is my part of a small program running very good.
r8q
- 八皇后问题的C版本的解决方案 包括如何处理两个皇后不能在同一列、同一行以及同以斜行的判断问题-eight of the Queen's version of the C solutions, including how to deal with two Queen's not in the same series, and with the same line oblique to the question of judgment
01背包问题
- 采用分枝限界法解决0/1背包问题! 本人上机实习作业,通过老师验收,合格! 针对部分上机实习的同学可以来下~-used Branch and Bound France 0 / 1 knapsack problem! I practice on the machine operations, acceptance by the teachers, qualified! In view of the attachment on the machine for students to the
统计单词个数
- 利用哈希表统计文本文件中单词的个数，哈希函数的实现为取模法，利用链地址法解决冲突。-use Hash Table Statistics text file number of words, the realization of Hash Functions for Remainder law, the use of chain law addresses solution to the conflict.
队列解决杨辉三角
- 队列解决杨辉三角-Queue solve Pascal's Triangle
背包问题的解决
- 背包问题的解决 :给定一个超递增序列和一个背包的容量,然后在超递增序列中选(只能选一次)或不选每一个数值,使得选中...解决0/1背包问题的方法有多种,最常用的有贪婪法和动态规划法。
银行家算法解决死锁
- 应用银行家算法解决死锁问写的银行家算法，只能实现固定进程和资源的操作，不过要是应付作业什么的没有问题，绝对可以运行 -application bankers algorithm to solve the deadlock was asked bankers algorithm, the process can only be fixed and operational resources, but what if the deal with no operational problems and
递归解决Hanoi汉诺塔
- 解决Hanoi问题
归并法解决石子问题
- 归并法解决石子合并问题，n堆石子围成一圈，利用归并法解决此问题。