搜索资源列表
squee
- c++ n皇后问题的原代码,通过建立一个树形结构,用c++实现,-quee question
queens
- 包含两个文件,一个是n皇后问题的动态搜索演示,一个是程序包,里面有n皇后问题的各种优化解法,对掌握数据结构与算法都很有好处-Consists of two documents, a problem is the dynamics of n Queen' s english presentation, a package, there are a variety of questions n Queen optimization method, the master data structu
n_queen
- 传统有8皇后的经典算法,这是修改后的n皇后-about n-queen
NQueenProblem
- 这是一个自己实现的N皇后问题c++解法,请各位指教-This is an own implementation of the N Queens problem c++ solution
queen_n
- 解决N皇后问题的源码及可运行程序,分析各种情况,并输出,直观,有效!-Solve the N Queens problem can be the source and run the program, analyze, and output, intuitive, and effective!
C_Program_Daquan
- 用c实现数据结构、Winsock2编程、鼠标编程、asm嵌入式编程、汉诺塔问题、效验算法、N皇后问题回溯算法、骑士遍历、文件加密、万年历的算法,很好很强大-Data structure using c implementation, Winsock2 programming, mouse programming, asm embedded programming, Tower of Hanoi problem, well-tested algorithm, N Queen' s probl
Nquenes
- N皇后问题的递归实现,仅仅只用于C++,JAVA无法执行-N Queen' s problem of the realization of the recursive, just only for C++, JAVA can not perform
Queenquestion
- N皇后问题 主要是运用递归来做的一个算法-the question of the queen
Nhuanghoujianzhi
- N皇后剪枝算法 关键字 回溯,剪枝 ,上界,下界,分支限界-N Queen pruning algorithm for keyword back, pruning, upper bound, lower bound, branch and bound
3
- C语言版,C/C++开发环境均可用,如VC。可学习借鉴 问题算法 骑士遍历 万年历,N皇后问题回溯算法.c 货郎担限界算法.c-C language, C/C++ development environment can be used, such as VC. Algorithm can learn from the question of ergodicity calendar Knight, N Queen' s problem backward algorithm.
DataStruct
- 此文件夹中共包括十二个小程序 AVL创建平衡二叉树,通过加入一个个的结点创建,并实现了平衡二叉树中的结点删除 Boyer_Moore算法的串模式匹配 Horspool算法的串模式匹配 Graph实现了有向图的非递归广度优先遍历及非递归深度优先遍历 HeapSort利用堆排序实现优先级队列 Merge实现二路归并排序算法 MFK动态规划解背包问题 nqueue求解n皇后问题 QuickSort快速排序算法的实现。 Shell排序算法的实现。 Tree程序
nhou
- 编写程序对N皇后问题进行求解:在8行8列的棋盘上放置N个皇后,使任一个皇后都不能吃掉其他的(N-1)个皇后(注:皇后可吃掉与她处于同行或同列或同一对角线上的其他棋子),并将结果以某种方式显示出来-After the issue of N
DancingLinks
- 在计算机科学,舞蹈链接,也被称为的DLx ,是技术建议唐纳德克努特有效地执行其算法十算法X是递归,随意性,深度优先,回溯算法,认为所有的解决方案的确切覆盖问题。一些较为著名的确切涵盖的问题包括瓦工,n皇后问题,数独。-In computer science, Dancing Links, also known as DLX, is the technique suggested by Donald Knuth to efficiently implement his Algorithm X. A
Queue
- 用回溯法实现n皇后问题,c++语言编写,调试通过。包含代码和完整文档说明-By backtracking the question of the realization of n queen, c++ languages, debugging through
yuandaima
- 一般背包问题的贪心算法 Dijkstra算法求解单源最短路径问题 N皇后问题 Prim算法 Kruskal算法代码-The general knapsack problem greedy algorithm Dijkstra' s algorithm for single-source shortest path algorithm N Queen' s problem Kruskal Algorithm Prim code
Cpp1
- N皇后问题求解,根据不同的N值得出不同的求解结果-N Queen' s problem solving, based on different N should be the result of different solution
sschubu
- 搜索初步介绍,包括深度搜索和广大搜索,有n皇后代码及其他题目代码。-The initial search, including the majority of the depth of search and search, there are n Queen' s source code and other topics.
Algorithm
- c写的,有骑士遍历,n皇后,最短路径,动态计算网络最长,最短路径等-c write, with Knight traversal, n Queen s, the shortest path, dynamic calculation of the network the longest, shortest path, etc.
Knapsacks
- 0/1背包,N皇后求解 0/1背包,N皇后求解
myQueen
- 解决算法分析和设计中的n皇后问题,并动态显示查找皇后放置位置的过程-Analysis and design of algorithms to solve the n Queen and Queen' s dynamic display to find the location of the process of placing