二层地质模型波场模拟

Change the background color of the tree control VC source code

输电线路距离保护的两个仿模型，一个0方向继电器，一个补偿继电器(protection on power line, wiht 0 electric relay and compensate electric relay)

通讯录系统源码，本系统原码是针对新手学习用的，如果你熟练VC++，请不要下载！-Source address book system, the system is the original code used for novices to learn, if you are skilled VC++, Please do not download!

说明：  桁架计算内力，位移，小程序，适合初学者适用，平面桁架有限元分析(Calculation of plane truss internal force, displacement, small program, suitable for beginners, plane truss finite element analysis)

闻亭F28x Flash烧写程序,希望有用-Wintech F28x Flash programmer procedures useful

通过在1-10000中随机选取一个整数，让玩家猜测。猜测中会提示玩家，所猜的数字偏大或偏小。(By selecting an integer randomly in 1-10000, let the player guess. In guessing, the player will be prompted. The number of guesses is larger or smaller.)

说明：  基于matlab,对2fsk进行调制解调(Modulation and demodulation of 2FSK based on MATLAB)

本帮助文件中的Windows API 函数大约有774个，共分十二大类，基本上包括了大部分的常用和非常用的Windows API 函数。-The help files in Windows API function has about 774, divided into twelve categories, basically most of the commonly used and very used to Windows API functions.

一款可以快速实现图片缩略图的图象处理工具，国外人员开发-One can quickly achieve the picture thumbnails of image processing tools developed abroad

旅行商问题(TravelingSalesmanProblem，TSP)是一个经典的组合优化问题。经典的TSP可以描述为：一个商品推销员要去若干个城市推销商品，该推销员从一个城市出发，需要经过所有城市后，回到出发地。应如何选择行进路线，以使总的行程最短。从图论的角度来看，该问题实质是在一个带权完全无向图中，找一个权值最小的Hamilton回路。由于该问题的可行解是所有顶点的全排列，随着顶点数的增加，会产生组合爆炸，它是一个NP完全问题。(Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem. The classic TSP can be described as: a merchandiser sells goods to several cities. The salesman starts from a city and needs to go through all the cities and return to the starting point. How to choose the route of travel so that the total journey is the shortest. From the point of view of graph theory, the essence of the problem is to find a Hamilton loop with the smallest weight in a completely undirected graph with weights. Since the feasible solution to this problem is the full permutation of all vertices, as the number of vertices increases, a combinatorial explosion occurs, which is an NP-complete problem.)