PANSAT_CLEAN2700_6_4_06

sql的数据库系统的实例,是关于体育协会的详细分类,是用德语写的.-sql an example of database systems, on the Sports Association for the detailed classification is written in German.

VB简单弹球游戏源代码,有需要的就下载吧，很好的参考。(VB simple pinball game source code, there is need to download it, very good reference.)

to study for student

说明：  一款简单实用的jQuery计时器插件。该插件可以任何HTML元素中插入计时器，(A simple and practical jQuery timer plug-in. The plug-in can insert timers into any HTML element.)

Simple voltage sag generation by sudden load change.

说明：  Fluent.Ribbon 源码，类似office2010的界面，最近很流行的界面(Fluent. Ribbon source code, similar to the Office 2010 interface, the recently popular interface)

windows S/C socket example.

娱乐玩耍的一个锁屏和桌面，自己下载后就可以哦弄简单只要会点就可以弄好(A lock screen and desktop for entertainment and play. After downloading it, you can make it easy. You can make it easy as long as you know how to click on it.)

说明：  旅行商问题(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.)

世界编程大赛一等奖作品，在DOS下直接DEBUG后粘贴就可运行-won the World Programming Contest, works directly under the DOS DEBUG can run after pasting