ANSI C++ Reference manual

经典的C语言编程--如何计算C语言的关键字(作者是C语言开发者Kernighan和Ritchie)-classic C programming language-- how the C language keyword (The writer is a C-language development were Kernighan and Ritchie)

一个关于UML设计的程序，这个UML对象对软件工程非常有用。-This is a programming about the UML (Unify Modicated Language), which is useful for software engineering.

一个用VB编写的3D界面的计算器，功能比较多，比Windows自带的计算器强大。-a VB prepared by the 3D interface calculators, more functional, than Windows built-in calculators powerful.

单片机通过adc0809的模数转换程序，他可以有八个通路的模拟量输入端。-Single-chip microcomputer through the analog-to-digital conversion adc0809 procedures, he can have eight channels of analog input.

plc通讯代码及打包安装程序，使用c#开发-plc communication code and packing installation procedures, the use of c# development

推箱子，又称搬运工，是一个十分流行的单人智力游戏。玩家的任务是在一个仓库中操纵一个搬运工人，将N个相同的箱子推到N个相同的目的地。推箱子游戏出现在计算机中最早起源于1994年台湾省李果兆开发的仓库世家，又名仓库番，箱子只可以推, 不可以拉, 而且一次只能推动一个。它的规则如此简单，但是魅力却是无穷的。但是人毕竟思考的深度和速度有限，我们是否可以利用计算机帮助我们求解呢？-magazines, also known as porters, is one of the most popular single intellectual games. The task of players in a warehouse controlled a stevedore who will be the same as the N box pushed to the same N as a destination. PSP games on the computer which originated in 1994, the Taiwan Provincial Fruit Katherine Lee development of the warehouse family, also known as Fan warehouse, the boxes can only push, not pull, but one can only promote one. Its rules so simple, but the charm is boundless. But, after all, thought the depth and speed are limited, we can use computers to help us solve?

1） 在线

九宫格拼图，核心类可处理N*N任意大小规格的游戏。不能自动求解。-TICTACTOEMIDLET

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.

基于颜色特征的图像检索系统，项目全部打包的，里面的exe文件是可以执行的文件，opencv的c++图像检索系统。环境配置成功就可以使用，基于颜色特征的图像检索系统