搜索资源列表
Queen
- 这是一个关于八皇后问题用回溯法求解的java解法！-This is the one on the eight queens problem using backtracking method for solving the java solution!
mataqipan
- 利用回溯法+贪心算法实现马踏棋盘功能。具体描述：有一M*N的棋盘，输入马所在的起始位置，输出马走过的全部路径。（马走过棋盘上每一个点）-The use of backtracking greedy algorithm+ horse riding board features. Specific descr iption: There is an M* N chessboard, enter the horse where the starting position, the output of
back
- 本程序给出回溯法的具体实现过程，可以帮助读者较好的了解回溯的思想-This program gives concrete realization of the process of backtracking, you can help readers better understand the idea back
BackTrack_01backpack
- 0-1背包问题是一个经典的算法问题，有多种解法，这里用回溯法求解。-0-1 knapsack problem is a classical algorithm for the problem, there are several solution here solved by backtracking.
NQueens
- 经典的N皇后问题的实现，使用的算法是回溯法-Classic implementation of N-Queens problem, using the algorithm is backtracking
Computeralgorithmsr
- 计算机算法_贪婪算法 计算机算法（贪心算法，遍历搜索，递归，回溯法，分治法，分枝定界) 关于这方面的介绍-计算机算法_贪婪算
0-1hui
- 0-1背包问题 关于回溯法的背包问题 回溯法在求问题的所有解时, 要回溯到根结点, 且根结点的所有子树都已被搜索过才结束。-0-1 背包问题
maze
- 用回溯法实现一个可以是若干大的迷宫的自动寻线走同-maze
Queen
- Queen，用回溯法递归方法实现n皇后问题-Queen, with backtracking recursive method to achieve n queens problem
TSPBack_Tracking
- 采用算法设计的基本方法--回溯法解决城市推销员问题-Algorithm design using the basic method- backtracking to City Salesman Problem
KnapsackBTDP
- C#实现动态规划法和回溯法解决01背包问题-C# dynamic programming and backtracking to solve knapsack problem 01
eightqueen
- 八皇后问题 回溯法 每个皇后的横 竖 斜方向不能有其他皇后-Eight queens problem backtracking oblique horizontal and vertical direction of each queen can not have other Queen
Queen8
- 八皇后~8*8的棋盘，确定皇后的位置，用的是回溯法，过程很详细-eight Queens~
AlgorithmCode
- C++版本的各类算法源代码，包括动态规划法、分治法、贪心法、回溯法、分支限界法、概率算法-C++ source code version of the various algorithms, including dynamic programming, divide and conquer, greedy method, backtracking, branch and bound method, probability algorithm
migong
- 用回溯法完成迷宫问题，迷宫大小自己设定，用一个矩阵表示一个迷宫，每个位置上位1或者0，如果为0，表示此路不通，为1，表示此路可以走，最后输出走出迷宫的路径或者显示不能走出的信息-Maze problem using backtracking to complete, the size of their maze set, a maze with a matrix, each position of the upper 1 or 0, if 0, that being the case, to 1
TSP
- 回溯法解决TSP问题，对于任何的无向图，只要存在回路均可找到，无回路也可检测出来！-Backtracking to solve TSP problem, for any undirected graph, loop as long as there can be found, no loop can be detected!
loading
- 装载问题 运用回溯法 解决双船的装载问题-Loading problems backtracking
zhuosetu
- 本程序的功能是对图的着色，该算法主要是基于迭代回溯法，输出多种着色方案；若有n种颜色就输出n种着色方案。本程序有注释，通俗易懂。-The functionality of the program is the graphs, the algorithm is mainly based on iterative backtracking, the output multi-color scheme if n different colors on the output of n kinds of
DesignMataboard
- 算法分析与设计 马踏棋盘的一般回溯法（要求马回到最开始的出发点）.-Algorithm Analysis and Design of horse riding board' s general backtracking (required horse back to the starting point).
pailietree
- 采用vc++6.0编程软件用回溯法解决排列树问题