sssc

mapsforge的地图数据，可以查看高程详情与等高线(Map data for mapsforge allows you to view elevation details and contours)

说明：  基于Xilinx Spartan6系列的fpga的锁相环实现(Based on Xilinx Spartan6 series fpga PLL implementation)

Graphical Layout Editor extends Graphical Editor With Palette.

希望大家会看着个软件。-hope

VC++ 改变鼠标指针的样式，让鼠标变个样，主要是改变鼠标指针的样式，这个MyCursor 源码实例演示了如何动态改变鼠标光标。将鼠标指针移到超链接和按钮上。注：测试截图抓不到鼠标的样式，是把显示鼠标的小图片换成了自定义的位图。

一个VC++ p2p下载软件源码，开源p2p技术的上传及下载软件源程序。当时这个软件还小流行了一把，只可惜没做好宣传，没火起来，不过它的源代码对咱们这VC编程者来说，可是有很大参考价值埃

一个图书管理系统，实现浏览图书，图书借阅，图书归还的功能 环境是python3.7.3，Djiango2.2.2 mysql8.0(A library management system, the realization of browsing books, books borrowing, books back to the function 37/5000 The environment is python3.7.3, Djiango2.2.2 mysql8.0)

一个路由器模拟器-a router simulator

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

通过手机IMSI分析,得到手机号码前7位.(Through the mobile IMSI analysis, the first 7 bits of the phone number are obtained.)