KMP

根据最常用的链表法进行huffman编码，可以手工预制权重，例如n=8的时候即可以在文件中写入，输出相应的编码结果(According to the most commonly used method of Chain Huffman coding, manual can be prefabricated weight, For example, n = 8 when it is written in the document, the output corresponding to the coding results)

这是birch C语言的源代码。里面有详细的代码注释方便学习birch算法(birch c)

c语言编写链式线性表的初始化，创建，插入删除等操作。(c language chained linear table is initialized, create, insert and delete operations.)

用邻接表表示的数据结构，及DIJKSTRA算法实现的最短路径程序(adjoining table with the data structure and algorithm DIJKSTRA the shortest path procedures)

数据结构中插入排序，堆栈排序等的用法还有希尔排序(Data structure insertion sort, stack, sort, etc. use well sorted Hill)

图的邻接表生成，深度遍历及任意两点间的路径(The adjacency table to generate deep traversal path between any two points)

这是数据结构很重要的程序，主要是课后题的答案，和代码，功能很强大(the data struct of the book)

说明：  子集和数问题.rar，用C++写的，可以运行(Subset of several problems. Rar, written in C++, you can run)

VC简易通讯录，加强C的编程，熟悉链表文件的使用等。(Simple VC contacts, strengthen C programming, familiar with the use of a linked list file.)

c-w算法，讲述一种分配运输的节约方法，适合于车辆的调度(c-w algorithm，About one distribution transport saving method, suitable for vehicle scheduling)