Shortest path algorithm C C++ Adjacency matrix realize Huffman Huffman tree algo...

This scheme is initiated by Ziv and Lempel [1]. A slightly modified version is described by Storer and Szymanski [2]. An implementation using a binary tree is proposed by Bell [3]. The algorithm is quite simple: Keep a ring buffer, which initially contains "space" characters only. Read several letters from the file to the buffer. Then search the buffer for the longest string that matches the letters just read, and send its length and position in the buffer.

SPIHT多级树集合分裂算法的基础知识，讲解详细，适合于入门者理解算法的基本思想。-SPIHT multi-level tree splitting algorithm is a collection of basic knowledge, to explain in detail, suitable for beginners to understand the basic idea of the algorithm.

c语言编写的操作系统存储管理程序，比较简单，可作为参考。-c language operating system memory management procedures are relatively simple, can be used as reference.

xvid MPEG-4 编解码源代码-xvid MPEG-4 codec source code

文件压缩与解压-File compression and decompression

通过循环实现线条的渐变,实现方法是一个像素一个像素地画线-cycle through the gradual realization of lines to achieve a pixel is a pixel Draw Line

目前为止 我所看到翻书效果模拟得最真实的源码-Far fflippage simulate most real

This file contains a new and improved version of the Huffman coder, (June 29. 2001). The name is Huff06.m. There are also some additional files which are helpful when using Matlab for data compression: quantizer, different variants of run-length-encoding and end-of-block coding in Mat2Vec, and a program which do JPEG-like entropy coding. A complete compression example is shown in TestMat2Vec.m. This file is all you need for Huffman coding in MatLab.-This file contains a new and improved version of on of the Huffman coder, (June 29. 2001). The name is Huff06.m. There are also some additional files which are helpful wh en using Matlab for data compression : quantizer. different variants of run-length-encoding an d end-of-block coding in Mat2Vec. and a program which do JPEG-like entropy coding . A complete compression example is shown in Tes tMat2Vec.m. This file is all you need for Huffma n coding in MatLab.

① 对输入文法，由程序自动构造FIRST FOLLOW集 ② 对输入文法，由程序自动生成它的LL(1)分析表； ③ 对于给定的输入串，应能判断识别该串是否为给定文法的句型。-① the input grammar, automatically constructed by the procedures set FIRST FOLLOW ② the input grammar, it is automatically generated by the process of LL (1) analysis table ③ For a given input strings, should be able to identify the string to determine whether a given grammar sentence.

用VB实现文件压缩和解压缩，对于初学VB的同志具有参考价值-VB document compression and decompression, for beginners VB comrades reference value