一个C++类，可以添加

一个用VB写的可以让任意窗口置顶的工具，可以让你工作娱乐两不误-1 can be written using VB so any windows Top of the tool that lets you work fun Liangbu Wu

Gumstix系统的ce5.0的bsp，cpu是xcale的-Gumstix system ce5.0 the bsp, the cpu is xcale

利用C++Builder5.0编写的一个音频录放音程序-The use of C++ Builder5.0 prepared an audio recording and sound procedures

Description: 采用邻接表表示有向图，完成图的创建、图的深度优先遍历、图的广度优先遍历操作。其中图的顶点信息是字符型，图中顶点序号按字符顺序排列，边的输入按照边的顶点序号从小到大的顺序排列，如下图的边的输入顺序为0 1，0 2，0 3，1 2，1 3，2 4，3 4共七条边，邻接表的边结点采用头插法。本输入样例中所用的图如下所示： Input Format: 第一行输入两个值，第一个是图中顶点的个数，第二个是图中边的条数 第二行输入各顶点的信息，即输入每个顶点字符 第三行开始输入每条边，每条边的形式为两个顶点的序号，中间以空格隔开，输入完一条边换行 Output format: 首先输出图的顶点信息，输出完毕换行 接着输出图的邻接表，格式为首先输出第一个顶点，接着输出该顶点的所有的临界点的序号，换行，然后输出下一个顶点及邻接点，以此类推 接下来一行输出从图的第一个顶点开始进行深度优先遍历的序列，中间以空格隔开，输出完毕换行 最后一行输出从图的第一个顶点开始进行广度优先遍历的序列，中间以空格隔开，输出完毕换行 -Description: Adjacency list using said directed graph to complete the map creation, map of the depth-first traversal, breadth-first graph traversal operations. In which vertex information is character, the graph vertices in order arranged by character number, while the input side of the vertex according to serial number from small to large order, the following graph of the input side of the order of 0 1,0 2,0 3,1 2,1 3,2 4,3 4 a total of seven edge, the edge-node adjacency list using the first interp

Huffman编码以及解码程序，利用它可以对文件进行压缩和解压缩-Huffman coding and decoding process, which allows you to compress and decompress the file

一个如何给应用程序加帮助文件响应的例子--An example about how to add help files response to application

这是个好东东 Fireworks精彩实用插件集-This a good practical Wanton wonderful plug-Fireworks Set

一个Pipe的程序的源代码，写得比较经典，大家可以尝试下载看看，阿东的-Pipe of a program s source code, written in the classical comparison, we can try to download to see the Adong

Oracle自动定时备份程序,把Oracle备份成dmp文件,自动执行.-Oracle automatic backup procedures regularly, put Oracle into a dmp backup file, automatically.

一套很不错的药店管理软件,值得一看-a very good pharmacy management software, an eye-catcher