VC下COM实例

说明：  但是对于“真二叉树”（每个内部节点都有两个孩子的二叉树），给定它的先序、后序遍历序列足以完全确定它的结构。将二叉树的n个节点用[1, n]内的整数进行编号，输入一棵真二叉树的先序、后序遍历序列，请输出它的中序遍历序列。(But for one proper binary tree, in which each internal node has two sons, we can uniquely determine it through its given preorder traversal sequence and postorder traversal sequence.Label n nodes in one binary tree using the integers in [1, n], we would like to output the inorder traversal sequence of a binary tree through its preorder and postorder traversal sequence.)

批量将DBF文件中的数据导入到一个MDB文件中，涉及到数据库操作和VC DLG编程。(Batch data in the DBF file into an MDB file, related to the operation of the database and the VC DLG programming.)

实现骨骼动画类，实现简单骨骼动画载入鸡演示(Category to achieve skeletal animation, skeleton animation simple loading)

Windows程序运行原理及程序编写流程，窗口产生过程，句柄原理，消息队列，回调函数，窗口关闭与应用程序退出的工作关系，使用VC++的若干小技巧，stdcall与cdecl调用规范的比较，初学者常犯错误及注意事项。(Run Windows program principles and procedures for the preparation process, the process window, handle theory, message queues, the callback function, the application window is closed and quit working relationship, using VC++ several tips, stdcall and cdecl calling conventions comparison, beginners often mistakes and precautions.)

将出租车采集到的GPS数据匹配到电子地图上，并将车辆定位在道路上。(The taxi collected GPS data matching to the electronic map, and the position of the vehicle on the road.)

由于现代软件中，很多时候需要保留一些配置信息，而ini文件就是其中的方法之一，该工程简单而详细体现了ini文件的读写调用方式(Because of modern software, often need to retain some configuration information, and the ini file is one of the ways that the project reflects the simple and detailed invocation ini file read and write)

驱动级鼠标模拟 包含鼠标。键盘。驱动及模拟，附有小程序(Driver stage mouse emulation)

第6章 设备描述表和图形对象CPaintDCDemoCPaintDCDemo.rar,很不错的vc源码，有兴趣的朋友可以看看。(Chapter 6 describes the tables and graphics device object CPaintDCDemo CPaintDCDemo.rar, very good vc source, interested friends can see.)

tms320f2808 pwm timer

给定一个赋权无向图G=(V,E)，每个定点v∈U都有一个权值w(v)。如果U V，且对任意(u,v)∈E有u∈U或v∈U，就称U为图G的一个定点覆盖。G的最小权顶点覆盖是指G中所含顶点权之和最小的顶点覆盖。(Empowering given a undirected graph G = (V, E), each point v ∈ U has a weight w (v). If the UV, and for any (u, v) ∈ E there is u ∈ U or v ∈ U, on U that map G to a fixed-point coverage. G the right to the minimum vertex cover is contained in G refers to the right vertex of the vertex cover and minimum.)