kursovaya1.5v2

说明：  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.)

基于DSP2812的单相全桥逆变结构的SPWM程序。。(DSP2812-based single-phase full-bridge inverter SPWM program structure. .)

从实验箱中读取在数据收集到数据库sqlite3(get data rifd uhf)

内核中暂停任意线程代码，qq Protect相关(Kernel suspend any thread)

painting algorithmpainting algorithmpainting algorithmpainting algorithmpainting algorithm(painting algorithmpainting algorithmpainting algorithmpainting algorithm)

用visual c++实现的高斯投影的变换程序(With visual c++ to achieve the transformation of the Gaussian projection procedures)

VC非常好的表格控件。初学Beginners must see者必看，很经典的。(VC a very good form control...Beginners must seeBeginners must see)

初学者入门适合看的代码,很简单，就是一个界面编辑(beginning learning vc code)

IP包监听程序 (IP packet sniffer)

说明：  一个rpg游戏源码，用vc++制作(A source rpg game with vc++ Production)