搜索资源列表
回溯法搜索排列树算法园排列问题
- 回溯法搜索排列树算法园排列问题,算法设计与分析课程，作业题-search with backtracking algorithms park with trees, algorithm design and analysis courses, and that operations
回溯法求迷宫问题
- 回溯法求迷宫问题-back Method Maze
回溯法解皇后问题
- 回溯法求解皇后问题-method Queen's back problems
用回溯法和栈求解迷宫问题
- 用回溯法和栈求解迷宫问题-with retroactive law and stack maze solving problems
回溯法N皇后问题
- 这是计算机算法中的回溯法中的一个经典的问题－－Ｎ皇后问题！希望对学计算机算法的同学有用！-This is a computer algorithm, the retroactive law on the issue of a classic -- N Queen! Want to learn how to use computer algorithms useful to the students!
N皇后问题的回溯法,非递归实现
- 这是N皇后问题的回溯法,非递归实现.此算法对初学者有难度,最好去参考书.这个问题也是回溯法的经典例题,推荐自己去实践.还有,我贴的程序在TC3.0下调试通过.-This the Queen's retroactive law, non - recursive. This algorithm is difficult for beginners, to the best reference books. This issue i
回溯法
- 用回溯法求马周游问题,马在棋盘上走字步,从马开始的位置开始周游棋盘,遍历全棋盘后回到起点,是否可行,可行的就输出路径,路径并输入尝试过的路径数,跳过的路径数-law with retrospective travel for Ma, Ma on the chessboard characters step away from the start position Ma started to travel around the chess
小规模的数据用回溯法求最短路径
- 本程序给出了小规模的数据，运用回溯法求解最优路径，处理垃圾处理问题
回溯法
- 回溯法电子书
字符串全排列
- 用回溯法实现字符串全排列
N后问题（回溯法解决）
- n后问题回溯法解决
回溯法求解八皇后问题
- 回溯法求解八皇后问题
回溯法，实现nqueens
- 回溯法，实现nqueens
回溯法求迷宫问题
- 回溯法求迷宫问题-back Method Maze
回溯法解皇后问题
- 回溯法求解皇后问题-method Queen's back problems
0-1背包的回溯算法
- 回溯法解决0-1背包问题-Backtracking 0-1 knapsack problem solving
回溯法N皇后问题
- 这是计算机算法中的回溯法中的一个经典的问题－－Ｎ皇后问题！希望对学计算机算法的同学有用！-This is a computer algorithm, the retroactive law on the issue of a classic-- N Queen! Want to learn how to use computer algorithms useful to the students!
回溯法
- 用回溯法求马周游问题,马在棋盘上走字步,从马开始的位置开始周游棋盘,遍历全棋盘后回到起点,是否可行,可行的就输出路径,路径并输入尝试过的路径数,跳过的路径数-law with retrospective travel for Ma, Ma on the chessboard characters step away from the start position Ma started to travel around the chess
回溯法搜索排列树算法园排列问题
- 回溯法搜索排列树算法园排列问题,算法设计与分析课程，作业题-search with backtracking algorithms park with trees, algorithm design and analysis courses, and that operations
回溯法求解0-1背包问题
- 文件包括回溯法求解0-1背包问题的C++源程序，包括运行界面(The file includes a backtracking method for the C++ source program for solving 0-1 knapsack problems, including the running interface)