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: 5087 |
Author:陶锐 |
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: 矩阵连乘问题(备忘录法) 效率不错是用回溯法实现的-Matrix even take questions (Memorandum of Law) is a good efficiency of realization of backtracking Platform: |
Size: 1024 |
Author:林双 |
Hits:
Description: 老鼠走迷宫。。。用回溯法求解。。。。矩阵记载迷宫资料-Maze rats. . . Method with backtracking. . . . Recorded in the maze of information matrix. . . . Platform: |
Size: 1024 |
Author:star |
Hits:
Description: 数据结构和算法，非常经典，讲的很详细！第一部分 基础知识
第一章 C++程序设计
第二章 程序性能
第二部分 数据结构
第三章 数据描述
第四章 数组和矩阵
第五章 堆栈
第六章 队列
第七章 跳表和散列
第八章 二叉树和其他树
第九章 优先队列
第十章 竞赛树
第十一章 搜索树
第十二章 图
第三部分 算法设计方法
第十三章 贪婪算法
第十四章 分而治之算法
第十五章 动态规划
第十六章 回溯
第十七章 分支定界-Data structures and algorithms, very classic, talked in great detail! The first part of the basic knowledge of first chapter C++ Program Design Chapter II The second part of the data structure of program performance data described in Chapter III Chapter IV Chapter V array and matrix stack, queue, Chapter VI Chapter VII Chapter VIII of the jump table and the hash Binary trees and other tree priority queue IX Chapter X Chapter XI competition tree search tree diagram the third part of Chapter XII Chapter XIII greedy algorithm design method of divide and conquer algorithms Chapter XIV Chapter XV of the dynamic programming algorithm for 16th Chapter XVII Chapter backtracking branch and bound Platform: |
Size: 17229824 |
Author:孙继磊 |
Hits:
Description: <经典算法合集>其中包括:
最小生成树
MD5加密
LZW压缩
josephus
乘法表
积分
枚举
基数转换
矩阵问题举例
求解质数
圆周率的求法
改进的快速排序法
几种插入排序法
水仙花数
迷宫生成器
生命游戏
递归
回溯
贪心
动态规划
排序算法-" Classical algorithm Collection> These include: minimum spanning tree MD5 encryption LZW compression josephus multiplication table base transformation matrix integral enumeration problem solving prime number example, the rate of Improved Methods of the circumference of the Quick Sort Insertion Sort Narcissistic number of several maze generator recursive Game of Life dynamic programming backtracking greedy sorting algorithm Platform: |
Size: 4215808 |
Author:我很笨 |
Hits:
Description: 用回溯法完成迷宫问题，迷宫大小自己设定，用一个矩阵表示一个迷宫，每个位置上位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, that the way to go, the final output out of the maze not out of the path or the display of information Platform: |
Size: 2048 |
Author:王波 |
Hits:
Description: 各种问题算法，包括，N皇后问题回溯算法，动态计算网络最长最短路线，货郎担界限，矩阵乘法动态规划等-Algorithm for various problems, including, N Queens problem backtracking algorithm, dynamic network of the longest shortest path computation, Traveling Salesman boundaries, such as dynamic programming matrix multiplication Platform: |
Size: 23552 |
Author:赵明臣 |
Hits:
Description: 水人算法，也就是有名的waterman算法，运用回溯法来计算一个二维矩阵的最优路径-Water were algorithm, which is well-known waterman algorithm, using backtracking to calculate the optimal path to a two-dimensional matrix Platform: |
Size: 5955584 |
Author: |
Hits:
Description: 求N皇后问题的一个解，回溯法。在窗体文本框中输入N值，矩阵图显示皇后排布方式-Seek a solution of N-Queens problem, backtracking. In the form text box, enter the values of N, the matrix show the Queen arranged way Platform: |
Size: 36864 |
Author:qindan |
Hits:
Description: 实现手动生成一个n×m矩阵的迷宫，寻找一条从入口点到出口点的通路。迷宫有很多的分岔口，搜索整个迷宫，实际上这是对栈和回溯算法的综合操作。
要实现的主要功能：
（1）创建迷宫，将输入的迷宫数据存储到二维数组中。
（2）显示迷宫，将创建的迷宫以方阵的形式显示出来。
（3）查找路径，分别用非递归算法和递归算法查找迷宫路径。
（4）输出路径，用三元组（i,j,d）的形式输出和方阵的形式输出。
（5）.恢复迷宫，把探索过后的迷宫数据恢复。
-Manually generate a nm matrix maze to find a path from the entry point to the exit point. Maze with a lot of the fork, search the entire maze, which is actually the integrated operation of the stack and backtracking algorithm. To achieve the main functions: (1) create a maze, the input the maze data storage to a two-dimensional array. (2) shows the maze, will create the maze to the square in the form displayed. (3) Find the path, respectively, with a non-recursive algorithm and the recursive algorithm to find the maze path. (4) output path, with a triple (i, j, d) in the form of output and the form of a square of the output. (5). The recovery maze, Discover after the maze data recovery. Platform: |
Size: 81920 |
Author:罗裕君 |
Hits:
Description: 本函数用深度优先遍历（回溯法）来求解迷宫的所有路径
maze:是迷宫矩阵，其中0表示可以去走的路
1表示障碍
2表示入口
3表示出径
5表示路径-Road this function with a depth-first traversal (backtracking) to solve the maze path maze: a maze matrix, where 0 means you can go to go 1 shows the obstacles 2 entrance 3 shows the diameter 5 shows the path Platform: |
Size: 1024 |
Author:冰冰 |
Hits:
Description: 拉丁矩阵问题的回溯解法，《计算机算法设计与分析》习题-The Latin matrix backtracking solution of the problem, the computer algorithm design and analysis exercises Platform: |
Size: 1024 |
Author:隋唐 |
Hits:
Description: 回溯法解决对大团问题。从txt文本中读取矩阵信息，再通过回溯法求解最大团。-Backtracking to solve the Maximum Clique Problem. Read matrix information the text, and then solve the MCP. Platform: |
Size: 2048 |
Author:小白 |
Hits:
Description: 程序采用梯度下降法求解函数最小值，函数系数矩阵分别为50x50和100x100，梯度下降法中，同时采用了精确直线搜索和回溯直线搜索，并比较了两种方法的收敛速度，用图形表示。文件里面有具体问题描述。-Program uses a gradient descent method for solving the minimum, function coefficient matrix are 50x50 and 100x100, gradient descent method, while using the precise linear search linear search and backtracking, and compare the convergence rate of the two methods, using a graphical representation. Documents which have specific description of the problem. Platform: |
Size: 690176 |
Author: |
Hits:
Description: 利用回溯法求解数独
B为数独题目的矩阵形式空的地方应为0(The use of backtracking method to solve Sudoku
The matrix form of B for the Sudoku problem should be 0) Platform: |
Size: 2048 |
Author:lsdragon |
Hits:
Search - backtracking matrix