Location:
Search - hamilton path
Search list
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: 提供一种求解最优哈密尔顿的算法---三边交换调整法，要求在运行jiaohuan3（三交换法）之前，给定邻接矩阵C和节点个数N，结果路径存放于R中。
bianquan.m文件给出了一个参数实例，可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,，回车后再输入jiaohuan3,得到了最优解。
由于没有经过大量的实验，又是近似算法，对于网络比较复杂的情况，可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。
-Provide an optimal algorithm Hamilton- trilateral exchange Adjustment Act, requiring running jiaohuan3 (c exchange) before a given adjacency matrix C and the node number N, the results of the path stored in the R in. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.
Platform: |
Size: 3072 |
Author: 枫 |
Hits:
Description: MALAB程序，包括顶点覆盖近似算法,哈密尔顿回路,画等温线,模拟退火应用,生成全排列矩阵,最小生成树Prim算法,最短路径等-MALAB procedures, including vertex cover approximation algorithm, Hamilton circuit, painting isotherms, simulated annealing applications, to generate full-rank matrix, Prim minimum spanning tree algorithm, the shortest path, etc.
Platform: |
Size: 45056 |
Author: john duan |
Hits:
Description: 经典的matlab算法代码，包括顶点覆盖近似算法，哈密尔顿回路，最短路和次短路，最短路径等等。-Classical algorithm matlab code, including the vertex cover approximation algorithm, Hamilton circuit, the most short-circuit and sub-circuit, the shortest path and so on.
Platform: |
Size: 45056 |
Author: 邱智聪 |
Hits:
Description: 提供一种求解最优哈密尔顿的算法---三边交换调整法，要求在运行jiaohuan3（三交换法）之前，给定邻接矩阵C和节点个数N，结果路径存放于R中。-Hamilton provides an algorithm for solving optimal--- trilateral exchange adjustment method requires running jiaohuan3 (c exchange) before the given node number of the adjacency matrix C and N, the result stored in R in the path.
Platform: |
Size: 13312 |
Author: masai |
Hits:
Description: 用c语言实现的校园导航，包含多个顶点的无向图。具体功能有，最短路径，最佳路径（汉米尔顿回路）。-With c language campus navigation, multiple vertices undirected graph. Specific function, shortest path, the best path (Hamilton circuit).
Platform: |
Size: 3072 |
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: 也是最优路径问题，编译后会得到一个最短的路径-Is the optimal path problem, the compiler will get a shortest path
Platform: |
Size: 1024 |
Author: liuyanan |
Hits:
Description: 对matlab解决图论问题的算法做个汇总。主要包括：顶点覆盖近似算法、哈密尔顿回路、最大流和最小截、最短路和次短路、最小生成树Prim算法、最短路径等等。由于太多就不一一列举了。-Matlab to solve the problem of graph theory algorithms to be aggregated. Include: vertex cover approximation algorithm, Hamilton circuit, the maximum flow and minimum cut shortest times short circuit, Prim minimum spanning tree algorithm, the shortest path. Not because of too many to enumerate.
Platform: |
Size: 55296 |
Author: 中士 |
Hits:
Description: 提供一种求解最优哈密尔顿的算法---三边交换调整法，要求在运行jiaohuan3（三交换法）之前，给定邻接矩阵C和节点个数N，结果路径存放于R中。-Hamilton provides an optimal algorithm for solving triangular exchange--- Adjustment Act to require running jiaohuan3 (c exchange) before the adjacency matrix C, given the number of nodes N, the results of the path stored in R,.
Platform: |
Size: 3072 |
Author: 刘星 |
Hits:
Description: 绣花问题是连续型的填充，在不同区域的缝制过程中，缝针不能提针，因此不能用一般的离散型区
域填充方法处理。本文运用几何计算和图论理论提出了一个绣花缝针轨迹自动生成算法：先对轮廓走向进行
定义，通过轮廓铅垂方向的局部极值点的分割线将图案从上向下进行分割，采用交点的特征值比较彻底的解
决了分割时的重点问题，将图案区域准确的划分成缝针能一次完成的若干个节点。在此基础上根据节点的邻
接关系建立节点的邻接“图”，通过图论中半哈密尔顿路径或深度遍历方法找到节点的遍历（缝制）序列和每
个节点的缝制方向，最后可对设定的起点、终点和缝针间隔的条件自动提供缝针的走向轨迹-In the process of embroidering, needle can not hang up for changing to a different area. Therefore, Embroider
problem could be abstract as a continuous area-filling work. Considering disperse area-filling methods can not process this
problem well. Based on geometry computing and graph theory, an algorithm of finding path of embroidering needle are
proposed in this paper. First, outline orientations are defined, and finding all local extreme points of inner outline on their
gravitational orientation to build sectioning lines so as to divide the picture. By using intersection point character the
overlap point problem was solved perfectly. Therefore, the picture is divided into some nodes which can be finished alone.
Then, based on connections of these nodes, an adjacency graph of nodes was built. Using half-Hamilton path or depth-first
search method, both embroidering sequence and direction of these nodes could be got from the graph. Finally, from a
defined start-point, end-point
Platform: |
Size: 270336 |
Author: lili |
Hits:
Description: 绣花问题是连续型的填充，在不同区域的缝制过程中，缝针不能提针，因此不能用一般的离散型区
域填充方法处理。本文运用几何计算和图论理论提出了一个绣花缝针轨迹自动生成算法：先对轮廓走向进行
定义，通过轮廓铅垂方向的局部极值点的分割线将图案从上向下进行分割，采用交点的特征值比较彻底的解
决了分割时的重点问题，将图案区域准确的划分成缝针能一次完成的若干个节点。在此基础上根据节点的邻
接关系建立节点的邻接“图”，通过图论中半哈密尔顿路径或深度遍历方法找到节点的遍历（缝制）序列和每
个节点的缝制方向，最后可对设定的起点、终点和缝针间隔的条件自动提供缝针的走向轨迹。-In the process of embroidering, needle can not hang up for changing to a different area. Therefore, Embroider
problem could be abstract as a continuous area-filling work. Considering disperse area-filling methods can not process this
problem well. Based on geometry computing and graph theory, an algorithm of finding path of embroidering needle are
proposed in this paper. First, outline orientations are defined, and finding all local extreme points of inner outline on their
gravitational orientation to build sectioning lines so as to divide the picture. By using intersection point character the
overlap point problem was solved perfectly. Therefore, the picture is divided into some nodes which can be finished alone.
Then, based on connections of these nodes, an adjacency graph of nodes was built. Using half-Hamilton path or depth-first
search method, both embroidering sequence and direction of these nodes could be got from the graph. Finally, from a
defined start-point, end-point
Platform: |
Size: 270336 |
Author: sss |
Hits:
Description: 贪心算法和回溯寻找近似最短哈密顿回路，得到近似最短回路-find the shortest hamilton circle path
Platform: |
Size: 66560 |
Author: SSN |
Hits:
Description: 本压缩包包括matlab的顶点覆盖近似算法、哈密尔顿回路、模拟退火应用、最大流和最小截、最短路和次短路、最短路径、最小生成树prim算法等，带有源程序和中文说明文档，此文件夹中的文件，如需被利用，则要直接放至work目录下。-The compressed packet including matlab vertex cover approximation algorithm, Hamilton circuit, simulated annealing, maximum flow and minimum cross-sectional, short-circuit and times of short-circuit, the shortest path, minimum spanning tree prim algorithm with source code and Chinese documentation, thisfile folder for use, will have to be placed directly under the work directory.
Platform: |
Size: 47104 |
Author: 吴自强 |
Hits:
Description: 使用回溯的方法把所有的漢彌爾頓迴圈的路徑顯示出來。輸入方式是從文件取讀。-Use all the way back Hamiltonian path loops displayed. Input is taken from the document read.
Platform: |
Size: 3072 |
Author: ZJ |
Hits:
Description: 基于降度算法的哈密尔顿最优圈搜寻方法,寻找费用最小的哈密尔顿路径，用于解决TSP、任务分流、任务指派等问题-Find the best Hamilton route based on the method of lap down algorithm. The algorithm finds the minimum cost path for solving TSP, the task diversion, task assignment and other issues
Platform: |
Size: 115712 |
Author: 钟腾 |
Hits:
Description: 利用哈密尔顿圈算法解决旅行售货员问题和货郎担问题，从而使走过的路程最短。-By using Hamilton loop algorithm to solve traveling salesman problem and traveling salesman problem, so that through the path the shortest.
Platform: |
Size: 4096 |
Author: 小强 |
Hits:
Description: 可以解决哈密尔顿圈问题，寻找遍历所有点回到起点的最短路(You can solve the Hamilton circle problem and look for the shortest path that traverses all the points back to the starting point)
Platform: |
Size: 1024 |
Author: JackeeY
|
Hits:
Description: 中文汉密尔顿时间序列分析，助你走上新的道路(Chinese Hamilton time series analysis helps you to embark on a new path)
Platform: |
Size: 14090240 |
Author: kobbe |
Hits: