windows GUI，人工非mfc界面，可以录制视频，要学习摄像头编程和界面编程的都来学习。...

chm文件阅读器.开发工具EVC 支持ARM处理器和 模拟器环境 可直接编译通过 基于PPC的 也可以编译为WINCE下的程序-chm document reader. EVC development tools support ARM processor and the environment simulator can be directly translated through on PPC also be compiled as pulled under the procedures

源程序都是在Windows Server 2003下开发的，程序测试环境为Windows Server 2003。用户只有在Windows Server 2003下正确配置程序所需的运行环境后，软件开发平台如下： 操作系统：Windows Server 2003； 数 据 库：SQL Server 2000、SQL Server 2005、Access 2003； 开发环境：Microsoft Visual Studio 2005； 分 辨 率：最佳效果1024×768；-Source are in the Windows Server 2003 under the developed procedures to test the environment for Windows Server 2003. Users only in Windows Server 2003 under the correct procedures needed to configure the operating environment, the software development platform are as follows: Operating System: Windows Server 2003 Database: SQL Server 2000, SQL Server 2005, Access 2003 development environment: Microsoft Visual Studio 2005 Resolution: best 1024 × 768

我的Pascal封笔之作，因为大学不用Pascal了，就用Pascal把一些常用的数学功能写成程序，作为封笔之作～-Pascal of my creating in effect, because universities do not have Pascal, and Pascal on the use of some commonly used mathematical functions written procedures, as of creating in effect for ~

利用不相交类集制作的自动生成迷宫的程序,迷宫大小可自由改变-labyrinth game

应用背景伟大的软件用PASCAL跟踪鼠标移动关键技术这个程序是模拟鼠标移动，它的真的有很大的方式来做它

在DBGrid中实现任意方向查找-DBGrid in achieving any direction you

很不错的网上书店系统，自己去看看就知道了-Very nice online bookstore system, to see themselves know. . . .

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.

本文件采用Visual C++开发,功能为联众计牌器.-This document is the use of Visual C++ Development, functions of licensing OurGame browser.

个人通讯录 方便用户联系-personal directory user-friendly links