资源列表
TestTinyXML
- tinyxml库读写xml文件，内含有代码和xml说明文档-read and write xml file，including code and xml document
(Updated)-Long-Tail-Keyword-Research-Tool
- This code is windows application sample with c#. This code is to research word in Google and to upload and download Internet.-This code is windows application sample with c#. This code is to research word in Google and to upload and download Int
bank
- 利用C++的进程实现了银行柜员排队问题的解决-The process of using C++ implementation of the bank teller line problems
DialogForDll
- 源代码：实例代码显示怎样在DLL中创建对话框，在其它工程中调用DLL显示对话框-Source: example code shows how to create a dialog box in the DLL, call the DLL in other projects display the dialog box
test
- 将彩色图像变为灰阶图像,使用opencv实现的将图像转换-turn the color image into grey，use the opencv tool to do it
The-Collector
- This a pac man style game. You will notice that the "ghosts" are not ghosts they are robbers and they take your coins.-This is a pac man style game. You will notice that the "ghosts" are not ghosts they are robbers and they take your coins.
MFC
- 包含一系列MAC学习ppt，对MFC做出了全面的讲解-Contains a range of MAC learning ppt, made a comprehensive presentation on MFC
Huffman
- 一个简单的huffman的c语言程序，程序写的较为简单，重点利用数据结构中的二叉树算法。初学者可以看看，作为不同的思路。-A simple huffman c-language program, the program written in relatively simple, focusing on the use of the binary tree data structure algorithms. Beginners can see, as a different way of thi
GA_TSP
- 用MFC开发的GA写的旅行商问题(TSP)-it is a program on MFC,for the problen of TSP ,the algrorithm is GA
IETextR
- 利用IHTMLInputTextElement接口获取网页文本框账号密码，测试环境通过IE6.7.8和遨游，VC6.0工程。-Use interface to access web page text boxes IHTMLInputTextElement account password, test environment and travel through IE6.7.8, VC6.0 project.
Canny
- 基于vc++开发环境下的canny边缘检测，实现对灰度图的边缘检测-Canny edge detection based on vc++ development environment, realize the gray image edge detection
huffman
- 哈夫曼（Huffman）树又称最优二叉树或最优搜索树，是一种带权路径长度最短的二叉树。在许多应用中，常常赋给树中结点一个有某种意义的实数，称此实数为该结点的权。从树根结点到该结点之间的路径长度与该结点上权的乘积称为结点的带权路径长度(WPL)，树中所有叶子结点的带权路径长度之和称为该树的带权路径长度.(The Huffman (Huffman) tree, also known as the optimal two - fork tree or the optimal search tree,