搜索资源列表
a
- 用分支限界方法求解最淡哈密顿回路，可以球接到30以上-Using branch and bound method for solving the most light Hamiltonian circuit, you can receive the ball for more than 30
hamliton
- 此程序通过回溯的方法求解最短哈密顿回路问题-This program through the back of the method for solving the shortest Hamiltonian circuit problem
findH
- 用分支限界法实现n比较大时（n>100)找最优哈密顿回路。-Using branch and bound method to achieve relatively large n, when (n> 100) to find the optimal Hamiltonian circuit.
hamilton
- 求无向图的是否有哈密顿圈 如果有输出最大哈密顿圈-Undirected graph in order to have Hamiltonian cycle if there is the greatest Hamiltonian cycle output
hamiltoniancircuit
- 利用 c++ 实现 棋盘的哈密顿回路问题-usec++tosolute the problem of hamiltonian circuit
hamidun
- 实现哈密顿回路，在VC6.0调试过的程序，没有错误，供大家参考学习。-Realize the Hamiltonian loop, the program in VC6.0 debugging, no error, provide everyone reference to study.
gRAPH
- 这是图论课程设计 生成哈密顿回路 有源码 报告和注释-This is the graph theory courses designed to generate a Hamiltonian circuit source report and comments
TSP-simulated-annealing-algorithm
- 应用于哈密顿回路的TSP模拟退火算法，里面有6个m文件-Hamiltonian circuit used in the TSP simulated annealing algorithm, which has a 6 m files
ShiWuSuDi
- 食物速递服务，哈密顿图，最短路径，满足条件，NP问题,深度优先搜索。-Food Delivery Service, Hamiltonian, shortest path, to meet the conditions, NP problems, depth-first search.
LINGO1
- 基于TSP模型的哈米尔顿圈算法，用lingo实现。本程序在lingo11上编写-TSP-based model Hamiltonian cycles algorithm, using lingo implementation. The program is written on lingo11
lingo-Hamiton
- 基于实例的哈密顿算法的lingo实现，欢迎指正交流-Examples of algorithms based on Hamiltonian realization lingo
ED first version
- 实现一个小系统的哈密顿矩阵的对角化，实现降维。(reduce the dimensions of a large hamiltonian matrix.and calculate the ground stste of a system)
哈密顿
- 由c语言编程，在window下运行，为无向图，先读入两个数据，第一个数据为点的个数，第二个数据为边的个数。此后依次输入哪两个点之前连线，即完成无向图。之后程序会输出0和1,0代表不存在哈密顿回路，1代表存在哈密顿回路(Programming by C language, run under window, for undirected graph, read two data first, the first data is the number of points, the second da