矩形编码压缩源代码是针对图象压缩设计的程序，该算法可用于生物信息学，图象处理等方面...

按层序方式（自上而下，每层自左而右）遍历二叉树,二叉树以二叉链表作为存储-sequence by means (from top to bottom, each of which left from right) traverse binary tree, the binary tree with two forks Chain storage

实现一个数据库的连接池，提高数据库的链接效率，同时还有利于平衡物理上的访问量。-Implement a database connection pool to improve the efficiency of the database links, while also help balance the amount of physical access.

[问题描述] 在二叉排序树中查找关键字为KEY的记录 [输入] 有序表输入要查找元素的关键字 [输出] 查找成功是即可显示查找成功 #include #include typedef int KeyType typedef struct{ -[Problem Description] Binary Tree ranking keyword search for the records KEY [imported] ordered to investigate the importation of table find elements of the keyword search [output] is successful you can show success# include

邓俊辉数据结构源代码邓俊辉数据结构源代码邓俊辉数据结构源代码邓俊辉数据结构源代码邓俊辉数据结构源代码邓俊辉数据结构源代码邓俊辉数据结构源代码邓俊辉数据结邓俊辉数据结构源代邓俊辉数据结构源代码邓俊辉数据结构源代码码邓俊辉数据结构源代码构源代码

堆栈的应用及操作 利用堆栈实现对任意进制的数的转换；-stack

用Fortran开发三维球面delauney三角网剖分程序可用于曲面造型、最小生成树应用领域-Fortran development with three-dimensional spherical delauney Triangulation program can be used for surface modeling, minimum spanning tree applications

求最短路径的C++ 源代码 ，用很简单的数据结构实现的，运行速度很快-The shortest path for the C++ Source code, using very simple data structure to achieve, to run fast

这是关于图论算法里面的一些代码,图论基本的思想代码的实现-This is on the graph theory algorithm inside some code, graph theory, the idea of the basic code realize

我们数据结构课上的一些作业 包括约瑟夫环和哈夫曼树之类的几个程序-Our data structure class operations, including some of Joseph Huffman tree rings and several procedures, such as

该程序用格雷码来生成组合数序列,它比一般的方法要快,这是由格雷码的分布特性所决定的.-the procedures used to generate Gray code sequence portfolio, it generally means than to be fast, it was a Gray code distribution by the decision.