搜索资源列表
cityscape
- 用qt做的城市电子地图，可自动放大缩小，希望对初学QT编程的同门有帮助-Qt to do with electronic maps of cities, can be automatically enlarged or reduced, in the hope of learning programming QT help with the door
pipes
- Industry of street lighting systems are growing rapidly and going to complex with rapid growth of industry and cities. -Industry of street lighting systems are growing rapidly and going to complex with rapid growth of industry
tsp
- 该程序解决10个城市的货郎担问题（TSP），主要使用简单的遗传算法实现。该过程中包括：编码、解码，选择，交叉，变异等！-The program to solve the traveling salesman problem of 10 cities (TSP), the use of simple genetic algorithm. The process includes: encoding, decoding, selection, crossover and mutation!
php_tianqi
- 主要用途 1.获取城市天气预报 2.在线给好友或自己发送飞信 3.调用飞信api接口 4.定时发送天气预报[可群发] -The main purpose to obtain weather forecasts for cities. Online to friends or send Fetion call Fetion api interface regularly sent weather forecast can be mass]
1
- 查找城市信息，俺城市名查找城市坐标，查找所有与P距离小于D的城市-Find city information, I city Find cities coordinates, find the city less than D and P distance
antAlgorithm
- 解决中国31个城市周游问题，已注解，可直接运行-31 cities to travel around China to solve the problem, annotated, can be run directly
51
- 蚁群算法，使用matlab语言，解决TSP问题，此例解决的51个城市的TSP问题-Colony algorithm, using matlab language, solve TSP, in this case solved 51 cities TSP problem
shortest
- 实现两个城市之间最短路径和最小花费的程序，可以作为数据结构的参考- 实现两个城市之间最短路径和最小花费的程序，可以作为数据结构的参考 Implementation of the shortest path between two cities and the minimum cost of the program, can be used as a reference for the data structure
TSP
- tsp遗传算法 31个城市 有动态过程-tsp GA 31 cities dynamic process
zuixiaoshengchengshu
- 最小生成树算法,有n个城市可以用（n-1）条路将它们连通，求最小总路程的和。最小生成树算法，如Prim、Kruskal算法编写最小生成树程序输出最小生成树的各条边-Minimum spanning tree algorithm, there are n cities can use the (n-1) road will connect them, and find the smallest total distance. Respective sides of the minimum span