wuziqi

说明：  一个用vc编写的创建拖放时使用的图标源代码，可用鼠标进行图标的的拖动。(Vc prepared with the creation of a drag and drop the icon to use the source code, available dragging the mouse icon.)

利用DirectShow实现视频压缩和传输(Using DirectShow achieve video compression and transmission)

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

iec103 规约上位机源代码，喜欢的就下吧。(iec103 Statute of the host computer source code, like on the next bar.)

树形控件，可以插入头像，利用该控件可以实现类似QQ好友列表的功能(Tree class, it can show img at every item,you can use it to make friends list box like QQ)

wa enta mal omak ya 3am de nas wesa 7a e 7alas ya 3am elamor e7na warna sho 3ol e 7alas be ro7 imak ya neka

这是教你如何在ＶＣ里调用ｍａｔｌａｂ的文档和源程序(The document and source code to tell you how to load matlab engine using VC.)

Visual C++ .NET 网络与通信高级编程范例配套代码(Visual C++. NET network and high-level programming paradigm supporting code)

说明：  基于vtk的三维重构与裁切: 1.16位非压缩位图的读取与设置. 2.图像数据载入映射器 3.裁切平面的设置 4.边界的设置与显示 5.三维重构 注:需安装vtk4.0以上版本(It s about 3D reconstruct and clip based on VTK including reading and configration of 16 bits non_contracted bitmaps,the mapper for image data loading, configration of plane for clip,configration and display of borders and 3D reconstruct.(PS:VTK 4.0 or above version is needed))

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