文件名称: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 the number. Time complexity O (n* m* 3 ^ n) far below the search.
时间复杂度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 the number. Time complexity O (n* m* 3 ^ n) far below the search.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
小胖邮递员.pas
本网站为编程资源及源代码搜集、介绍的搜索网站，版权归原作者所有！ 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.