mscohere(x-y-w-noverlap-nfft-fs)

我做的DBMS系统模拟DBMS，里面有鼠标还没有做完-DBMS system simulation DBMS, and they have not done mouse

这也是个数据库的编程，是演示如何连接远程的数据库的。-This is a database programming, shows how to connect to the remote database.

此代码是一个数据结构课程设计――飞机订票系统.-this code is a data structure course design-- aircraft booking system.

成绩管理系统，用VC实现对ACCESS数据库的操作，实现基本的成绩管理功能！-performance management system, with VC right ACCESS database operation, to achieve the basic performance management functionality!

最短路径算法。 用无向带全图的邻接矩阵存储图，确定从源点出发到其它各点的最短路径。 输入：图中包含的顶点数n 边数m， 各边权值，用邻接矩阵或者邻接表存储。 输出：源点到其它各点的最短路径值。(Shortest path algorithm. Adjacency matrix storage with undirected graph with a full figure, determine the starting point of the shortest path from the source point of each other. Input: Vertices figure included n the number of edges m, the weight of each side, with the adjacency matrix or adjacency table storage. Output: source shortest path to value each other points.)

数据结构实验之哈夫曼算法，欢迎下载指正。带有可执行程序(Experimental data structure of the Huffman algorithm.Welcome to download correction. With an executable program)

实现岛上建立公路的最短路径算法，调用了dikstra算法-Highway on the island to achieve the establishment of the shortest path algorithm, called algorithm dikstra

集束搜索,经典算法，不用过多介绍了吧/。-cluster search, classical algorithm, not too many on the Bar /.

哈弗曼编码，构造哈夫曼树，构造哈夫曼树非常简单，将所有的节点放到一个队列中，用一个节点替换两个频率最低的节点，新节点的频率就是这两个节点的频率之和。这样，新节点就是两个被替换节点的父节点了。如此循环，直到队列中只剩一个节点（树根）。(Hoffman coding, Huffman tree structure, Huffman tree structure is very simple, all the nodes in a queue, replace the two lowest frequency node with a node, the new node and the frequency of frequency is the two nodes. So, the new node is two replaced node parent node. So the cycle, until the queue is only one node (Shu Gen). )

这些是学校管理系统所需的数据库规范。。。。。。。。。。。。。。。。。。。。。。。。数据库mysql