Location:
Search - backtracking
Search list
Description: backtracking linesearch
Platform: |
Size: 266 |
Author: maqitao@sina.cn |
Hits:
Description: 回溯法解决0-1背包问题-Backtracking 0-1 knapsack problem solving
Platform: |
Size: 254976 |
Author: gtop |
Hits:
Description: 一个acm算法题目 问题描述: 有一个黑盒子,可视为一个15×10的二维矩阵,里面有一些空隙,在二维矩阵中用0表示空隙,用1表示被占有。现有一个仪器,可以从4个方向对盒子进行分行透视:从左到右,从左下到右上,从下到上,从右下到左上。透视可得到该二维矩阵的该行1的个数。要求,还原此矩阵。 输入:4行,每一行分别代表从左到右,从左下到右上,从下到上,从右下到左上透视所得的数据 输出:该矩阵 使用的方法是回溯法,具体见程序-a acm algorithm topic Problem description : a black box, as a 15 x 10 two-dimensional matrix, there are some gaps in two-dimensional matrix using 0 indicates the gap, with a show that occupies. An existing equipment, from the direction of four branches box for perspective : from left to right, from the lower left to upper right, from bottom to top, from the lower right to upper left. Perspective availability of the two-dimensional matrix of the line a number. Demand reduction of this matrix. Input : 4 firms on behalf of every line from left to right, from the lower left to upper right, from bottom to top, from the upper left to lower right perspective on data obtained from the output : the matrix method is the use of backtracking, see the specific procedures
Platform: |
Size: 5120 |
Author: 陶锐 |
Hits:
Description: 八皇后VC图形演示,算法思想:回溯法,先在第1行放上一个皇后,然后在第2行合适的位置放上一个皇后,依次类推,如果8行都放满了,说明找到了一个解,如果第好第i行的皇后后,第i+1行找不到合适的位置,这时就回到第i行,把第i行的皇后放到下一个位置,继续尝试下一行。如此反复,知道找到所有的解。注意,这种算法找的解可能有等价的,某些解可由别的解经过旋转棋盘得到。-visual demostration in vc of eight queens problem.
algorithm: backtracking.
First, put a queen on first line then find a suitable position on 2nd line for next queen, and so on. When all eight lines have queens, it means we have find a solution. If we put the i-th queen, but can find a suitable position on the (i+1)th line, then back to the ith line and move the queen on the ith line to next suitable position and move on to the next line. Repeat this until we have found all the solutions. Note:By this mean, some solutions maybe equivalent to others, some can be acquired by the rotation of other solutions.
Platform: |
Size: 52224 |
Author: huwu |
Hits:
Description: 0 / 1背包问题是一个N P-复杂问题,为了解决该问题,,将用回溯算法解决该问题。既然想选择一个对象的子集,将它们装入背包,以便获得的收益最大,则解空间应组织成子集树的形状(如图1 6 - 2所示)。该回溯算法与4 . 2节的装载问题很类似。首先形成一个递归算法,去找到可获得的最大收益。然后,对该算法加以改进,形成代码。改进后的代码可找到获得最大收益时包含在背包中的对象的集合。-0/1 knapsack problem is a P-complex issues, in order to solve the problem, and will be used backtracking algorithm to solve the problem. As to the choice of a subset of object, they will load a backpack, in order to obtain the greatest profits, the solution should be organized into space subset of the shape of the tree (Figure 1 6-2 below). The backtracking algorithms and 4. Two loading problem is very similar. Forming a recursive algorithm to get the maximum benefit available. Then, this algorithm is modified to form code. Improved code can be found at the maximum benefits included in the backpack of a collection of objects.
Platform: |
Size: 8192 |
Author: 周易 |
Hits:
Description: 回溯法搜索排列树算法园排列问题,算法设计与分析课程,作业题-search with backtracking algorithms park with trees, algorithm design and analysis courses, and that operations
Platform: |
Size: 68608 |
Author: 老七 |
Hits:
Description: 是用回朔法实现跳马程序。数据结构入门的好例子-is back Schomburg Method vault procedures. Structure data entry a good example
Platform: |
Size: 179200 |
Author: xiaokwok |
Hits:
Description: 数据结构算法:回溯法编程寻找八皇后问题的所有解,使用语言C/C-algorithm data structure : backtracking programming for the Queen's eight all solutions, the use of language C/C
Platform: |
Size: 6144 |
Author: 王卫国 |
Hits:
Description: 此文章的算法有迭代法、穷举搜索法、递推法、贪婪法、回溯法、分治法、动态规划法等等,有用的的人可以-This article has iteration of the algorithm, exhaustive search method, the recursive method, greedy method, backtracking, sub-rule method, dynamic programming, etc., can be useful
Platform: |
Size: 67584 |
Author: 周健 |
Hits:
Description: 四种算法求最短路径的例子,C#,图形演示
分别为贪心发,动态规划发,分支限界法,和回溯法-Four shortest path algorithm for example, C#, Graphical presentations were greedy fat, fat, dynamic programming, branch and bound method, and backtracking
Platform: |
Size: 24576 |
Author: tp |
Hits:
Description: 这是一个用回溯算法解0--1背包问题的C++程序(好用的)-This is a backtracking algorithm used 0 1 knapsack problem of the C++ Procedure (useful)
Platform: |
Size: 1024 |
Author: chen |
Hits:
Description: 搜索算法——包含回溯法、分枝定界和贪心法-Search algorithm- includes backtracking, branch and bound and the greedy method
Platform: |
Size: 6144 |
Author: chen |
Hits:
Description: 这是一个用c++实现的n后问题,利用回溯法,并以深度优先搜索的方法,进行求解,程序中由用户输入n值确定是几后问题,打出所有的解。-This is a used c++ Achieved after n problem, the use of backtracking, and depth-first search method to solve process n value is entered by the user to determine several issues, making all solutions.
Platform: |
Size: 212992 |
Author: liu fei |
Hits:
Description: 图着色问题的回溯算法,图着色问题是一个NP-完全问题.-Graph Coloring Problem of backtracking algorithms, graph coloring problem is an NP-complete problem.
Platform: |
Size: 1024 |
Author: 张金水 |
Hits:
Description: 回溯演算的应用。用回溯演算求数独解。
可以用来解数独或
对回溯演算有初步了解的人可以当范例看-Retroactive application of calculus. Calculus with backtracking for Sudoku solutions. Skills can be used alone or to have a preliminary understanding of backtracking algorithms can watch when the sample
Platform: |
Size: 38912 |
Author: lin |
Hits:
Description: 使用回溯法求解TSP问题,使用VC++编写。代码量挺少,不过数据较大的时候需要时间比较长,时间复杂度为O(n!)-Use backtracking to solve TSP problems, the use of VC++ Prepared. Code volume quite low, but when the need for greater data a longer period of time complexity is O (n!)
Platform: |
Size: 5120 |
Author: 太阳 |
Hits:
Description: 数据结构算法 分治算法、贪心算法、动态规划法、回溯法、分治定界法-Data structure algorithm sub-rule algorithm, greedy algorithms, dynamic programming, backtracking, sub-rule-bound method
Platform: |
Size: 2419712 |
Author: 杨钦龙 |
Hits:
Description: 马跳棋盘的回溯法程序,基于mfc,有可视化界面,可以演示程序的运行过程-Horse jumping board of backtracking procedure, based on the mfc, has visualization interface, can run the course of the demo program
Platform: |
Size: 2074624 |
Author: siwei |
Hits:
Description: 这是求解VRP和TSP相关问题的回溯算法,基于C语言环境-This is a VRP and TSP solving issues related to backtracking algorithm, based on C language environment
Platform: |
Size: 57344 |
Author: naiyu |
Hits:
Description: This is a sample code for Backtracking algorithm.
This code is for set partitioning problem.
Platform: |
Size: 1024 |
Author: tito |
Hits:
« 12
3
4
5
6
7
8
9
10
...
41
»