搜索资源列表
用c编写的N*N的螺旋矩阵源代码
- /* 实现效果： 1 2 6 7 15 3 5 8 14 16 4 9 13 17 22 10 12 18 21 23 11 19 20 24 25 */ #include <stdio.h> #define N 5 //阶数，即N*N的螺旋矩阵 void main() { int i, j, num=1, a[N][N]; for(i=0; i<=N/2; i++) &nb
Maze.rar
- 这个下程序是用回溯法解决走迷宫问题。这个程序里面的关于迷宫的数据结构设计比较好，可以借鉴借鉴！,This process is back under the law to resolve the issue Maze. Inside the process of data on the structural design of the maze is better, you can learn from!
problem-of-24-points
- 解决二十四点问题的算法,提供了一个有理数类，通过回溯法解决问题-solve the problem of the 24 points
combination
- 自己编写的用回溯法的组合程序，用的c-ccombination（c++）
huisuofa
- 用回溯法解决算法书中的几个例子，上机调试运行过。-Backtracking algorithm used to solve a few examples of the book, on the machine debug run-off.
nqueen
- 经典的你皇后问题用回溯法实现运行环境vc-Queen
ThreeColorProblem
- 使用回溯法实现的3着色问题,内有详细说明了算法的思想,算法的过程等.VS2005可以打开-Realization of the use of backtracking 3 coloring problem with a detailed descr iption of the algorithm, the algorithm of the process. VS2005 can open
EightQueensProblem
- 八皇后问题，回溯法解决。 这可能是一个简单问题。-Eight queen problem, retroactive law. This is probably a simple question.
shudu
- 求解数独问题, 能精确快速求解数独, 是用回溯法求的.-I not sure how to describe it in English,but It a problem about number magic
Jump_Horse
- 一个回溯法做跳马问题的探究,版权所有,下载后请于24小时内删除-A backtracking to do to explore the question vault, all rights reserved, after the download, please delete within 24 hours
Queue
- 用回溯法实现n皇后问题，c++语言编写，调试通过。包含代码和完整文档说明-By backtracking the question of the realization of n queen, c++ languages, debugging through
01bag
- 用蛮力法，回溯法，分支限界法求解背包问题-With the brute force method, backtracking, branch and bound method for solving knapsack problem
beibaowenti
- 算法实验C++编程用回溯法解决01背包问题-Experimental C++ programming algorithm with backtracking to solve 01 backpack
CommonAlgorithmDesign
- 常用的算法设计方法集合，主要有迭代法、穷举搜索法、递推法、贪婪法、回溯法、分治法、动态规划法-Algorithm commonly used method of collection, mainly iterative, exhaustive search methods, recursion, greedy method, backtracking, divide and conquer, dynamic programming
0_1bag
- 此程序是用回溯法解决01背包问题，可以运行成功，欢迎下载-This program is backtracking to solve 01 knapsack problem, you can run successfully, please download
suanfaqxf
- 算法实验报告+源代码 实验一 1题 归并排序.cpp 11 实验一 2题 快速排序.cpp 12 实验二1题 贪心法求背包问题.cpp 13 实验二2题 贪心法求最短路径.cpp 16 实验三 动态规划求最短路径.cpp 17 实验四 回溯法求背包.cpp 18-Algorithm+ source code for test lab reports a problem for a merge sort. Cpp 11 question tes
最速下降法和牛顿法
- 基于回溯线搜索的最速下降法和牛顿法，配数值算例(Steepest descent method and Newton method based on backtracking line search)
算24点
- 此程序为在MATLAB平台使用回溯法的递归调用形式实现计算24点游戏，输入四个数字，输出计算流程。(counting_24,matlab,alogrithm)
回溯法求解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)
迷宫问题
- 此为回溯法求解迷宫问题的源代码，问题描述如下： 迷宫问题的求解是实验心理学的一个经典问题.，心理学家把一只老鼠从一个无顶盖的大盒子的入口赶进迷宫，迷宫中设置很多壁障，对前进方向形成了多处障碍，心理学家在迷宫的唯一出口放置了奶酪，吸引老鼠在迷宫中寻找通路以到达出口。设计回溯算法实现迷宫求解。(Retrospective method)