pb实现的气泡窗口，非常实用

一个实用的厂矿管理系统。-a practical mining management system.

将文件中的字符作为结点，每个字符在文件中出现的频率作为结点的权值，采用Huffman算法构造Huffman树，将字符用尽可能短的二进制数位表示（频率越低，二进制数位越长），而不是用8位的ASCII码进行存储，已达到节省存储空间，压缩文件的目的。

中国文章系统数据库设计, 数据库设计.-China article system database design, database design.

像小卡片一样的日历,包括星期-like small cards the same calendar, including the week

一个简单的数据库管理工具，可以管理Oracle等- A simple data bank administration tool, may manage Oracle and so on

rs纠错算法，详细介绍了RS编码和解码的过程，以其对大家有所帮助-rs error correction algorithm, described in detail RS encoding and decoding process, and its help for all of us

数据结构与算法――C++版 好书要不要，不用付钱的哦-data structures and algorithms-- C version of the books should not and do not have to pay oh

首先确认您的机器上已经安装了VC6.0以上版本，要编译生成可执行文件，需打开后缀名为dsw的文件，系统会默认用VC打开，然后选择Build菜单下的Set Active Configuration选项，选择Project Configuration为Win32 Release，然后编译项目，得到可执行文件。连接数据库请参照第2章的方法，在ODBC数据源内添加Microsoft Access数据库-First of all, make sure that your machine has been installed above VC6.0 to compile the executable file to generate the need to open the dsw file name suffix, the system will default to open with VC, and then select the Build menu, Set Active Configuration under the option, Project Configuration options for the Win32 Release, and then compile the project, the executable file. Connect to database please refer to the methods of Chapter 2, in the ODBC data source in Microsoft Access database to add

它具有一些可以帮助你把病人信息和医生 information，也处理信息的实体您必须使用 xamp、 php、 浏览器...

一． 问题描述很多涉及图上操作的算法都是以图的遍历为基础的。试写一个程序，演示在连通的无向图上访问全部节点的操作。二． 基本要求以邻接多重链表为存储结构。实现连通无向图的深度和广度优先遍历。以用户指定的节点为起点，分别输出每种遍历下的节点访问序列和相应生成树的边集。-one. Description many issues involving maps of algorithms are to traverse the map-based. A written test procedures, demonstrating the connectivity of undirected graph visit all the nodes on the operation. 2. Adjacent to the basic requirements for storage of multiple linked list structure. Connectivity to the map without the depth and breadth- first traversal. User specified nodes as a starting point, the output of each node traversal visit Spanning Tree sequence and the corresponding set of edges.