Expressions

无环连通图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)

多段图、遍历、排序。用C语言解决多段图中的成本问题，得出最佳优化方案。(More paragraphs figure, traverse, ranking. C language solve more paragraphs in the chart the cost, obtains the best optimization scheme. )

说明：  有助于c++的初学者在平日的学习中更好的学习(Contribute to better learning c++ beginners learning on weekdays)

二叉树的C++实现，成员可以自己调整，实现了各种修剪此树的方法：初始化，增加节点，删去节点，复制树，读取节点，遍历树(Binary tree in C++, members can make their own adjustments to achieve a variety of pruning this tree methods: initialize, add nodes, delete nodes, copy the tree, read the node, traverse the tree)

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

Polynomial基于数据结构的思想,文件比较小,可以直接运行(Polynomial based on the idea of ​ ​ data structures, file is relatively small and can be run directly)

给定n种物品和一背包。物品i的重量是wi>0,价值为vi>0,背包的容量为c。选择装入背包的物品，使得装入背包中物品的总价值最大。(Given n kinds of goods and a backpack. Weight of the item i is wi> 0, the value of vi> 0, knapsack capacity c. Select the items into the backpack, so into the backpack of items in the total value of the maximum.)

数据结构学习中提供的不错的源码，一个哈夫曼树类，利用了链队列存储结构。压缩包中有七个文件。(Data structure provided a good learning source, a Huffman tree class, the use of the chain queue storage structure. There are seven compressed file.)

C常用算法程序集，一些C语言的基本算法在里面都可以找到。(this is a very good book about c language,you will find it is very useful in your work.)

校园导航问题，设计你的学校的平面图，至少包括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.)