地方储备，利用结构和矩阵。简单。

Primitives, simple draw using Glut (opengl) on c-Primitives, simple draw using Glut (opengl) on c++

一种新的穿透防火墙的数据传输技术,过程如下: 1. 找出目标进程 2. 找出SOCKET句柄 2. 用DuplicateHandle()函数将其SOCKET转换为能被自己使用. 3. 用转换后的SOCKET进行数据传输-a new firewall penetration data transmission technology, the process is as follows : 1. The process of identifying two goals. Identify SOCKET handle two. With DuplicateHandle () function to be converted to SOCKET their own use. 3. After the conversion used for data transmission SOCKET

控制台颜色设置封装在一个命名空间，直接实用命名空间就能改变控制台输出字体属性-Console color settings encapsulated in a namespace

先输入图的各顶点名，再输入图的邻接矩阵从而建立图，并用笛施卡尔，普里姆等三种方法求其最小生成树，-input vertices of the plan, and plans to import the adjacency matrix thereby establishing map, and use flute Shi Carl prim other three methods for the minimum spanning tree,

包含大量C源代码均验证通过，相当经典且可移植性强-Contains a large amount of C source code for both the authentication is passed, a very strong classical and portability

串口编程，通过串口可以监视串口文件，可以ASCII与十六进行进行观测数据，传入二进行制数据并且可以保存成object.bin文件-serial programming, serial port can monitor serial documents, ASCII and can be conducted for 16 observational data into two data for the system and can save documents into object.bin

一个处理数论的函数库，但是安装时有点麻烦，看看里面的介绍吧 -A deal with number theory library, but a bit of trouble during installation, look at the inside bar introduction

该程序有x5045，12864液晶显示，步进电机等各个模块组成的一个程序有详细的功能说明-The program has x5045, 12864 LCD, stepper motor, composed of various modules, such as a program has a detailed description of the function

是一款用vc++编写的计算levshtein距离的程序.也就是可以做time alignment,计算两个文档之间最小的距离(插入,删除,替换的最小次数)-is a preparation using vc levshtein distance calculation procedures. It is time to do alignment, the two documents between the calculated minimum distance (insertion, deletion, replacement of the smallest number)

这是一个文档序列化程序，是用Vc++ 6.0开发的。-This is a sequence of procedures document is the use of vitamin C 6.0.