搜索资源列表
城市信息及最短路径查询系统
- 用C语言写的《城市信息及最短路径查询系统》，图形界面，功能比较齐全。-C language book, "Cities and the shortest path query system", a graphical interface, functions more complete.
ass2_088766_wangxiaofeng_325
- 最短路径算法 几个城市之间的距离 输出的是一个城市到另一个城市的距离-Shortest path algorithm in several cities the distance between the output of a city to another city in the distance
shiyan1
- 地球的平均半径为6371千米，已知地球上两个城市A、B的经度和纬度，编程序求出这两个城市之间的地面距离-Earth' s average radius of 6,371 kilometers, the two cities are known on Earth A, B longitude and latitude programmed find this ground distance between the two cities
CityPlan
- 邻接矩阵表示两个城市之间是否有通路，试判断两个城市之间有几种路径 输入：3 1 2 1 1 1 1 1 1 1 1 1 输出：2-Adjacency matrix representation between the two cities have access, try to determine the path between the two cities have several inputs: 312111111111 Output: 2
FlightPlan
- Using arrays to write a program to calculate how long it will take you to fly between any two cities on an extremely unusual airline.
TSP
- 描述 Traveling Salesman Problem 市场上有很多种商品，旅行商Shrek做短期买卖赚取差价。他从一个城市购买一件商品，到达下一个相邻的城市就卖掉。如果这一次买卖无利可图，那么他就不会这么走。凭着自己和同伴多年的经验，他已经对地图上n个城市之间的差价了如指掌。两城市间可能有多种商品可赚取差价，此时Shrek只好倒卖利润最大的一件商品。 现在请你帮Shrek规划一条路线，使他能赚最多的钱。 输入 第一行两个整数n、m。表示