搜索资源列表
nq.rar
- 求N皇后问题回溯算法
“八皇后”动态图形的VC实现
- 八皇后问题是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法-eight Queen's problem is an ancient and well-known problems, backtracking algorithm is a typical example.18508X8
C语言实现的皇后问题
- n皇后问题，可以显示所有的合适路径，典型的回溯算法-n Queen's, will show you all the appropriate path, the typical backtracking algorithm
骑士巡游
- 本程序是著名的骑士巡游问题,利用了最小度优先和回溯算法,-this procedure is the famous parade Cleveland, the use of the least priority and backtracking algorithms,
回溯法搜索排列树算法园排列问题
- 回溯法搜索排列树算法园排列问题,算法设计与分析课程，作业题-search with backtracking algorithms park with trees, algorithm design and analysis courses, and that operations
Estimate
- 理解并掌握分析回溯算法效率的方法。 使用Estimate算法就8皇后问题给出效率估算 -understanding and mastery of backtracking algorithm efficiency analysis method. Use Estimate on 8 Queen's algorithm is efficient estimation problem
short1
- 求最短路径的问题，用了回溯算法，内附说明 及调试 -seek the shortest path problem with the back algorithm, containing descr iptions and Debugging
feedback_loading
- 回溯算法的应用，经典的装载问题，程序通过答辩，好用！-retroactive application of the algorithm, classic loading issues, procedures adopted by the respondent and ease of use!
bbwt
- 自己随便写的 大家看看 最好有人帮我写个回溯算法0-1背包问题的演示软件 -own writing any of us look at the best people to help me write a backtracking algorithm 0-1 knapsack problem of presentation software
BAHUANGH
- 八皇后是用回溯算法实现的-eight Queen's algorithm is used to achieve the back
实用的算法
- C++Example实用的算法:包括枚举，递归，回溯，矩阵运算等-C Example practical algorithm include : Enumeration, recursive, back, matrix operations, etc.
FindSuperwayFunction
- 本程序利用数据结构中的回溯算法的非递归对以知地图进行全路线查找，可以完成最短路线，最少费用，和所有路线的显示-procedures for the use of the data structure of the back - recursive algorithm right to know what the road map for the entire search, the shortest route to be completed, at least cost, and all th
aglorithm
- 问题算法源代码：骑士遍历、万年历、N皇后问题回溯算法、动态计算网络最长最短路线、货郎担分枝限界图形演示、货郎担限界算法、矩阵乘法动态规划、网络最短路径Dijkstra算法-problems algorithm source code : Knight traversal, calendar, N Queens backtracking algorithms, Dynamic computing network longest shortest routes, traveling salesman
My8Queen
- 八皇后问题：用回溯算法做的 -8 Queens : The backtracking algorithm
10868117
- 采用回溯算法对零件切割问题进行解决,内包含测试数据及详细问题描述和算法描述,()
常用问题的算法
- 常用问题的算法，包括表达式求值，递归二分查找，归并算法，回溯法求解数独问题等(The commonly used algorithms, including recursive expression evaluation, two search, merging algorithm, backtracking and Sudoku problem etc.)
算法设计——旅行售货员
- 某售货员要到若干城市去推销商品，已知个城市之间的路程或路费，我要选定一条从驻地出发，经过每个城市一次，最后回到驻地的路线，使总的路程（或路费）最小。（回溯法）(A salesperson will sell products to several cities. The distance or distance between the known cities will be chosen. I will choose a route that starts from the station,
Queen
- 用java语言，基于回溯法实现N皇后的位置放置方案，程序可以通过参数来设置要解决几个皇后的放置，默认是4个。(Using java language, backtracking method is used to implement the placement plan of N queens. The program can be set by parameters to solve the placement of several queens, and the default is 4.)
回溯法（01背包问题）
- 回溯法解决01背包问题，111111111111111111(Backtracking method for solving 01 knapsack problems)
迷宫问题
- 此为回溯法求解迷宫问题的源代码，问题描述如下： 迷宫问题的求解是实验心理学的一个经典问题.，心理学家把一只老鼠从一个无顶盖的大盒子的入口赶进迷宫，迷宫中设置很多壁障，对前进方向形成了多处障碍，心理学家在迷宫的唯一出口放置了奶酪，吸引老鼠在迷宫中寻找通路以到达出口。设计回溯算法实现迷宫求解。(Retrospective method)