mifeng

常在该网站下载资料，也想分享些材料上去，这个资料是FRFT算法(Often the site to download information, but also want to share some material up, this information is FRFT algorithm)

校园导航系统包含佛山科技学院本部校区的校园景点平面图。通过系统的各功能不仅可以查询任意景点的编号，名称，简介等信息，还可以查询任意两景点间的最短路径及长度和所有路径及长度。另外，还可以通过一系列操作增加，更改或删除任意的景点的各信息。(Contains the campus attractions plan of the campus Foshan Institute of Technology campus navigation system. Through the function of the system not only can query any spots number, name, profile and other information, can also query the shortest path and arbitrary length between two spots and all paths and the length of. In addition, can also increase through a series of operations, the information change or delete any of the attractions.)

数据结构课程设计，在VC环境下完成，利用哈夫曼树原理，主要功能是实现字符的压缩和解压缩，设计脉络清晰，易懂(Data structure course design, completed in the VC environment, using Huffman tree principle, the main function is to achieve the character of the compression and decompression, design, clear structure, easy to understand)

说明：  图的相关操作：建立图，图的遍历，查找元素，删除元素等(Map-related steps: the establishment of map, graph traversal, find elements, delete elements, etc.)

具有数据插入、修改、删除、显示、和查询功能的电话簿管理程序。 数据包括：人名、工作单位、电话号码、和E-mail地址。 可对记录中的姓名和电话号码进行修改。 可增加或删除记录。 可显示所有保存的记录。 可按人名或电话号码进行查询。 附加功能： 可修改单个记录的各项内容。 可重新建立电话簿。 可按人名或号码进行排序。 可统计名片数目及可再添加数目。 可插入单个名片并不破坏原有顺序(With the data to insert, modify, delete, display, and query functions of the phone book management program. The data include: the names, work units, phone number, and E-mail address. Can be modified to record the name and phone number. Increase or delete records. You can display all the records kept. According to the names or telephone number for queries. Additional features: you can modify the content of a single record. Can re-establish a Phonebook. According to the names or numbers to be sorted. Statistical card number and add the number. Insert a single card does not destroy the original order)

主要是DIJKSTRA经典算法，可以作为单个算法来读，也可以调用。(DIJKSTRA mainly classical algorithm can be read as a single algorithm can also be called.)

二叉树的操作，涉及到三种顺序的遍历，树的凹入表示法，转化为一维数组储存，节点的计数，以及中序线索化。(Binary operation, involving three kinds of the order of traversal, tree concave representation into a one-dimensional array of storage, the node count, as well as in the threaded sequence.)

对元素类型为整型的顺序存储的线性表进行插入、删除和查找操作(C++)。(C integer linear sequence of stored data table insert, delete and search operations)

道格拉斯—普克法(Douglas—Peucker)的C++程序(Douglas- Puck method (Douglas-Peucker) of the C++ program)

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