-
lujing
图的邻接表生成，深度遍历及任意两点间的路径(The adjacency table to generate deep traversal path between any two points)
- 2012-05-22 18:18:29下载
- 积分：1
-
shizuo
用哈夫曼编码的方式进行图像的压缩，其中定义了一个cdib的类，通过之类来对图像进行处理(image coding in haffman)
- 2012-04-27 18:37:47下载
- 积分：1
-
sad
编程 主范式 使用真植表
用栈的应用 使用了 后缀表达式
(biancheng zhu fanshi)
- 2012-06-18 14:16:30下载
- 积分：1
-
maze
实现经典问题老鼠迷宫，并用坐标将路径显示出来(Achieve classic problem rat maze, and coordinate with the path displayed)
- 2016-05-25 22:56:59下载
- 积分：1
-
listnode
C++中，对链表的增删改查的基本使用，值得学习(C++, on the list of CRUD basic use, it is worth learning)
- 2015-08-05 17:57:12下载
- 积分：1
-
Hash-table
本代码主要实现了哈希表的设计，完成了哈希函数的相关要求。(The code is designed to achieve a hash table, the completion of the relevant requirements of the hash function.)
- 2013-12-30 17:15:14下载
- 积分：1
-
fast_sort
/*快速排序：以待排序元素中的第一个元素作为基准将带排序的元素分为三组
*大于基准元素为一组置于基准值的右边，小于基准值的元素为一组置于基准值的左边，
*基准值为一组，这样就找到了基准元素的位置就确定了
*如此递归调用。直到每一组的low==high，即实现了排序的要求。
*/
(/* Rapid Sort: the first element to be sorted in the element as a basis with with sorting the elements are divided into three groups* is greater than the reference element of a group is placed on the right side of the reference value, smaller than the reference value elements for a group of placed on the left side of the reference value,* reference value, a group, so that the location of the reference element is found it is determined* so recursive call. Until each group of low == high to achieve the requirements of the sort.* /)
- 2012-10-26 21:42:43下载
- 积分：1
-
build_max_heap
最大堆排序算法，C++语言编写,原程序，算法导论(The maximum heap sort algorithm, C++ language)
- 2015-01-26 16:15:21下载
- 积分：1
-
mifeng
c语言平时作业练习，包括输入输出，数组，链表等
c语言平时作业练习，包括输入输出，数组，链表等(output mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifeng)
- 2014-04-28 16:01:53下载
- 积分：1
-
Kruskal
克鲁斯卡尔算法思想.cpp
int seekedge(EDGE * (&a), int n)
void bubble(EDGE * (&a), int size)
void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针，a2是最小生成树边集的头指针，k为所要删的边
void storepicture(EDGE * (&a), int n, VERTEX *b, int m) (Thinking of Kruskal algorithm. Cpp int seekedge (EDGE* (& a), int n) void bubble (EDGE* (& a), int size) void searchandjoin (EDGE* (& a1), int k) // a1 edge set is the first pointer map, a2 is the minimum spanning tree of the first indicators margination, k for the edges to be deleted void storepicture (EDGE* (& a), int n, VERTEX* b, int m) )
- 2009-06-27 01:43:39下载
- 积分：1
