-
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
-
chessboard-distance
一道poj上的问题的解答，棋盘上的距离问题。即实现棋盘上从一个点移动到王，后，兵之间最短步数的解答。(A poj answers to your questions on the chessboard distance problem. That is, move from one point to the king on the board, after the shortest number of steps between the soldiers answer.)
- 2012-06-20 10:10:45下载
- 积分：1
-
the-shortest-path-of-chart
求有向图的最短路劲，根据所给图的边长和顶点，建立有向图，以邻接表的方式存储，并编写程序求从有向图任一点出发的最短路径(according to the graph with sides and vertex, establish a directed graph, and write a program find the shortest path from one of the point of the chart
)
- 2020-07-16 11:28:50下载
- 积分：1
-
exchange
这是一个二叉树左右子树交换的简单程序，希望对大家有用！(This is a binary tree so the simple sub-tree exchange procedures in the hope for all of us!)
- 2009-10-16 21:02:19下载
- 积分：1
-
hash
使用全排列实现hash，看看吧相信对大家会有些帮助的(Full array hash)
- 2011-08-19 21:25:34下载
- 积分：1
-
Binary-Tree-Sort
二叉树排序，二叉树的递归调用排序，属于C语言源码(Binary Tree Sort)
- 2011-09-01 10:14:24下载
- 积分：1
-
哈夫曼树解码和编码
哈夫曼树，基本的数据结构，用来编码和解码、用数组作为存储结构实现，
- 2023-04-13 11:00:11下载
- 积分：1
-
lianbiao
用c语言写的线性链表的创建、删除、插入、销毁代码(With c language to create a linear linked list, delete, insert, destroy code)
- 2011-10-13 23:06:55下载
- 积分：1
-
yuesefuhuan
使用VC编写的约瑟夫环程序，简单明了，方便使用(Prepared using the VC Joseph Central program, simple and clear, easy to use)
- 2009-09-08 16:45:26下载
- 积分：1
-
Is_BST
This is a C++ code. It finds out if the tree is a binary search tree (BST)or not, where the BST is one of data structures types.
- 2012-02-02 05:45:59下载
- 积分：1
|
联系客服（QQ：3324461878）
