-
tanxinfangfa
说明： 贪心方法是一种改进了的分级处理方法。它首先根据题意，选取一种量度标准。然后按这种量度标准对这n个输入排序，并按排序一次输入一个量。如果这个输入和当前已构成在这种量度意义下的部分最优解加在一起不能产生一个可行解，则不把此解输入加到这部分解中。这种能够得到某种度量意义下的最优解的分级处理方法称为贪心方法。(greedy method is an improvement of the classification methods. According to its first title Italy, and a selection of standards of measurement. Then, under such a standard measure of this sort n input, with an input an order volume. If the input current and constitutes a measure of significance in this part of the optimal solution together not produce a feasible solution. this solution will not put this added to the importation of decomposition. This can be a meaningful measure of the optimal solution hierarchical method, known as greedy method.)
- 2006-05-15 21:50:01下载
- 积分：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
-
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
-
ExchangeTree
先序创建二叉树，将二叉树所有节点的左右子树交换，再先序遍历输出(create a binary tree in first order, exchange all the nodes of the binary subtree , then preorder output)
- 2014-07-08 21:30:13下载
- 积分：1
-
FreeTree
无环连通图G=(V, E)亦称为自由树T，其直径是树中所有顶点之间最短路径的最大值，设计一个算法求T的直径(Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T)
- 2013-10-29 16:31:47下载
- 积分：1
-
LR(0)
简单LR语法分析程序自动生成器的实现，可用作数据结构课程设计(LR (0) grammar analysis)
- 2013-09-22 09:26:25下载
- 积分：1
-
CatchData
说明： 读取股票数据文件,C++源程序，非常好用。是学生做毕业设计的源料(Read the Stock Data File)
- 2010-03-22 20:19:35下载
- 积分：1
-
route-planning
遗传算法实现飞机在三维空间的航迹规划
C代码(Genetic Algorithm Route Planning
C code)
- 2012-04-20 09:23:18下载
- 积分：1
-
optional-project-blackjact
经典数据结构作业，黑杰克游戏。要求程序可以连续打10次，每场比赛的赢家，赢得一个点（两点一倍）。在结束的10场比赛为你和电脑打印出的总奖金。(Write a program that simulates a simplified version of the game "BlackJack". A deck of cards numbered 2 to 10, jacks, queens, kings, and aces is used, where jacks, queens and kings are counted as 10s, and aces are either 1 or 11 at your choice. )
- 2012-12-08 11:46:33下载
- 积分：1
-
huffman
使用C语言完成党的霍夫曼编码，主要使用树的数据结构，作为巩固数据结构的练习(Using the C language to complete the party' s Huffman coding, the main use of the tree data structure, data structure as a consolidation exercise)
- 2013-07-15 23:59:47下载
- 积分：1
