哈夫曼编码,实现了哈夫曼编码中的编码,译码,以及打印的功能....

数据结构常用算法：图的最小生成树 经典算法：图的最小生成树-algorithm commonly used data structures : Figure the minimum spanning tree algorithm classic : Figure the minimum spanning tree

数据结构里面实现图：拓扑排序、最小生成树、关键路径、深搜、广搜、优先路径

此程序是利用图形函数画Lagranges函数，分段插值函数，Hermite函数的函数图形-This program is the use of graphics functions draw Lagranges function, sub-interpolation function, Hermite function is a function of graphical

皇后算法111 很经典的 内含两种 希望大家喜欢-111 Queen"s algorithm includes the classic two hope you like

本系统采用Visual Foxprow 5.0编写,面向对象可视化编程,使系统的开发工作适应目前的流行趋势。设计时采用了常用的自顶向下的瀑布式结构化设计方法。各子系统具有独立的数据库结构，设计时力求简单易用，便于维护。各模块为平行关系，彼此间无直接的参数联系，也无库的交叉关联，从而保证各子系统可以单独运行。-the system using Visual Foxprow 5.0 preparation, visual, object-oriented programming, allowing the system to adapt to the current development trend in fashion. Used in the design of the popular top-down waterfall structure design method. The subsystem is independent of the database structure, design sought to be simple to use, easy to maintain. Each module for parallel relationship between the parameters are not directly linked, nor for the cross-linked, so that the subsystems can be run separately.

算法类，合并排序的源代码，来自算法导论上的-Algorithm category, the combined ranking of the source code, from the Introduction to Algorithms

在这些高校管理体系中包含各种搜索老师记录，学生记录，这样，轻松地访问任何信息等。

可实现科研信息管理系统的功能,有项目管理,教师管理,科研项目管理等多项内容-Research and information management can realize the function of the system, have project management, teacher management, research management, and so a number of content

离散事件模拟程序，以及自定义数据类型的队列实现-Discrete event simulation program, as well as custom data types of queues to achieve

哈夫曼树算法 根据给定的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