网页菜单工厂(WebMenuShop) V2[1].50.zip

MinGW offline Installation use to compile QT programs for Windows

一个BMP图象处理的例子，涉及图象处理的各种技术，非常难得的完整的算法示例-a BMP image processing examples, involving the various image processing technology, a very rare example of integrity algorithm

这虽不是一个专门为程序员定做的工具，不过对于象我这样比较厌倦开始菜单的人来说，Quick Tray 还是蛮有用的。通过它可以方便地打开您常用的程序、文档资料、以及网站链接等。Windows光盘上也有一个微软的Quick Tray，可千万别搞错了，虽然名字一样，但在功能上却有天壤之别哟！ Quick Tray 的最大好处，莫过于它的易用性。当然，它还有许多特点： 极其简单的打开/隐藏方式：鼠标移向屏幕右下角，Quick Tray 主窗口马上打开；鼠标移向屏幕右边界，主窗口立即消失。 允许对程序项进行分门别类，用户可建立任意树形目录结构，并提供两种目录显示方式。 可以对Quick Tray中的任何程序文档等项目定义系统级热键，无论Quick Tray是否在前台，均可捕获热键。如果平时你习惯用热键，一定不要忘了这项功能哦。 有自启动功能，每次进入Windows后，Quick Tray 以小图标方式显示在任务条上的通知区中。 支持OLE拖放功能，您可将任意文件或IE/Netscape中的超链接拖入Quick Tray中。 方便的多用户管理功能。每位用户均有自己的设置。 提供多种小巧实用的工具，如锁定屏幕、墙纸管理等，并允许以插件方式加以扩充。若有兴趣请参见Quick Tray帮助。-Although this was not a specialized programmers for custom tool, but for me, this like the start menu tired of the people, or Quick Tray is quite useless. Through it can easily open your frequently used programs, files, as well as links to other websites. Windows CD is a Microsoft Quick Tray, 10 million other wrong, although the same name, but the function was very different yo! Quick Tray the greatest benefit is the ease of use. Of course, there are

在线更新的源代码，实现程序的在线升级的功能-online update source code, the online process to achieve the functional upgrades

图形信息校验码识别程序: 运行环境：Windows: 源码语言：简体中文: 源码类型：编程源码- VB源码- 图象: 授权方式：免费源码: 源码 -Graphic Information Check the identification procedures: Runtime Environment: Windows: Source Language: Simplified Chinese: Source Type: source code programming- VB source- image: License: Free Source: source

Visual Basic 编写，让你的文字显示渐变色-Visual Basic preparation, to make your text display gradient colors

万年历中星期的算法 包括闰年，从0000-9999年 原代码，未编译-hefty almanac weeks algorithm which include a leap year, from 0000-9999, the original code did not compile

K r u s k a l算法每次选择n- 1条边，所使用的贪婪准则是：从剩下的 边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选 取的边若产生环路则不可能形成一棵生成树。K r u s k a l算法分e 步，其中e 是网络中 边的数目。按耗费递增的顺序来考虑这e 条边，每次考虑一条边。当考虑某条边时，若将其 加入到已选边的集合中会出现环路，则将其抛弃，否则，将它选入。-K ruskal algorithm for each choice of n-1 edges, the greed of the criteria used are: from the left edge select does not produce a loop with the smallest cost edge has been selected to join the edge of the collection. Taking note of the selected edges have a loop if it can not form a spanning tree. K ruskal algorithm sub-e-step, in which e is the number of network edge. According to the order of incremental cost to consider this e edges, each taking a side. When considering a certain edge when, if its added to a collection of selected edge loop will appear, will be its discarded, otherwise, it selected.

数据库方面的，dao访问acce-databases, access dao visit

哈哈～不用我说了吧～都知道拉～ 我这有个网友吵着让我快点上传，这回你可以下载了～-ha ~ I do not have to say it ~ ~ pull all know that I have a netizen fussing Let me quickly upload, this time you can download a ~