Description: 以最近通路法,及逐步修正法搜索通路,求出最小权的哈密顿通路或者哈密顿回路,既货廊问题 请将数字改为txt后缀-recent pathway, and is gradually Amendment Act search paths, obtained the right to the smallest or the Hamiltonian path Hamiltonian circuit, both cargo Gallery change the question I would be grateful if txt extension Platform: |
Size: 1561 |
Author:karl |
Hits:
Description: 最短路径和哈密顿通路，可以求得多条最短路径和哈密顿通路。-shortest path Hamiltonian path and can be obtained over the shortest path and Hamiltonian path. Platform: |
Size: 72555 |
Author:王辉 |
Hits:
Description: 以最近通路法,及逐步修正法搜索通路,求出最小权的哈密顿通路或者哈密顿回路,既货廊问题 请将数字改为txt后缀-recent pathway, and is gradually Amendment Act search paths, obtained the right to the smallest or the Hamiltonian path Hamiltonian circuit, both cargo Gallery change the question I would be grateful if txt extension Platform: |
Size: 1024 |
Author:karl |
Hits:
Description: 最短路径和哈密顿通路，可以求得多条最短路径和哈密顿通路。-shortest path Hamiltonian path and can be obtained over the shortest path and Hamiltonian path. Platform: |
Size: 72704 |
Author:王辉 |
Hits:
Description: 求马的哈密顿回路,在国际相棋棋局上,一只马要经过每个点,且仅经过一次,棋局可以是非常大,要求输出马经过的所有点及路径.-Hamiltonian circuit for the horse in the international chess game of chess, the one horse to go through each point, and only after one game can be very large and require output horse after all the point and path. Platform: |
Size: 1030144 |
Author:lin |
Hits:
Description: 求解最短哈密顿回路，先用贪心方法求解一个路径及权值，以此作为回溯剪枝界。-Solving the shortest Hamiltonian circuit, first with the greedy method to solve a path and weight, as a back pruning sector. Platform: |
Size: 54272 |
Author:曲宏磊 |
Hits:
Description: 贪心算法 ；用到图结构，栈和队列来解决哈密顿回路；输出结果：路径（每条边及其权值），总和-Greedy algorithm use graph structure,stacks and queues to solve the Hamiltonian circuit output:path (each edge and the right value),the sum Platform: |
Size: 5120 |
Author:zhuliyan |
Hits:
Description: 图论flord算法、哈密顿通路算法、kruskal算法、最大流算法、prim算法、旅行商算法及路由算法等等，都是由Matlab编写的图论算法程序。-Many graphic alogrithms are collected here. They includes flord, hamiltonian path, kruskal, max flow, prim, traveling salesman problem, and routing algorithms. All this are developed with Matlab. Platform: |
Size: 273408 |
Author:萧丹 |
Hits:
Description: 可以实现任何一个哈密顿图的最短路径，从而可以方便的计算出最短路径，获得更大的经济效益-Can achieve any of the shortest Hamiltonian path, which can easily calculate the shortest path to greater economic efficiency Platform: |
Size: 1024 |
Author:方玉 |
Hits:
Description: this program is hamilton circuit problem. this program written in java,, about hamiltonian circuit path Platform: |
Size: 1024 |
Author:dody |
Hits:
Description: 旅行商问题概述:找出一条n个给定的城市间的最短路径，使我们在回到出发的城市之前，对每个城市都只访问一次，即最短哈密顿回路问题。-Overview of the traveling salesman problem: to find the shortest path between a n given cities, so that before we return to the starting city, visit each city only once, the shortest Hamiltonian circuit problem. Platform: |
Size: 1084416 |
Author:叶金鑫 |
Hits:
Description: 寻找最优解或最佳路径的多种matlab算法，其中包括蚁群算法，贪婪算法，哈密顿算法，floyd算法，dijkstra算法，遗传算法等-Find the optimal solution or the best path for a variety of matlab algorithms, including the ant colony algorithm, greedy algorithm, Hamiltonian algorithm, floyd algorithm, dijkstra algorithm, genetic algorithm Platform: |
Size: 207872 |
Author:zone |
Hits:
Description: Shortest Path, Traveling Salesman and Hamiltonian Cycle are the other network
design problem. These problems are very common to back bone network design
problem. In all these three problems, the main difference is the degree of the node
which is strictly two. Further, these three problems are very similar with each other.
In the case of Shortest Path and Traveling salesman problem, a Hamiltonian Cycle is
checked in the possible solution. Due to this similarity, these three problems are also
considered in this research work. Shortest Path is considered in the terms of decision
making.-Shortest Path, Traveling Salesman and Hamiltonian Cycle are the other network
design problem. These problems are very common to back bone network design
problem. In all these three problems, the main difference is the degree of the node
which is strictly two. Further, these three problems are very similar with each other.
In the case of Shortest Path and Traveling salesman problem, a Hamiltonian Cycle is
checked in the possible solution. Due to this similarity, these three problems are also
considered in this research work. Shortest Path is considered in the terms of decision
making. Platform: |
Size: 335872 |
Author:mohamed |
Hits:
Description: 使用回溯的方法把所有的漢彌爾頓迴圈的路徑顯示出來。輸入方式是從文件取讀。-Use all the way back Hamiltonian path loops displayed. Input is taken from the document read. Platform: |
Size: 3072 |
Author:ZJ |
Hits:
Search - Hamiltonian path