-
shizuo
用哈夫曼编码的方式进行图像的压缩，其中定义了一个cdib的类，通过之类来对图像进行处理(image coding in haffman)
- 2012-04-27 18:37:47下载
- 积分：1
-
labyrinth
迷宫问题c源代码，大小为8*8的迷宫。主函数中输入开始位置和结束位置的坐标，输出所有可能的路径(Maze c source code, size 8* 8 of the maze. Enter the start the main function of the coordinates of the position and end position, the output of all possible paths)
- 2010-12-19 23:31:36下载
- 积分：1
-
beipaowenti
背包算法的c++简单实现，很有用的，可以看看(Knapsack algorithm)
- 2012-04-10 19:32:41下载
- 积分：1
-
HEAP
poj 实现堆结构的源代码。。。话说其实没什么实际功能好么(poj achieve heap structure of the source code. . . In fact, the actual function of saying okay nothing)
- 2013-11-21 23:03:15下载
- 积分：1
-
maze
迷宫求解一般采用“穷举法”，逐一沿顺时针方向查找相邻块（一共四块－东(右)、南(下)，西(左)、北(上)）是否可通，即该相邻块既是通道块，且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)
- 2013-12-13 17:55:45下载
- 积分：1
-
Prim
编程实现Prim算法，基于最小堆数据结构，生成最小代价生成树。
（其中随机生成点和边，形成连通图）
根据输入的顶点数的不同，分析时间复杂度。(Implement Prim’s algorithms based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree.
Generate weighted undirected complete graph for given size n according to the following approach:
1) Randomly generate n points ( ) on a plane
2) Randomly generate k pairs of points as edges of the graph.
3) The weight of an edge of the graph is defined as the the Euclidean distance between two endpoints of the edge.
)
- 2011-06-11 16:28:53下载
- 积分：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
-
code
C++实现的两类问题随机森林生成算法，对学习随机森林很有帮助(Source code for random forests,wanderful codes,and help youself to it!)
- 2020-06-29 22:20:02下载
- 积分：1
-
Huffman
数据结构，利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)
- 2014-01-28 18:25:24下载
- 积分：1
-
findpt
VC游戏编写中的求解最短路径算法源码，本示例是自动寻径演示，篮点是起点，红点是终点，按确定键开始。源码爱好者注：编译后运行的时候请把EXE文件从Debug目录中拷贝到项目根目录中，若不然会出错。 (The preparation of the VC games to solve the shortest path algorithm source code, in this example is the automatic routing demonstration, the basket is the starting point, the red dot is the end point, press the OK button to start. Source enthusiasts Note: When compiled and run, please copy the EXE file from the Debug directory to the root directory of the project, and if not be wrong.)
- 2013-05-17 15:38:23下载
- 积分：1
