一个微型的数据库系统

包含图的遍历和线性链表两个内容，压缩文件里含有设计报告-Contains the graph traversal and linear chain of two elements, compressed file contains the design report

本程序采用数据结构中的一些算法，简单的实现了多项式的乘法，在使用中请大家仔细阅读源代码中的说明！- This procedure uses in the construction of data some algorithms, the simple realization multinomial multiplication, has asked everybody in the use carefully to read in the source code showing!

难得的好程序，是有关数据库的-rare good procedure, the database

主要是严蔚敏版《数据结构（C语言版）》第二章线性表中算法的C语言实现，能够帮助初学者更好的理解这部分内容~~~

此函数功能是图的遍历算法，用邻接矩阵存储图，然后求出其拓扑排序，再输出其图的信息-Function is to map the function of the traversal algorithm, the adjacency matrix storage map, then calculated the topological sort, then the output of its map information

数据结构中著名的汉诺塔问题的实现，基于C++实现-Data structure of the famous Tower of Hanoi problem to achieve, based on C++ implementation

学籍管理信息系统-expulsion Management Information System

二叉树的建立与遍历 可实现： （1）树的创建采用先序方式，用特殊符号0表示左、右子树为空 （2）每次输入一个节点的值，可以根据自己的需要设计不同的节点结构 （3）节点的值为非零数 （4）可以（）形式输出创建的树 （5）用先序后序和中序遍历树 （6）销毁树 -Establishment and tree traversal can be achieved: (1) tree created using the first order approach, with special symbols 0 express the left and right subtree is empty (2) for each input the value of a node, you can according to their own needs Design of different node structure (3) non-zero value of the node number (4) can () to create the form of the output tree (5) after the first sequence and the sequence of traversal tree (6) the destruction of trees

SR-tree is an index structure for high-dimensional nearest neighbor queries，C++ sourcecode. SR-tree outperforms the R*-tree and the SS-tree especially for high-dimensional and non-uniform data which are likely to appear in the actual image / video applications.-SR-tree is an index structure for high-dimensional nearest neighbor queries,C++ sourcecode. SR-tree outperforms the R*-tree and the SS-tree especially for high-dimensional and non-uniform data which are likely to appear in the actual image/video applications.

《数据结构与算法入门导学》 第一章 概论 第二章 线性表 第三章 栈和队列 第四章 串 第五章 多维数组和广义 表 第六章 树 第七章 图 第八章 排序 第九章 查找 第十章 文件-" Introduction to Data Structures and Algorithm Study I." Introduction to Chapter II Chapter III Chapter linear stack and queue Chapter IV Chapter V multi-dimensional array of strings and generalized tree table Chapter VI Chapter VII Chapter VIII of the sort ninth plan Chapter X Chapter document search