brew-app-Snake

VC++卫星精密定轨(HPOP)程序，采用高阶精确力学模型。（VC2003）(VC++ satellite orbit determination procedures, the use of high precision mechanical model.)

COM+编程技术内幕 学习COM+的好资料,不错的源码(COM+ programming technology insider good information to learn COM+, good source)

QT开发的能够接收串口数据并将其转化为波形同步实时显示的上位机(QT development can receive serial data and converting it into waveform synchronous real-time display of the upper machine)

数据库课程设计简单的邮件管理系统。可以用VS2013连接oracle数据库，实现一些简单的操作(Database design courses simple mail management system. VS2013 can be used to connect oracle , to achieve some simple operations)

绝对可编译过，可用的，带VC工程的G729编解码(definitely be compiled and available, with the VC G729 codecs)

针对原来的winio不能访问高端内存的问题，进行了修改，可以2G以上的内存(For the original winio not have access to high-end memory problems been modified, you can more than 2G of memory)

说明：  实时视频传输有很大的实用价值，对采集到的原始视频信息进行压缩编码，获取己编码视频流是实现实时视频传输和QoS研究的关键。(Real-time video transmission are of great practical value of collected information for the original video coding, video streaming access to their own code is to achieve real-time video transmission and the key QoS.)

生成delaunay三角网的源代码,以及演示demo(Delaunay triangulation generation of source code, and the demonstration of demo)

台湾研华ADAM4017通讯驱动，vc代码，生成DLL，便于大家学习使用(Taiwan Advantech ADAM4017 communication driver, VC code, the generation of DLL, for everyone to learn to use)

说明：  Euler 回路问题 .问题描述： 对于给定的图G 和G 中的2 个顶点v 和w，连接顶点v 和w 且经过图中每条边恰好1 次 的路径称为顶点v 和w 之间的1 条Euler 路。当v=w 时得到一条首尾相接的Euler 回路。 .编程任务： 对于给定的图G，编程计算图G 的一条Euler 回路。 .数据输入： 由文件input.txt 给出输入数据。第1 行有2 个正整数n 和m，表示给定的图G 有n 个 顶点和m 条边，顶点编号为1，2，…，n。接下来的m 行中，每行有2 个正整数u,v ，表示 图G 的一条边(u,v) 。 .结果输出: 将编程计算出的Euler 回路输出到文件output.txt 。如果不存在Euler 回路，则输出-1。(Euler circuit problem. Problem description : for a given graph G and G of two vertices v, w, connectivity and vertex v w map through which each side precisely the path to a meeting called vertices v, w between a Euler Road. When v = w be an end-to-end circuit Euler. . Programming tasks : for a given graph G, programming terms of a graph G Euler circuit. . Data input : from the document input.txt given input data. Line 1 has two positive integers n and m, to the graph G with n vertices and m edges and vertices numbered 1, 2, ..., n. Next m OK, every trip has two positive integer u, v, said of a graph G edge (u, v). . Results output : Programming will be calculated by Euler circuit output to a file output.txt. If there is no Euler circuit, the output 1.)