-
ANT
A*算法通过启发式探索下一结点,逐步逼近目标结点,且使得路径最短。(A* algorithm heuristic to explore the next node, and gradually approaching the target node, and that the shortest path.)
- 2012-05-17 09:14:21下载
- 积分:1
-
KMP
数据结构中KMP算法c语言实现,vc6.0环境(KMP algorithm in c language data structure, vc6.0 environment)
- 2013-03-27 14:04:39下载
- 积分:1
-
b
说明: 定义一个类SortArray继承自MyArray,在该类中定义函数sort实现排序功能。
定义一个类ReArray继承自MyArray,在该类中定义函数reverse实现逆转功能。
定义一个类AverArray继承自MyArray,在该类中定义函数Aver实现求解整数的平均值。
定义NewArray类,同时继承了SortArray、ReArray和AverArray,使得NewArray类的对象同时具有排序、逆转和求平均值的功能。在继承的过程中声明为虚基类,体会虚基类在解决二义性问题中的作用。
(Define a class SortArray inherited from MyArray, defined in the class sorting function sort implementation. Define a class ReArray inherited from MyArray, define the function in reverse to achieve such reversal function. Define a class AverArray inherited from MyArray, defined in the class to solve integer function Aver achieve the average. Defined NewArray class, and inherits SortArray, ReArray and AverArray, making the object of both NewArray class sorting, reversing, and the mean value of the function. In the process of succession declared as virtual base classes, virtual base class experience in resolving ambiguities of the role.)
- 2010-06-02 02:13:03下载
- 积分:1
-
04huffman_a
根据最常用的链表法进行huffman编码,可以手工预制权重,例如n=8的时候即可以在文件中写入,输出相应的编码结果(According to the most commonly used method of Chain Huffman coding, manual can be prefabricated weight, For example, n = 8 when it is written in the document, the output corresponding to the coding results)
- 2007-05-29 19:15:26下载
- 积分:1
-
beipaowenti
背包算法的c++简单实现,很有用的,可以看看(Knapsack algorithm)
- 2012-04-10 19:32:41下载
- 积分:1
-
NewCode
清(英文)常见数据结构,代码实现,值得下载,值得分享(Qing (English) common data structure, code implementation, worth downloading, worth sharing)
- 2012-11-21 14:33:49下载
- 积分:1
-
bookmanage
基于数据结构的图书管理系统,基本功能都有,可以拿来作为数据结构的课程设计(Based library management system data structures, basic function, can be used as a data structure of the curriculum design)
- 2020-10-27 00:00:04下载
- 积分:1
-
LongestIncreasingSequence
找出数组A中最长的递增序列的长度,使用动态规划算法,复杂度为O(N*N)。(Find the longest increasing sequence)
- 2011-09-05 17:36:27下载
- 积分:1
-
8queen
此程序用于解决8皇后问题,运行后输出8皇后问题的所有解(This program is used to solve the 8 queens problem, all solutions of 8 queens problem output operation.)
- 2013-05-06 21:15:23下载
- 积分:1
-
2
说明: 用数据结构的遍历,对于小毛驴过河解决实际问题。(Traversing the data structure used for the small donkey across the river to solve practical problems.)
- 2010-06-02 22:50:30下载
- 积分:1