xianduan

数据结构课程设计－－实现并对比三种基本的字符串匹配算法(EasyMatch Rabin—Karp KMP)

无环连通图G=(V, E)亦称为自由树T，其直径是树中所有顶点之间最短路径的最大值，设计一个算法求T的直径(Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T)

高德纳发明的高效数据结构dancing link，这里是解重复覆盖问题的一个演示(Donald Knuth invented efficient data structure dancing link, here is the solution to repeat coverage of a demonstration)

C语言树的简单实现,介绍了树你前序遍历，树插入与删除节点的实现(C-tree is simple to achieve, before you introduced the tree traversal, tree insert and delete nodes to achieve)

多项式加减乘 用数据节够得算法实现多项式的加减乘 原理简单易懂(suoxiangshi jiajiancheng)

数据结构中的用kmp算法查找关键字，供初学者参考(Data structure using kmp algorithm to find the keyword reference for beginners)

本资料为数据结构的相关试卷，可以帮助大家解决一下有关考试的问题(This information is relevant papers data structure that can help you solve the problems concerning the examination)

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

日历显示，查询1900年后的日历。每一屏显示一年的日历祥情。(Calender dispaling. Acess the calender detail of years after 1900.)

一本介绍各种算法的经典书籍，计算机算法设计与分析(A classic book introduces a variety of algorithms, algorithm design and analysis of computer)