Dijkstra

B-树的创建、插入、删除等一系列操作！(B-tree creation, insert, delete a series of manipulations!)

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

数据结构课程设计 -电话本（运用了MFC图形化界面）(Curriculum design- the phone book)

数据结构中图的遍历Data structure traversal of center(Data structure traversal of center)

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

棋盘覆盖，算法分析，很有用的东西，大家一起来分享一下(Board covers, algorithm analysis, useful things, we share together)

校园导航问题，设计你的学校的平面图，至少包括10个以上的景点（场所），每两个景点间可以有不同的路，且路长也可能不同，找出从任意景点到达另一景点的最佳路径（最短路径）。 要求： （1）以图中顶点表示校园内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等有关信息。 （2）为来访客人提供图中任意景点相关信息的查询。 （3）为来访客人提供任意景点的问路查询，即查询任意两个景点之间的一条最短路径。 （4）修改景点信息。 (Campus navigation problem, the design of your school s plan, at least more than 10 attractions (places), between every two spots can have a different way, and the long road may be different, to find spots to reach from any other attractions best path (shortest path). Requirements: (1) graph vertices represent various campus sites, storage sites name, code, profile and other information the side that path, the path length of storage of information. (2) the figure for visiting any sites offering information about the query. (3) any attractions for visiting guests ask queries of that query any two of the shortest path between sites. (4) modify the attractions information.)

清华大学出版社，数据结构简明教程李春葆著，第四章源文件(Tsinghua University press, a brief course on data structure, Li Chunbao, fourth chapters)

哈夫曼树，基本的数据结构，用来编码和解码、用数组作为存储结构实现，

效验算法单循环链表，这些都是实用经典的算法和数据结构(Well-tested algorithm round robin list, these are practical classic algorithms and data structures)