搜索资源列表
Kruskal
- 用Kruskal算法实现若干个城市之间的最短路径.最大城市数目为7个.-algorithm using Kruskal several cities in the shortest path. The number of the largest city in seven.
Traffic
- 交通咨询，实现最优路径查询(时间，花费等....）可查询任意两个城市之间，以及一个城市到其他城市的走少花费-Transport Advisory and achieve the optimal path query (time, cost, etc. ....) can be found between any two cities, as well as a city to move to other cities with less
VRP
- 31个城市的VRP进行蚁群算法求解的matlab源码-31 cities, ant colony algorithm for VRP to the matlab source code
tsp-chang
- 5个城市TSP（旅行商问题）的基于遗传算法的C++源代码，希望对于你学习遗传算法会有一定的帮助-Five cities TSP (traveling salesman problem), genetic algorithm-based C++ source code, there will be some hope for you to learn the genetic algorithm help
kk
- 在n个城市间建立通信网络，需架设n-1条线路。求解如何以最低经济代价建设此通信网，这是一个最小生成树问题。要求：（1）利用普利姆算法求网的最小生成树；（2）输出生成树中各边及权值。-The n cities to establish communication between networks, the need to set up n-1 lines. How to solve this at the lowest economic cost of building communication
Area
- 根据所给的江苏省境界数据 – 显示并计算江苏省十三个地市的面积 – 编写墨卡托投影反算程序，转换上述数据为经纬度坐标，并显示 – 根据地球椭球体表面上的梯形面积计算方法，基于经纬度坐标计算江苏省十三个地市的面积-According to the data given in the realm of Jiangsu Province - Display and calculate the thirteen cities in Jiangsu Province, an area
jQuery_three_Code
- jQuery实现全国省市区城市三级联动代码-jQuery achieve three linkage cities nationwide provinces Code
SimulatedAnnealing
- Simulated annealing (SA) is a probabilistic technique for approximating the global optimum of a given function. Specifically, it is a metaheuristic to approximate global optimization in a large search space. It is often used when the search space is