Polynomial

关于中国邮递员的解决办法，个人觉得还不错的说(Chinese postman)

算法设计的动态规划，贪心算法 操作系统的银行家算法等五个小程序(data)

说明：  数据结构：Huffman编码。哈夫曼编码是哈夫曼树的一个应用。哈夫曼编码应用广泛，如JPEG中就应用了哈夫曼编码。 哈夫曼树又称最优二叉树，是一种带权路径长度最短的二叉树。(Data structure: Huffman coding. Huffman coding is an application of the Huffman tree. Huffman coding is widely used, such as JPEG in the application of the Huffman coding. Huffman tree, also known as the best binary tree is a weighted shortest path length binary tree.)

用c语言写的线性链表的创建、删除、插入、销毁代码(With c language to create a linear linked list, delete, insert, destroy code)

普利姆算法用来求解最小生成树问题很容易，使得树的最小权值最小。(Prim algorithm used to solve the minimum spanning tree problem is easy, the minimum weight is the lowest of the tree)

数据结构c语言版，图的遍历，周游世界，无向图的遍历，包含14个国家。(Data structure c language version, graph traversal, travel around the world, undirected graph traversal, including 14 countries.)

数据结构课程设计时，所需的封面及任务书版面，希望对大家有点用！(Curriculum design data structure, the necessary task of the book cover and layout, in the hope that we are a bit used!)

经典算法巴斯卡三角的简单实现，vs2010编译通过(Simple implementation of the classic algorithm Pascal triangle, vs2010 compiled by)

使用非递归的方法遍历二叉树，可以直接运行。( Non-recursive binary tree traversal.)

使用很好的数据结构，程序运行效率高，界面简洁美观。(Good data structure, high efficiency, simple and beautiful interface.)