搜索资源列表
-
0下载：
问题算法源代码：骑士遍历、万年历、N皇后问题回溯算法、动态计算网络最长最短路线、货郎担分枝限界图形演示、货郎担限界算法、矩阵乘法动态规划、网络最短路径Dijkstra算法-problems algorithm source code : Knight traversal, calendar, N Queens backtracking algorithms, Dynamic computing network longest shortest routes, traveling salesman
-
-
1下载：
N皇后问题回溯算法.c 货郎担分枝限界图形演示.c 矩阵乘法动态规划.c 万年历
动态计算网络最长最短路线.c 货郎担限界算法.c 骑士遍历 网络最短路径Dijkstra算法.c-N queens problem backtracking algorithm. C TSP branch and bound graphical presentation. C matrix multiplication, dynamic programming. C calendar dynamic compu
-
-
0下载：
骑士漫游的改进算法，回溯算法加贪心选择策略，n最大可以到128-Knight improved roaming algorithms, backtracking algorithms greedy selection strategy increases, n the greatest can go to 128
-
-
0下载：
骑士巡游问题:从国际象棋棋盘上任意给定的方格开始移动骑士，相继地到达所有的64个方格，进入每个方格一次且仅进入一次。回溯法实现-Knight Parade problem: the chess board from any given knight box began to move, have to reach all the 64 squares, each square once and only entered into once. Backtracking to achieve
-
-
0下载：
骑士遍历的几种算法
骑士遍历回逆
使用回溯算法求解骑士游历问题-Knight Rider traverse traverse several algorithms using the backtracking algorithm on the reverse problem of knights traveled
-
-
0下载：
VS2008实现的骑士巡游的回溯算法，有解即停止搜索，并输出-VS2008 knight parade achieve backtracking algorithm, which stops searching solvability, and the output
-
-
0下载：
骑士周游问题，用回溯法计算~希望对大家有帮助~-Knights tour problem with backtracking method ~
-
-
0下载：
经典的骑士巡游问题，通过走日子来遍历棋盘，非回溯法，可以有效率的解决8*8棋盘的解决方案，但是不能保证所有问题都是有解的-Classic knight' s tour problem, by taking a day to traverse the board, non-backtracking, can be effective solution 8* 8 board solution, but can not guarantee that all problems are solvab
-
-
0下载：
给定一个N*N的正方形，使用回溯算法求解骑士游历问题-solution to the problem of knight cruising using backtracking method
-
-
0下载：
使用回溯法解决的典型问题的算法：骑士巡游问题，n皇后问题，0-1背包问题。
使用递归与分治策略解决的几个问题的算法：Hanoi塔问题和二分搜索技术。-Use backtracking to solve the typical problems of algorithms: knight tour problem, n queens problem 0-1 knapsack problem. Use recursion and divide and conquer strategy to so
-
-
0下载：
对于骑士走步问题的回溯法实现，具体的问题描述可以上网查询，此处主要给出具体的实现代码，如有不便敬请谅解-For backtracking method to realize the knight move problems, specific problem descr iption can go online inquiry, the main specific implementation code, if there is any inconvenience locations
-
-
0下载：
算法实验矩阵连乘问题，八皇后问题，骑士游历问题，字符串插入“+”，求最大利润的动态规划和回溯算法-Experimental matrix multiplication algorithm even question the eight queens problem, Knight traveled problem, the string is inserted " +" , seeking to maximize profits and backtracking dynamic
-
-
0下载：
通过这个程序，可以获得对回溯算法的基本理解。在 n × n 方格的国际象棋棋盘上，马(也称为骑士Knight)从任意指定的方格出发，以跳马规则(横一步竖两步或横两步竖一步)，周游棋盘的每一个格子，要求每个格子只能跳过一次。-Through this program, you can get a basic understanding of backtracking algorithms. On the chess board n n squares, Ma (also known as Knig
-
