超市进销存管理系统源码，采用的是Visual Basic 语言和ACCESS数据库的综合...

著名的文件合并算法，欢迎大家使用下载，好东西呀。-Documentation of well-known algorithm, welcome everyone to use the download, you good things.

大学学籍管理系统-University Academic Information Management System

这是计算机专业硕士生课程《算法设计与实现》中讲到的模式匹配算法的实现，并且将该算法与KMP算法进行了比较。-It was the professional degree programs, "Algorithm Design and Implementation" referred to the pattern matching algorithm implementation, and algorithm and KMP algorithm are compared.

该源代码为数据库设计的报刊订阅，和报告，挺详细的，适合初学者-The source code for the database design of newspapers and periodicals subscriptions, and reports quite detailed, suitable for beginners

数据结构 详细描述了如何创建图的方法以及操作-Data structure described in detail how to create a map of methods and operations

数据结构最小生成树-minimum spanning tree data structure

在数据结构中编程实现表达式求值算法（加减乘除）-Structure in the data evaluated the expression programming algorithm (calculation)

数据结构演示系统-data structure Demonstration System

哈夫曼树算法 根据给定的n个权值{w1,w2,……wn}，构造n棵只有根结点的二叉树，令起权值为wj 在森林中选取两棵根结点权值最小的树作左右子树，构造一棵新的二叉树，置新二叉树根结点权值为其左右子树根结点权值之和 在森林中删除这两棵树，同时将新得到的二叉树加入森林中 重复上述两步，直到只含一棵树为止，这棵树即哈夫曼树 -Huffman tree algorithm based on a given n-weights (w1, w2, ... ... wn), construct n trees only a root node of the tree, so that from the right value of wj in the forest root node to select two the right tree for the value of the smallest subtree around, a new binary tree structure, the right to buy a new tree root node value of its subtree root node around the right value in the forest and delete these two trees, At the same time, the new binary tree obtained by adding the forest to repeat the above two steps until a tree containing only the date, that is, Huffman tree tree

实现构造哈夫曼树的哈夫曼算法。 求解出所构造的哈夫曼 使用树的带权路径长度。 -Huffman tree structure to achieve the Huffman algorithm. Solving the structure of the Huffman tree with the right to use the path length.