搜索资源列表
fyzd
- 回溯法计算总费用最小费用，回溯法计算总费用最小费用-回溯法计算总费用最小费用
6
- 有关回溯法的课件，很详细，很强大，很好的学习资料，献给大家了！-Courseware on backtracking, very detailed, very powerful, very good learning materials, dedicated to all of you!
004
- 用蛮力法和回溯法求解子集和数问题，大家可以参考借鉴一下-Use brute force method and backtracking to solve a subset of several issues, we can look for references
thedesignofalogrithm
- 该资料介绍了8中算法用于解决一些TSP，背包问题，有分治法，回溯法，等-This document describes the algorithm used to solve some 8 TSP, knapsack problem, partakers treatment method, backtracking, etc.
sportsman
- 用回溯法求解最佳运动员问题，仅供新手学习使用，高手勿进！-Best Athletes by backtracking to solve the problem, only for beginners learning to use, experts do not enter!
Queens.cpp
- 采用LasVegas算法解决N皇后问题,设置了stepVeags，即前stepVeags步采用随机算法放置皇后，剩下的采用回溯法放置皇后-solve the N Queens problem using LasVegas
queen
- java 皇后问题 回溯法实现 带图形界面实现-java queens backtracking with a graphical interface implementation to achieve
beibao
- 假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品，能否从n件物品中挑选若干件恰好装满背包，即使w1 +w2 + … + wn=T，要求找出所有满足上述条件的解。例如：当T=10，各件物品的体积{1，8，4，3，5，2}时，可找到下列4组解：（1，4，3，2） （1，4，5） （8，2） （3，5，2）。 提示：可利用回溯法的设计思想来解决背包问题。首先将物品排成一列，然后顺序选取物品装入背包，假设已选取了前i 件物品之后背包还没有装满，则继
XHstudent
- 1.对多个链表进行操作 2.回溯法求解0/1背包 3.分枝限界法求解0/1背包 4.回溯法求解n—皇后问题 5.图的操作（邻接表表示）-1. Operate on multiple lists 2. Backtracking method for solving 0/1 knapsack 3. Branch and bound method for solving 0/1 knapsack 4. Backtracking to solve n-queens pr
huisu01beibaorar
- 算法分析中以回溯法实现的01背包问题，附有完整的运行说明-Backtracking algorithm analysis in order to achieve the 01 knapsack problem, with complete operating instructions
maze
- TQ2440嵌入式开发板的回溯法迷宫实现(Qt/Embedded)-TQ2440 s Embedded Maze Write By Qt/Embedded
hamilton421
- 用回溯法求解哈密尔顿回路的课程设计，含有源代码，课程设计说明书文本。非常难得！-Hamilton method with back loop course design, with source code, course design specification text. Very rare!
a
- 回溯法 马周游问题的解决 为回溯法的应用提供典型例证。-Backtracking.Use to solve horserolling
0_1Knasack
- 比较了求解0-1背包问题常用的几种算法，并用回溯法和分支限界法进行了Java编程实现，给出了文档及源码。-0-1 knapsack problem compared several commonly used algorithms, and use backtracking and branch and bound method of the Java programming, given the documentation and source code.
8queens
- 8皇后问题，其中前四个是随机输出，后四个采用回溯法，并输出计算所耗时间。-8 queens problem, which is a random output of the first four, the last four by backtracking, and output calculation of the time-consuming.
Algorithm
- 数据结构，算法，包括动态规划、分治策略、回溯法。-Data structures, algorithms, including dynamic programming, divide and conquer, backtracking.
Backtracking
- 回溯法解决背包问题。经典背包问题的回溯法C语言实现。-Backtracking to solve knapsack problem. Classical knapsack problem backtracking C language.
Queen
- N皇后问题,hopfield,回溯法，人工智能-N-Queen hopfield，huisu
Knight-Parade
- 骑士巡游问题:从国际象棋棋盘上任意给定的方格开始移动骑士，相继地到达所有的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
N_queens
- 求解N皇后问题：把N个皇后放在一个棋盘上，每行和每列只能有一个皇后。另外，一个皇后只能在任一行、列或对角线上。要求皇后数≥100。用了两种方法，回溯法和启发式修补法。-Solve N Queen' s problem: N queens on a chessboard, each row and each column can have only one Queen. Further, only in a queen in any row, column, or diagonal. Que