5100309373_2_9

对于数据结构每一章节的相应的练习题，巩固好数据结构(To consolidate data structure corresponding practice questions for each chapter of the data structure)

数据结构试验-打印输出计算机本科专业4年每学期的课表；C++实现；图的邻接表存储结构以及拓扑排序的基本思想(Data structure test- printout computer 4 years of undergraduate per semester timetables C++ achieve basic idea of ​ ​ the adjacency table storage structure and topological sorting)

单循环链表，用C++实现 提供入队，出队，判断空等方法(Single cycle linked list, with C++ into the team, the team judge waited in vain for methods)

一个KDtree的程序，包含建树过程和消耗的时间。(A KDtree procedures, including the contribution to the process and time consuming.)

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

输入俩条线段的首尾坐标，用于判断俩条线段是否相交的(Used to determine whether the intersection of two line segments)

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

本代码提供一种非常简单且快速的哈夫曼编码方法。 (this code provide a very simple and rapid method of Huffman coding.)

1>实现可以随意浏览任一景点的介绍。（功能一） 2>可以给出任意两个景点的最短距离及其路线。（功能二） 3>可以查看任一景点热度，并可以对对所有景点热度（访问次数）进行排序。（功能三） 4>每个景点相关内容从文件读取，实现对文件操作的练习。 (1> implementations can feel free to browse introduce 任一景 points. (Function a) 2> You can give the shortest distance and route between any two attractions. (Function b) 3> You can view Renyi Jing point heat, and heat can all attractions (visits) to be sorted. (Function c) 4> each spot related content file reading, to achieve the file operations exercises.)

数据结构，利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)