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: 以最近通路法,及逐步修正法搜索通路,求出最小权的哈密顿通路或者哈密顿回路,既货廊问题 请将数字改为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: java遍历8*8棋盘源代码
运用哈密顿回路遍历，速度很快-java Traversal 8* 8 chessboard source code for the use of ergodic Hamiltonian circuit, fast Platform: |
Size: 6144 |
Author:王洪 |
Hits:
Description: 这里面是很多经典算法的源代码，如八皇后，最长不下降序列，迷宫，哈密顿回路等问题-There is a lot of the classic algorithm source code, such as the eight Queen s, the longest non-drop sequence, maze, Hamiltonian circuit and other issues Platform: |
Size: 2513920 |
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: 哈密顿回路，对于给定的一个图查找图中是否存在哈密顿回路的一个算法。-Hamiltonian circuit, for a given a map to find the existence of maps of a Hamiltonian circuit algorithm. Platform: |
Size: 1024 |
Author:zhujuan |
Hits:
Description: 本程序引入了连通性状态压缩动态规划方法，可以在非常快的时间内解决棋盘上的哈密顿回路个数的计数。
时间复杂度O(n*m*3^n)远低于搜索。-This procedure introduced in the state of connectivity compression methods of dynamic programming can be very fast in time to solve the Hamiltonian circuit board on the count of the number. Time complexity O (n* m* 3 ^ n) far below the search. Platform: |
Size: 1024 |
Author:curimit |
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: 用分支限界方法求解最淡哈密顿回路，可以球接到30以上-Using branch and bound method for solving the most light Hamiltonian circuit, you can receive the ball for more than 30 Platform: |
Size: 1142784 |
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: 此程序通过回溯的方法求解最短哈密顿回路问题-This program through the back of the method for solving the shortest Hamiltonian circuit problem Platform: |
Size: 879616 |
Author:于爱华 |
Hits:
Description: 用C语言编写的马步图；比较简单，思路是采用把象棋先转换成矩阵，然后再检索图找哈密顿回路-Written in C language with Bu map relatively simple idea is used to convert the first matrix of chess, and then retrieve the map to find the Hamiltonian circuit Platform: |
Size: 2048 |
Author:zhuliyan |
Hits:
Description: 用分支限界法实现n比较大时（n>100)找最优哈密顿回路。-Using branch and bound method to achieve relatively large n, when (n> 100) to find the optimal Hamiltonian circuit. Platform: |
Size: 286720 |
Author:杨雪 |
Hits:
Description: 给出一个完全图，给出最小哈密顿回路。顶点个数不要超过20.程序自动生成了一个完全图。也可修改输入，自己输入完全图。-Is given a complete graph is given the minimum Hamiltonian circuit. The number of vertices should not exceed 20. Program automatically generates a complete graph. Can also modify the input, your input complete graph. Platform: |
Size: 1024 |
Author:yan |
Hits:
Description: HDU3091 求解哈密顿回路数，状态压缩动态规划实现-Solving Hamiltonian circuit HDU3091 the number of dynamic programming to achieve the state compression Platform: |
Size: 1024 |
Author:LJJ |
Hits:
Description: 通过输入一个有权图，求出它的最短的一条哈密顿回路。-By entering a right map, obtained with a shortest Hamiltonian circuit. Platform: |
Size: 2048 |
Author:黄秀清 |
Hits:
Description: 哈密顿图的判定：经过图中所有顶点一次且仅一次的回路称为哈密顿回路。具有哈密顿回路的图称为哈密顿图，-determine Hamiltonian graph : After all the vertices of a graph and only one loop is called Hamiltonian circuit. A graph that has a Hamiltonian circuit is called a Hamiltonian map, Platform: |
Size: 9216 |
Author: |
Hits:
Search - hamiltonian circuit