搜索资源列表
CheB
- 棋盘覆盖问题演示程序，图形界面，VC6.0开发-chessboard coverage Demonstration Program, graphics interface, VC6.0 development. .
chest
- java编写的可调节棋盘大小的残缺棋盘覆盖演示程序-prepared by the board may adjust the size of incomplete coverage chessboard Demonstration Program
qipanfugaiwenti
- 棋盘覆盖问题：在一个2的k次幂乘以2的k次幂个方格组成的棋盘中，恰有一个方格与其他方格不同，称该方格为一特殊方格，且称该棋盘为一特殊棋盘。在棋盘覆盖问题中，用四种不同形态的L型骨牌覆盖给定的特殊棋盘上除特殊方格以外的所有方格。 -chessboard coverage : two in a k-th power of 2 multiplied by the k-th power grid consisting of a chessboard, and a box with the other
kris_qsort_exe
- This forced me to write about more interesting and comprehensive sorting methods, the result of which is this one. Through this writing I have tried to give in-depth coverage of the entire sort algorithm I hope Peter wouldn t mind reading it. This ar
ChessBoard
- 用4种不同形态的L型骨牌覆盖一个给定的特殊棋盘上除特殊方格以外的所有方格，且任何2个L型骨牌不得重又能叠覆盖。-In four different forms of L-type domino covering a given special special squares on the board in addition to all other boxes, and any two L-shaped dominoes can not be re-stacked coverage.
cove
- 最大覆盖问题:给定n 个整数n a , a , ,a 1 2 组成的序列，试设计一个O(n)时间算法，计算其最大覆盖 区间长度。-Maximum cover problem: Given n integers na, a,, a 1 2 composed of a sequence and try to design an O (n) time algorithm to calculate the maximum length of coverage ran
greed
- 贪婪算法合集,包括二分覆盖,单源最短路径,拓扑排序,机器调度问题-Greedy algorithm Collection, including two sub-coverage, single-source shortest path, topological sort, machine scheduling problem
ListOper
- 用户信息的增加、修改、删除、查询等功能，通过链表和MFC实现，通过文本文件存储，全面覆盖了数据结构中的链表操作和MFC的开发，以及文本的读写操作，对于学习很有帮助。-The increase in user information, modify, delete, query and other functions, through the list and the MFC implementation, through a text file storage, comprehensive co
ChessBoard
- 经典的棋盘覆盖程序，实现MFC界面，用分治法实现-Coverage of the classic board procedures, the realization of MFC interface, with sub-rule method
Cover_board
- 棋盘覆盖问题,,算法中分治法的一个好例子，代码不到100行啊-Chessboard coverage, distributed algorithm for treatment of a good example of the code less than 100 lines ah
20090224171138551
- 主要内容： 匹配的概念 二分图的定义和判定 二分图的最大匹配 二分图的最小覆盖问题 二分图的最佳匹配问题 -Main elements: the concept of matching the definition of bipartite graph and determine the maximum bipartite graph matching bipartite graph of minimum coverage of bipartite graph match
memery_copy
- 将内存中的一段数据拷贝到另外一段内存中，要考虑其中的内存覆盖问题。-A section of the memory to copy data to another section of memory, it is necessary to take into account the memory coverage problems.
robot
- 移动机器人全覆盖路径规划优化方法。从全局优化的角度出发，提出一种基于区域分割的环境建模方法-Full coverage of mobile robot path planning optimization method. From the global optimization point of view, presents a region-based segmentation of environmental modeling
nuaa1507_DancingLink_trackback.cpp
- 高德纳发明的高效数据结构dancing link，这里是解重复覆盖问题的一个演示-Donald Knuth invented efficient data structure dancing link, here is the solution to repeat coverage of a demonstration
fenzhi_src
- 棋盘覆盖问题 设一个n*n棋盘，n=2k,用L 型条块覆盖棋盘中除一个指定方格外的所有方格，每个L型条块可恰好覆盖3 个方格。 实验内容：设计分治算法实现棋盘覆盖,要求图形化。-Board covering the establishment of a n* n chessboard, n = 2k, with the L-slice coverage for a specified board, in addition to all the extra square grid, eac
chessboard
- 用C++语言实现棋盘覆盖分治算法 在一个2k×2k 个方格组成的棋盘中，恰有一个方格与其它方格不同，称该方格为一特殊方格，且称该棋盘为一特殊棋盘。在棋盘覆盖问题中，要用4种不同形态的L型骨牌覆盖给定的特殊棋盘上除特殊方格以外的所有方格-C++ language with the board divided coverage of a 2k × 2k Algorithm in the composition of the board of squares, just a different box
4.5
- 使用modified Roboson 完全遍历一棵树并且输出每次遍历当前结点往后的路径，以及这些路径的孩子，其实这个程序功能远不如此-Complete Coverage using modified Roboson output of each iteration, a tree and the subsequent path of the current node, and the children of these paths, in fact, so far the program fea
1
- 在一个由M*N个小正方形组成的矩形上，依次用两个相等的小正方形大小的矩形（此处所谓相邻是指两个正方形有一条公共边）不重复的覆盖该矩形区域。请构造出该问题的模型，设计算法求解所有可能的覆盖。-In a M* N small squares on the rectangle, followed by two small squares of equal size of the rectangle (here is the so-called two adjacent squares have a c
stack
- 栈的应用表达式的运用，C语言实现，数据结构课程设计报告，覆盖率报告-The application of the use of the expression stack, C language, data structure curriculum design, coverage report
Chessboard-coverage
- 在一个2k x 2k ( 即：2^k x 2^k )个方格组成的棋盘中，恰有一个方格与其他方格不同，称该方格为一特殊方格，且称该棋盘为一特殊棋在棋盘覆盖问题中，要用4种不同形态的L型骨牌覆盖给定的特殊棋盘上除特殊方格以外的所有方格，且任何2个L型骨牌不得重叠覆盖。-Chessboard coverage