搜索资源列表
模拟退火法计算最短路径
- 用模拟退火法高效的计算图论中哈密顿贿赂的最短路径-simulated annealing method of calculating efficient graph theory Hamiltonian bribery Shortest Path
hamilton
- 以最近通路法,及逐步修正法搜索通路,求出最小权的哈密顿通路或者哈密顿回路,既货廊问题 请将数字改为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
TravelGuideApp
- 最短路径和哈密顿通路，可以求得多条最短路径和哈密顿通路。-shortest path Hamiltonian path and can be obtained over the shortest path and Hamiltonian path.
gahmd
- 基于遗传算法的哈密顿问题求解，有基本的说明和代码-based on genetic algorithm Hamiltonian problem solving, a basic descr iption and code.
harmiton
- 哈密顿马步图回路问题，这是一个经典问题，代码由matlab编写。-Hamiltonian circuit map, which is a classic problem, code prepared by Matlab.
Hamiltonian-graph
- 哈密顿图的判定：经过图中所有顶点一次且仅一次的回路称为哈密顿回路。具有哈密顿回路的图称为哈密顿图，-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,
Hamilton
- 利用回溯法求解hamilton回路的算法-Use of backtracking algorithms for solving circuit hamilton
liantongxing
- 本程序引入了连通性状态压缩动态规划方法，可以在非常快的时间内解决棋盘上的哈密顿回路个数的计数。 时间复杂度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
MODEL
- 用Lingo和matlab编写的哈密顿圈搜索法则，可以同时搜索三个和四个哈密顿圈-Prepared using Lingo and Hamiltonian circle matlab search rules, you can simultaneously search three and four Hamiltonian cycle
matlabsuanfa
- 包含了Floyd算法、dijkstra算法、贪婪算法、遗传算法、搜索算法、蚁群算法、哈密顿环路的matlab源程序及相关说明。-Floyd algorithm is included, dijkstra algorithm, greedy algorithm, genetic algorithm, search algorithm, ant colony algorithm, Hamiltonian loop matlab source code and instructions.
hdu3091_Necklace
- HDU3091 求解哈密顿回路数，状态压缩动态规划实现-Solving Hamiltonian circuit HDU3091 the number of dynamic programming to achieve the state compression
AnnealingAlgorithm
- 利用模拟退火算法计算完备图的哈米尔顿圈，编的好辛苦的-Using simulated annealing algorithm, a complete map of the Hamiltonian cycles, compiled a good hard
halmiton
- 通过输入一个有权图，求出它的最短的一条哈密顿回路。-By entering a right map, obtained with a shortest Hamiltonian circuit.
graphic_alogrithms_collection
- 图论flord算法、哈密顿通路算法、kruskal算法、最大流算法、prim算法、旅行商算法及路由算法等等，都是由Matlab编写的图论算法程序。-Many graphic alogrithms are collected here. They includes flord, hamiltonian path, kruskal, max flow, prim, traveling salesman problem, and routing algorithms. All this are dev
ACO_Hamilton1
- 可以实现任何一个哈密顿图的最短路径，从而可以方便的计算出最短路径，获得更大的经济效益-Can achieve any of the shortest Hamiltonian path, which can easily calculate the shortest path to greater economic efficiency
hamiton
- 这个程序主要是应用在图论中来解决哈密顿回路问题 是比较常见的-This procedure is mainly used in graph theory to solve the Hamiltonian circuit problem is more common
algorithm
- 八皇后问题，金币阵列问题，马的哈密顿周游，字典序排列，双色汉诺塔等经典算法的简单解决，尤其适合初学者参考。-Eight Queens problem, gold array of issues, horse Hamiltonian tour, arranged in lexicographic order, color and other classic Tower of Hanoi algorithm is simple to solve, especially for beginners r
1
- 最短哈密尔顿图，穷举法，递归调用， 深度优先查找-The shortest Hamiltonian, brute-force method, the recursive call, depth-first search
Hamiltonian-cycle
- 完全图哈密尔顿圈的遗传模拟退火算法matlab通用源程序-Complete graph Hamiltonian cycle common genetic simulated annealing algorithm matlab source
Hamiltonian-loop
- Hamiltonian loop 哈密顿环路解决图论最短路问题 -Hamiltonian loop