搜索资源列表
用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()
match(man&women)
- 回溯法 解决男女匹配问题 八男八女匹配-Backtracking address gender matching eight men and eight women match
xinchengxu
- 包括GRAY码,工作分配问题,会场安排,石子,行数字三角形,最长递增子序列和最小重量机器算法。利用动态规划、回溯法和贪心法-including GRAY code, work assignment, venue arrangements, gravel, and digital triangle, the longest sequences and increase the minimum weight machine algorith
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
历年试题1
- 软件设计师历年真题,有C语言题目的答案,而且有回溯法,递归等方法-software designers simulated calendar year, the C language is the subject of the answer, but is retroactive law, recursive methods
migong_BySophia
- 程序把迷宫问题设计成一个类,其数据成员有路口个数mazeSize,出口Exit和路口集合*intSec,构造函数读入已存在的数据文件构造描述一个具体问题的迷宫类的对象;其搜索函数TravMaze(int intSecV)的输入参数intSecV为当前所处的路口,搜索函数用回溯法搜索迷宫的所有分支-maze procedure, the design problem into a category of its data members
VBKing
- 这是我的课程设计报告,本来是用VB设计一个界面出来,里面包含多种小游戏的,可惜删了,只剩下一份报告,里面包含了各个小游戏的程序算法代码:回溯法求解皇后问题、冒泡法的算法描述、快速排序法、二叉排序树(这里用C语言描述)、顺序查找算法、二分法查找、二叉排序树查找(这里用C语言描述)-This is my course design, originally designed with VB is an interface, and which
hamilton9901
- 给定一个n个结点的连通图,用回溯法求出图中含有的所有哈密尔顿环。包含实验报告。 -given a n nodes in a graph, with retrospective method, the map contains all the Hamilton Central. The report contains experiments.
PackageProblem
- 实现背包问题 package problem 1. 问题描述 假设有一个能装入总体积为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)。 2. 基本
diamondalthoms
- 回溯法的钻石问题,用c编写,算法设计的问题。 -Backtracking diamond issue, c prepared, algorithm design problems.
bags
- 四种算法(动态规划、回溯法、分支限界法、贪心法)实现0-1背包问题-four algorithms including dynamic planningm,tracing,branch and bound method and greedy to implement 0-1 bag problem.
jingdiansuanfa
- 经典算法+分支限界法+分治法+动态规划+贪心算法+回溯法-Classical branch and bound algorithm+ France+ divide and conquer dynamic programming+++ backtracking greedy algorithm
CommonAlgorithmDesign
- 常用的算法设计方法集合,主要有迭代法、穷举搜索法、递推法、贪婪法、回溯法、分治法、动态规划法-Algorithm commonly used method of collection, mainly iterative, exhaustive search methods, recursion, greedy method, backtracking, divide and conquer, dynamic programming
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 m
MyDaoYou
- 倒油,分油问题,回溯法解决 就是3个桶 12(满),8(空),5(空),怎么倒出1~12-split oil
Traveling
- 利用回溯法实现了旅行售货员的算法,代码为java.-Achieved by backtracking the traveling salesman algorithms.
最速下降法和牛顿法
- 基于回溯线搜索的最速下降法和牛顿法,配数值算例(Steepest descent method and Newton method based on backtracking line search)
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
回溯法
- 利用回溯算法和动态规划函数,编写了资源约束下的二维动态规划算法,可用于资源分配方面的问题(Using backtracking algorithm and dynamic programming function, we write a two-dimensional dynamic programming algorithm under resource constraints, which can be used for resou
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 沪ICP备09016508号
1999-2046 源码中国 All Rights Reserved.