当前位置：
首页 资源下载
搜索资源 - hamiltonian circuit
搜索资源列表
-
0下载：
以最近通路法,及逐步修*搜索通路,求出最小权的哈密顿通路或者哈密顿回路,既货廊问题 请将数字改为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 grat
-
-
0下载：
哈密顿马步图回路问题，这是一个经典问题，代码由matlab编写。-Hamiltonian circuit map, which is a classic problem, code prepared by Matlab.
-
-
0下载：
哈密顿图的判定：经过图中所有顶点一次且仅一次的回路称为哈密顿回路。具有哈密顿回路的图称为哈密顿图，-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,
-
-
0下载：
哈密顿回路，对于给定的一个图查找图中是否存在哈密顿回路的一个算法。-Hamiltonian circuit, for a given a map to find the existence of maps of a Hamiltonian circuit algorithm.
-
-
0下载：
利用回溯法求解hamilton回路的算法-Use of backtracking algorithms for solving circuit hamilton
-
-
0下载：
本程序引入了连通性状态压缩动态规划方法，可以在非常快的时间内解决棋盘上的哈密顿回路个数的计数。
时间复杂度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
-
-
0下载：
求解最短哈密顿回路，先用贪心方法求解一个路径及权值，以此作为回溯剪枝界。-Solving the shortest Hamiltonian circuit, first with the greedy method to solve a path and weight, as a back pruning sector.
-
-
0下载：
用分支限界方法求解最淡哈密顿回路，可以球接到30以上-Using branch and bound method for solving the most light Hamiltonian circuit, you can receive the ball for more than 30
-
-
0下载：
贪心算法 ；用到图结构，栈和队列来解决哈密顿回路；输出结果：路径（每条边及其权值），总和-Greedy algorithm use graph structure,stacks and queues to solve the Hamiltonian circuit output:path (each edge and the right value),the sum
-
-
0下载：
此程序通过回溯的方法求解最短哈密顿回路问题-This program through the back of the method for solving the shortest Hamiltonian circuit problem
-
-
0下载：
用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
-
-
0下载：
用分支限界法实现n比较大时（n>100)找最优哈密顿回路。-Using branch and bound method to achieve relatively large n, when (n> 100) to find the optimal Hamiltonian circuit.
-
-
0下载：
给出一个完全图，给出最小哈密顿回路。顶点个数不要超过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, yo
-
-
0下载：
HDU3091 求解哈密顿回路数，状态压缩动态规划实现-Solving Hamiltonian circuit HDU3091 the number of dynamic programming to achieve the state compression
-
-
0下载：
通过输入一个有权图，求出它的最短的一条哈密顿回路。-By entering a right map, obtained with a shortest Hamiltonian circuit.
-
-
0下载：
利用 c++ 实现 棋盘的哈密顿回路问题-usec++tosolute the problem of hamiltonian circuit
-
-
0下载：
这个程序主要是应用在图论中来解决哈密顿回路问题 是比较常见的-This procedure is mainly used in graph theory to solve the Hamiltonian circuit problem is more common
-
-
0下载：
跳马算法的实现：考虑国际象棋棋盘上某个位置的一只马，它是否可能只走步，正好走过除起点外的其他个位置各一次，并且最后能够回到初始点（存在哈密顿回路）？-Vault algorithm implementation: considering a location on the chess board of a horse, it may only be walking, just walk in addition to other locations outside the starting poi
-
-
0下载：
this program is hamilton circuit problem. this program written in java,, about hamiltonian circuit path
-
-
2下载：
欧氏旅行售货员问题是对给定的平面上n 个点确定一条连接这n 个点的长度最短的哈密顿回路。由于欧氏距离满足三角不等式，所以欧氏旅行售货员问题是一个特殊的具有三角不等式性质的旅行售货员问题。它仍是一个NP 完全问题。最短双调TSP 回路是欧氏旅行售货员问题的特殊情况。平面上n 个点的双调TSP 回路是从最左点开始，严格地由左至右直到最右点，然后严格地由右至左直至最左点，且连接每一个点恰好一次的一条闭合回路。-Euclidean traveling salesman problem is a giv
-
