搜索资源列表
用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
Text3
- 利用C语言中的回溯法对图案的着色问题进行解决并检查颜色可用性生成邻接矩阵-use of the C language law back to the logo coloring problem solving and check availability of generating color adjacency matrix
040320133
- 罗密欧与朱丽叶的迷宫问题 利用回溯法搜索出一条路经，帮助罗密欧走遍所有房间到达朱丽叶的房间-Romeo and Juliet maze of back problems using a way to search by law to help Romeo traveled all the rooms reach Juliet rooms
回溯法搜索排列树算法园排列问题
- 回溯法搜索排列树算法园排列问题,算法设计与分析课程，作业题-search with backtracking algorithms park with trees, algorithm design and analysis courses, and that operations
回溯法求解八皇后问题
- 回溯法求解八皇后问题
采用回溯法编写的骑士周游
- 这是一个采用C++编写的、采用回溯法编写的骑士周游（马周游）遍历棋盘（8*8）的程序。本软件采用MFC编写，用户可看到骑士动态遍历棋盘的过程。-This is a written in C++ using backtracking written knight tour (horse travel) through the board (8* 8) program. The software is written using MFC, you can see the board through
map4
- 用回溯法解决四色图问题，内有实验报告，源代码，以及程序说明的文件 和可执行的exe文件-err
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
使用回溯法实现骑士遍历
- 使用回溯法实现骑士遍历 内有相关文档和测试-Knight traversal
最速下降法和牛顿法
- 基于回溯线搜索的最速下降法和牛顿法，配数值算例(Steepest descent method and Newton method based on backtracking line search)
最大数乘积
- 一个大数，通过添加断点可以将其分为若干个小数，而这几个小数的乘积最大是多少呢？本程序可以通过回溯法求解这个最大数乘积。(A large number, by adding breakpoints can be divided into a number of decimal and decimal the largest product is how much? This procedure can be the product of the maximum number of backtrac
算法设计——旅行售货员
- 某售货员要到若干城市去推销商品，已知个城市之间的路程或路费，我要选定一条从驻地出发，经过每个城市一次，最后回到驻地的路线，使总的路程（或路费）最小。（回溯法）(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,
算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)