资源列表
SJ20
- 求树的中序遍历,运用的方法是用非递归的算法来做的.-for tree traversal sequence were used method is the use of non - recursive algorithm very consistent.
Subclass
- 非常方便实用的加解密软件,运行于WinNT、Win2000、WinMe、windows ,Xp可以对任意文件加密,只需选中要操作的文件单击右键,在菜单中选择加解密即可-very convenient and practical encryption software, running on the WinNT, Win2000, Windows Millennium Edition, windows, Xp can be arbitrary document encryption, can be
bianyizlh
- 自动生成一个LL(1)文法。对输入文法,由程序自动生成它的LL(1)分析表;对于给定的输入串,应能判断识别该串是否为给定文法的句型-LL (1) grammar. On the importation of grammar, automatically generated from the LL (1) Analysis Table; For a given input string, Recognition should be able to judge whether the series
vb-setup
- 用vb制作安装程序的源码,开发环境vb6.0,非常好的源码哦-production with the installation procedures vb source code, development environment vb6.0, very good source Oh! !
lxp
- 数字图像压缩算法,基于MATLAB的数字图像压缩算法,DCT格式 -digital image compression algorithm based on MATLAB digital image compression algorithm, DCT format
graphicalcscode
- 画图程序-drawing program Ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha Ha h a h a h a h a h a h a h a h a ha
111
- 很好地,希望大家都来看看,关于RS-485方面的知识和串口方面的。以及一些实用软件-good, we all hope to see, on the RS-485 and the knowledge of the serial port. And some utility software
2
- 很好地,希望大家都来看看,关于RS-485方面的知识和串口方面的。
jt_jpeg
- 用java写的jt-jpeg。jt表示java time package,主要用于PDA设备。压缩包包括三个文件夹,demo是例子,jpeg是编码解码器,jcp用于PDA设备。-with java write jt - jpeg. Jt said java time package, mainly for PDA devices. Compressed including three folders, yes demo examples, jpeg is codec, jcp for PDA d
JPEGDecoder
- Free Software Foundation Inc.公司用java写的jpeg解码器。一个优秀的图像解码器面向对象模型。-Free Software Foundation Inc.. Companies using java write j peg decoder. An excellent image decoder object-oriented model.
haffman
- 以前看到的,觉得不错就流下来的,大家要用的可以看看。-seen in the past, feel pretty good down on the flow, we can look at the use.
haffman
- 在Jpeg中Huffman采用的是范式Huffman编码。经过查相关资料有两种不同说法,请高手指点。谢谢! 1、构造范式 Huffman 编码的方法大致是: 分别统计从最大编码长度 maxlength 到 1 的每个长度对应了多少个符号。根据这一信息从 maxlength 个 0 开始以递增顺序为每个符号分配编码。例如,编码长度为 5 的符号有 4 个,长度为 3 的有 1 个,长度为 2 的有 3 个,则分配的编码依次为: 00000 00001 00010 00011