搜索资源列表
货郎担分枝限界图形演示
- 货郎担分枝限界图形演示 问题描述:某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman Branch and Bound graphic demonstration Problem descr iption : A salesman to a number of cities to sell commodities, the known distance
visit
- 用贪心算法做的全国31个城市之间的旅行商问题源代码，可执行程序都在附件压缩包内。里面的data.txt city.txt分别为数据表和城市名，要和可执行程序放在同一个目录内才可执行-greedy algorithm to do with the country's 31 cities between the TSP source code, the executable in Annex compressed packet. Inside data.txt city.txt of dat
shorttest_path_program
- 有N个城市，编号为0、1…N-1，每个城市之间的路径长度保存在二位数组a中，如a[i][j]表示城市i与城市j的路径长度。求某个城市到其余城市的最短路径。-cities are N, No. 0,1 ... N-1, every city path length between the two kept in a group median, if a [i] [j] i said cities and urban j length of the path. For a city to the o
tsp_tsp
- 中国所有大中城市的TSP问题实现。图形演示。采用最近邻法则-all of China's large and medium-sized cities in the TSP to achieve. Presentation graphics. Neighbors recently adopted rules
graph11
- 城市之间的最短路径，用于求任意两个城市之间的最短路径-cities in the shortest path for the two cities arbitrary seeking the shortest path between
Data_ShorPath
- 数据结构课程的经典源码。以中国交通图为背景，求各大城市之间的最短路径。读文件操作。-data structure course of the classic source. China traffic map background, major cities seeking the shortest path between. Reading file manipulation.
Dijkstra_TA
- 数据结构的经典实验程序。以全国主要城市为图的顶点, 铁路连接为图的边, 距离作为加权, 设计完成一个最短路径自动查找系统；输入为出发城市和目标城市, 输出为最短路径和距离。 -data structure of the classic experimental procedure. In major cities across the country to the vertex, the railway linking the edge of the map, as the weighted
TSP
- 旅行商问题： 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman problem : A salesman to a number of cities to sell commodities, known the distance between cities (or travel). He selected from a resident, after
城市的信息带头结点的单链表
- 将若干城市的信息，存入一个带头结点的单链表。结点中的城市信息包括：城市名，城市的位置坐标。要求能够利用城市名和位置坐标进行有关查找、插入、删除、更新等操作。-Several cities in the information into a single linked list node to take the lead. Nodes in the city information including: city name, the city' s location coordinates. Re
a
- 禁忌搜索算法，解决三十个城市间的旅行商问题，求出最短距离-Tabu search algorithm to solve thirty cities between the traveling salesman problem, find the shortest distance
02666199TS-TSP
- 禁忌搜索算法，解决三十个城市间的旅行商问题，求最短距离-Tabu search algorithm to solve thirty cities between the traveling salesman problem, the shortest distance
shortest_path
- 分别用floyd 和dijkstra算法计算城市间最短路径的简单例子，地图由固定格式的文件输入，参考压缩包中的sample.txt,地图文件名要作为main参数-Floyd were Dijkstra algorithm and the shortest path between cities in the simple example, the map by a fixed format file input, reference compression package sample.txt,
chengxu
- 城市之间路径查询 自行输入数据-Between cities on their own path query input data
main
- 全国交通咨询系统 设计主要分三个部分：一是建立交通网络图的存储结构，二实现两个城市间的最短路经问题。3程序所具有的功能特色本程序主要目的是为了给用户提供路径咨询。实现了帮助用户了解全国各大城市间往来的最短路径问题，第二，可以提供用户查询各大城市的相关信息。本程序最大的特点是支持用户自己添加城市信息及城市，或添加城市的路径，既就有可扩展性。-National Transport Advisory System is divided into three main parts: First, e
GZ
- 给定一个地区的n个城市间的距离网，用Prim算法或Kruskal算法建立最小生成树，并计算得到的最小生成树的代价。-Given a region n the distance between cities network, using Prim algorithm or Kruskal minimum spanning tree algorithm, and calculate the cost of the minimum spanning tree.
minimal_spanning_tree(Prims)
- 最小生成树问题 问题描述：若要在ｎ个城市之间架设通讯网络，只需要架设ｎ－１条线路即可。如何以最低的经济代价建设这个通讯网，是一个网的最小生成树问题。 设计要求：利用Prims算法求网的最小生成树；以文本形式输出生成树中各条边以及它们的权值。 -The issue of minimum spanning tree problem Descr iption: n To set up a communication network between cities, only need to
lujin
- 最短路径问题（用无向图表示n个城市之间的交通网络建设规划，顶点表示城市，边上的权表示该线路的造价，试设计一个方案，使得这个交通网的总造价最小。）-The shortest path problem (with undirected graph n cities that transport links between the construction plan, vertex, said city, said the right edge of the construction cost of
bb_code_by_ipiszhang
- 分支界限法的C语言源码 实现了计算两个城市之间一定开销的基础上的最短路径-Broud and Branch C source code for calculating certain expenses between the two cities based on the shortest path
zdlc
- 【问题描述】 甲、乙、丙、丁、未五城市分别距离为( 单位是： km)： 甲 - 乙 300 甲 - 未 3000 乙 - 丙 2500 乙 - 丁 800 丙 - 未 1000 丁 - 甲 2000 丁 - 丙 400 丁 - 未 1200 未 - 乙 500 现从未地出发，到其它各城市的最捷路径。 【设计要求】 1、写出系统需求分析，并建模。 2、编程实现，界面友好。 3、输出各条最捷路径 4、语言不限，最好是c或c++ -【Desc
dijkstra
- dijkstra算法的matlab实现，验证数据采用了河北省主要城市的赋值无权网络图，并分析了单程往复式行驶的效率因素，实际应用价值高-the dijkstra algorithm matlab to achieve, verify the data used in major cities in Hebei Province network has no right of assignment, and an analysis of the efficiency of one-way reci