资源列表
bound2eight_pfile
- Matlab p file for converting a binary file to an 8-connected boundary.
gaussseidel
- gauss siedel sistemas de ecuaciones
CZipCUnzipCompressUncompressFile
- LZW压缩算法和RLE压缩算法的实现源码及Demo。 本Demo未经过严格测试，请先保存待压缩文件再进行压缩测试。-RLE compression algorithm LZW compression algorithm and the realization of the source and the Demo. This Demo has not been rigorously tested, please save files to be compressed further testi
LZW_RLE_compressAlgo
- LZW压缩算法和RLE压缩算法的实现源码及Demo。 本Demo未经过严格测试，请先保存待压缩文件再进行压缩测试。-RLE compression algorithm LZW compression algorithm and the realization of the source and the Demo. This Demo has not been rigorously tested, please save files to be compressed further testi
LZARI_Cpp_compress
- 一个基于LZARI算法的数据压缩的类.Haruhiko Okumura 于1989年7月4日用c语言写实现了这个算法.但是上面用到了一些全局或静态的变量,在MFC下用起来很不方便.我把它改写成了一个c++类,使它可以方便的压缩和解压缩,更重要的是,我新增加了两个接口,这个类可以压缩/解压缩一段内存缓冲区,而不仅仅是文件. -LZARI algorithm based on the type of data compression. Haruhiko Okumura in 1989 July 4
SimpleQuickHuffmanCode
- 本文描述在网上能够找到的最简单，最快速的哈夫曼编码。本方法不使用任何扩展动态库，比如STL或者组件。只使用简单的C函数，比如：memset，memmove，qsort，malloc，realloc和memcpy。 大家都会发现，理解甚至修改这个编码都很容易-This article describes the Internet to find the simplest, fastest Huffman. This method does not use any extension of
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 algor
MarkAllenWeissAnswer
- MarkAllenWise的数据结构代码，一般为一到九章答案，这里提供全部答案，可供参考-MarkAllenWise data structure code, the nine chapters is a general answer, to provide all the answers here, for reference
shiyanyi
- 数据结构有关复数的实现几次的基地会计法警方开房间 发动机觉得ufnhv-Data structure of the plural base for the realization of a number of accounting method that the police opened the engine room ufnhv
shiyaner
- 实验数据结构关于哈希表的问题，连电话记得那才叫警方ig据id快ifvnidsidf-Experimental data on the hash table structure of the problem, remember that even the phone calls, according to id really fast ig Police ifvnidsidf
1
- 本程序实现了对六个1000以内的正整数的基数排序。排序过程分为三个阶段，第一个阶段是比较个位，第二个是比较十位，第三个阶段是比较百位由三个函数实现。-This program of six positive integer less than 1000 base sort. Sorting process is divided into three phases, the first stage is to compare a bit, the second is more 10, the th
02-23-65
- 通过输入车厢系列的编号n，求出所有可能由此输出的长度为n的车厢系列，用入栈出栈的方法，实现车厢调度，并演示每一种出栈序列的过程。任务：假设停在铁路调度站入口处的车厢系列的编号依次为1，2，3，…n。设计一个程序,求出所有可能由此输出的长度为n 的车厢系列。-Series by entering the number of compartments n, the resulting output to derive all possible n the length of the train li