Graph

实现了多项式的创建，实现了多项式的加减乘除等基本操作(The realization of polynomial create, to achieve the polynomial add, subtract, multiply and divide the basic operation)

说明：  操作系统先来先服务调度算法模拟（C描述）(Operating a first-come first-served scheduling simulation (C description))

该程序是数据结构中以链表存储形式来求两个集合的交集，用C++语言描述的(The program is the form of a linked list stored in the data structures to seek the intersection of two sets, C++ language to describe)

使用C语言编写的AOV网的拓扑排序，内附有详细的源码解释和输入示意图(Using C language AOV network topological sorting, enclosing a detailed explanation and input source diagram)

说明：  用链表的方式实现多项式的加减，其中结构体包含幂次和系数。(Polynomial addition and subtraction with a list of ways in which the structure and contains the power of coefficients.)

本文讨论了动态规划这一思想的核心内容和其基本特点，探讨了动态规划思想的适用范围，动态规划子问题空间和递推关系式确立的一般思路。(This paper discusses the dynamic planning this thought core content and its basic characteristics, this paper discusses the dynamic planning idea, the applicable scope of the dynamic programming problem space and son recursive formula of the establishment of general thoughts. )

常在该网站下载资料，也想分享些材料上去，这个资料是FRFT算法(Often the site to download information, but also want to share some material up, this information is FRFT algorithm)

二叉树的建立 中序遍历二叉树 把二叉树转换成双向链表(Binary tree in the establishment of traversing Binary conversion to binary tree into a doubly linked list)

一、 地理数据文件应用 对由点、线、面构成的地理数据文件进行打开、读取、关闭操作。 要求： 1、在C++环境下，通过程序设计实现文本格式数据文件的操作； 2、在打开数据文件后，生成点、线、面三个链表，分别用于记录三种类型的数据。 3、数据文件结构说明 (Geographic data file applications by point, line, surface consisting of geographic data file open, read, and close operations. Requirements: in C++ environment, through the program design text format data file operations 2, open the data file, generate points, lines, surfaces three linked list, respectively, for the record three types of data. 3, a data file structure)

使用三叉链表实现的哈夫曼树,统计inputfile1.txt中各字符的出现频率，并据此构造Huffman树，编制Huffman 码；根据已经得到的编码，对01形式的编码段进行译码。 具体的要求： 1．将给定字符文件编码，生成编码，输出每个字符出现的次数和编码； 2．将给定编码文件译码，生成字符，输出编码及其对应字符。 (Emergence of the frequency of each character in the trigeminal lists using the Huffman tree, statistics inputfile1.txt, and accordingly the Huffman tree structure, preparation of Huffman code according to the coding has been. 01 to form the code segment for decoding. Specific requirements: 1 coding the given character file, generating the encoding, and outputting the number and encoding of each character 2 will be given the encoding file decoding, generating the character, the output code and its corresponding character.)