搜索资源列表
zhanghua
- 主要解决旅行商问题(traveling saleman problem,简称tsp，即已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市，求解最短距离的遗传算法。-。-mainly to solve the traveling salesman problem (traveling saleman problem, listed tsp, known cities n between the distance from the exis
FWalgorithm
- FW算法实现最短路由搜索 输入搜索方式（1.最短距离2.最少路口） 输入起点（路口一到路口十） 输入终点（路口一到路口十） 显示路径-FW shortest route search algorithm Enter search methods (1. Shortest distance 2. At least intersection) Enter starting point (junction 1 to junction 10) Input t
Floyd-Matlab
- floyd算法的matlab程序 floyd-最短路问题 输入： B-邻接矩阵(bij)，指i到j之间的距离，可以是有向的。 sp- 起点标号。 ep- 终点标号。 输出： d- 最短路的距离。 path-最短路的路径。-floyd algorithm matlab program floyd-shortest path problem Input: B-adjacency matrix (bij), refers to the distan
2618-anqn
- 一个VC++算法实例，求两个城市间的最短距离，对算法的学习有帮助。-An instance of VC++ algorithm, seeking the shortest distance between two cities, there is help on the learning algorithm.
language18-22casesofactual
- 实例18 实现基本的串操作 实例19 计算各点到源点的最短距离 实例20 储油问题 实例21 中奖彩球问题 实例22 0-1背包问题- Instance 18 Achieve the basic string operations Instance 19 Points to calculate the shortest distance from source Instance 20
travel
- 旅游路线查询系统，实现两地间最短距离查询与最低价格查询。-Tour route search system, to achieve the shortest distance between two queries with the lowest price inquiry.
Pipeline
- 程序解决了给定油井位置，求出一条东西向输油管道的位置，使之到各个油井的距离之和达到最小 //程序一次性读入11组测试文件，将油井纵坐标存储在动态开辟的pipey数组里，通过运用在数组中查找第K小个元素的算法找到了管道的最优位置 //最后求得最短距离后，将最终结果一次性存储到11个输出文件中。-Program to solve a given oil well location, find a location east-west pipeline, so that the distanc
bellmanford
- bellmanford program for calculating shortest distance
hehe
- 求最短路程,比如走遍全中国的最短路程，也可以求解类似的问题-Seeking the shortest route, such as the shortest distance traveled throughout China, a similar problem can be solved
test
- 系统聚类，设有一空间点群，其中n=12，空间点位坐标如下表所示，根据系统聚类方法中的最短距离统计量进行聚类分析-Cluster, has a space group, where n = 12, space coordinate points in the following table, according to the system in the shortest distance clustering method for cluster analysis statistics
cc
- 该源程序实现求任意两点之间的最短距离，数据结构知识。-The source seeking to achieve the shortest distance between any two points, the data structure knowledge.
DataStructureCourse
- 数据结构课程的单源点最短距离问题，对上数据结构的同学有帮助-Data Structure Course single source shortest distance problem, the data structure help students
4
- 关于医院的建立问题，可以求出医院的建立地址，使其到所有其他村庄的距离最短-Establishment of issues on the hospital, the hospital can be found to establish address, so that the shortest distance of all the other villages
Bee
- 确定蜂巢上两点之间的最短距离。给定两点的编号，确定两点之间的距离。-Determine the honeycomb on the shortest distance between two points. Given two numbers, determine the distance between two points.
Floyd
- 计算任两点间最短距离的程序 用C++编译 floyd算法-Calculate the shortest distance between any two procedures with C++ compiler floyd algorithm
daoyouxitong
- 设计校园导游程序，完成校园信息的维护以及为来访的客人提供服务。 （1） 记录校内各景点信息：景点名称、代号、简介等； （2） 记录景点之间道路信息包括：两点距离、所需时间等相关信息； （3） 数据的输入可以是键盘输入或文件导入； （3） 提供对校园景点信息的编辑（如：添加、删除、修改等）的功能； （5） 为来访客人提供图中任意景点相关信息的查询； （4） 为来访客人提供从校门口到图中任意景点的问路查询，查询出距离最短的往返方案；-Cam
bellman-ford.c
- bellman-ford algorithm to find shortest distance in a graph. useful for path planning.
xiaoyuan
- 能够简单的查询校园内任意两点间的最短距离，有10个景点，是近期的课设-Can simply campus inquires the shortest distance between any two points, 10 spots, is recent class
VC_algorithm_shortest_distance_two_line_code
- VC++两个线段最短距离的算法代码 VC编程设计很好的参考学习代码-VC++ algorithm for the shortest distance of two line code
aa
- 根据所给的全国地图建立相应的数据存储，使用Dijkstra算法求任意两点间的最短距离.-According to the established national map of the corresponding data storage, using the Dijkstra algorithm for getting the shortest distance between any two points.