Search - hamilton

Search - hamilton - List

[WEB Code] hamilton DL : 0: 介绍了几种找出各种图中所有hamilton回路的算法。
Update : 2008-10-13 Size : 1.23mb Publisher : crayon
[Communication] Hamilton DL : 0: Hamilton回路近似算法，本人程序，请大家多提宝贵意见
Update : 2008-10-13 Size : 1.15kb Publisher : 员新朋
[Other] 求最小Hamilton回路 DL : 0: 求最小Hamilton回路功能:在n个顶点的带权图G中，一条Hamilton回路是一顶点序列v1，v2，• • • • vn 其中，每个顶点vi由一条边连到vi+1（i=1，2，• • • • • ，n-1），而vn被连到v1。在所有的Hamilton回路中，寻找一条权值和最小的回路，这条回路就是最小Hamilton回路-circuit for the smallest functional Hamilton : n vertices with the right graph G, a Hamilton Circuit is a sequence of vertices v1, v2,# 8226# 8226# 8226# 8226 T. which each vertex vi even from one side to a vi (i = 1,2,# 8226# 8226# 8226# 8226# 8226, n-1), which was connected to the T. v1. All the Hamilton circuit, finding a value and the right to the smallest circuit, this circuit is the smallest HamiltonianCycle
Update : 2025-02-17 Size : 43kb Publisher : 吴剑刚
[Other] hamilton DL : 0: 找算法中一个经典问题：找最短哈米尔顿回路的算法实现。-Algorithm to find a classical problem: to find the shortest Hamilton circuit algorithm.
Update : 2025-02-17 Size : 1kb Publisher : 莫海波
[Documents] hamilton DL : 0: 介绍了几种找出各种图中所有hamilton回路的算法。-Introduce a number of identifying all the hamilton circuit diagram of the algorithm.
Update : 2025-02-17 Size : 1.23mb Publisher : crayon
[Program doc] Hamilton DL : 0: Hamilton回路近似算法，本人程序，请大家多提宝贵意见-Hamilton loop approximation algorithm, I program, everyone with more valuable comments
Update : 2025-02-17 Size : 1kb Publisher : 员新朋
[matlab] hamilton DL : 2: 经典的汉密尔顿回路算法，以Matlab代码编写。-Hamilton classic loop algorithm to Matlab coding.
Update : 2025-02-17 Size : 11kb Publisher : aoms
[Data structs] Hamilton DL : 0: 利用回溯法求解hamilton回路的算法-Use of backtracking algorithms for solving circuit hamilton
Update : 2025-02-17 Size : 1kb Publisher : 吕东
[Other] hamilton DL : 0: 汉密尔顿回路最优算法，等同于马步图程序，或者是送货郎问题-Hamilton loop optimal algorithm, the same as in Fig Mabuchi procedures, or delivery Lang problem
Update : 2025-02-17 Size : 137kb Publisher : jinxuan
[Windows Develop] Hamilton DL : 0: Program to find Hamilton Circuits on graph!
Update : 2025-02-17 Size : 27kb Publisher : Nguyen Minh Tan
[Program doc] Hamilton DL : 0: 马的Hamilton周游线路问题,帮助有些有这些课程设计的同学！-Zhe problem of traveling around!
Update : 2025-02-17 Size : 9kb Publisher : 周飞
[Data structs] Hamilton DL : 0: 马的Hamilton周游路线问题,---对于给定的偶数m，n≥6，且|m-n|≤2，编程计算m*n 的国际象棋棋盘一条马的Hamilton周游路线-Hamilton
Update : 2025-02-17 Size : 2kb Publisher : 童祚阳
[AI-NN-PR] hamilton DL : 0: 哈密尔顿回路包括模拟退火及其他即运用哈密尔顿解决问题-hamilton
Update : 2025-02-17 Size : 15kb Publisher : 齐齐
[Algorithm] Hamilton DL : 0: 汉密尔顿回路的C语言实现代码，是国外的人写的，和好很强大-code for Hamilton circuit C language implementation
Update : 2025-02-17 Size : 97kb Publisher : gfs
[matlab] Hamilton DL : 0: 哈密尔顿回路算法，内含TSP模拟退火算法和三边交换简单算法-Hamilton-loop algorithms, simulated annealing algorithm includes TSP and trilateral exchange of a simple algorithm for
Update : 2025-02-17 Size : 12kb Publisher : Taro Yu
[Other] Hamilton DL : 0: 提出一种新的Hamilton阵列编码的设计方法。在不用求出整个Hamilton阵列编码前提下，根据码距和维数要求，直接求出编码阵列中的某一具体的码元，预先构造出系数矩阵。和以往模型不同的是借助这个设计模型可以实现以任意顶点为起始点的Hamilton阵列编码，从而使得构造整个Hamilton阵列编码更灵活、更快速-This paper proposes a new design method for Hamilton array codes.According to the hamming distance and dimension this method can obtain a code element of the array without constructing the whole Hamilton array codes,and then constructs the coefficients matrix.Different from previous models,this model can realize Hamilton array codes taking any vertex as the initial one,thus making the construction of the Hamilton array codes more flexible and quicker. Finally,the paper also gives a design example according to the proposed model
Update : 2025-02-17 Size : 699kb Publisher : chengzi
[Algorithm] Hamilton DL : 0: 8*8 的国际象棋棋盘上的一只马，恰好走过除起点外的其它 63 个位置各一次，最后回到起点。这条路线称为一条马的 Hamilton 周游路线。对于给定的 m*n 的国际象棋棋盘，m 和n均为大于5的偶数，且|m-n|≤2，试设计一个分治算法找出一条马的Hamilton周游路线。编程任务：对于给定的偶数m，n≥6，且|m-n|≤2，编程计算 m*n 的国际象棋棋盘一条马的Hamilton 周游路线。 Input 输入数据的第一行有2个正整数m和 n，表示给定的国际象棋棋盘由 m行，每行n个格子组成。 Output 将计算出的马的Hamilton周游路线用下面的2 种表达方式输出。第 1 种表达方式按照马步的次序给出马的 Hamilton 周游路线。马的每一步用所在的方格坐标(x，y)来表示。x表示行的坐标，编号为 0，1，…，m-1；y表示列的坐标，编号为 0， 1，…，n-1。起始方格为（0，0）。第 2 种表达方式在棋盘的方格中标明马到达该方格的步数。（0，0）方格为起跳步，并标明为第1步。 -8* 8 chess board on a horse, just walk outside than from the other 63 positions each time, and finally back To the starting point. This line is called Hamilton a horse travel routes. For a given m* n chess board, m And n are even greater than 5, and | mn | ≤ 2, the partition algorithm to design a test to find a horse of Hamilton travel routes. Programming tasks: For a given even number m, n ≥ 6, and | mn | ≤ 2, programming computing m* n chess board a horse Hamilton Travel routes. Input The first line of input data are two positive integers m and n, that a given chessboard By the m lines of n-grid component. Output The calculated travel route horse Hamilton 2 with the following expression of the output. The first one kind of expression is given in accordance with the order of the horse Horse Hamilton travel routes. Horse with each step of the square where Grid coordinates (x, y) to represent. the coordinates of x that line, numbered 0,1, ..., m-1 y co
Update : 2025-02-17 Size : 16kb Publisher : zhang
[Other] Hamilton DL : 0: 8*8 的国际象棋棋盘上的一只马，恰好走过除起点外的其它 63 个位置各一次，最后回到起点。这条路线称为一条马的 Hamilton 周游路线。对于给定的 m*n 的国际象棋棋盘，m 和n均为大于5的偶数，且|m-n|≤2，试设计一个分治算法找出一条马的Hamilton周游路线。编程任务：对于给定的偶数m，n≥6，且|m-n|≤2，编程计算 m*n 的国际象棋棋盘一条马的Hamilton 周游路线。 -8* 8 chess board on a horse just walked outside than from the other 63 positions each time, and finally returned to the starting point. This line is called a horse' s Hamilton travel routes. For a given m* n chess board, m and n are even greater than 5, and | mn | ≤ 2, the partition algorithm to design a test to find a horse of Hamilton travel routes. Programming task: For a given even number m, n ≥ 6, and | mn | ≤ 2, programming computing m* n chess board a horse Hamilton travel routes.
Update : 2025-02-17 Size : 4kb Publisher : ahangin
[Windows Develop] Hamilton DL : 0: 在n个顶点的带权图G中，一条Hamilton回路是一顶点序列v1，v2，• • • • vn 其中，每个顶点vi由一条边连到vi+1（i=1，2，• • • • • ，n-1），而vn被连到v1。在所有的Hamilton回路中，寻找一条权值和最小的回路，这条回路就是最小Hamilton回路。-N vertices in a weighted graph G, a Hamilton circuit is a sequence of vertices v1, v2, • • • • vn where each edge by a vertex vi is connected to vi+1 (i = 1,2, • • • • • , n-1), and vn is connected to v1. In all of the Hamilton circuit, find a right value and the minimum loop, this loop is the minimum Hamilton circuit.
Update : 2025-02-17 Size : 6kb Publisher : 李姿琳
[AI-NN-PR] Hamilton DL : 0: 哈密顿环路算法解压后可看matlab实现哦-Hamilton can look after decompression loop algorithm
Update : 2025-02-17 Size : 35kb Publisher : 李明

« 12 3 4 5 6 7 8 9 10 »