搜索资源列表
bBplusDotNet
- B树,源代码,根据B树的算法原理,可生成相应的B树文件。内有完整的生成工程算法和测试工程,并且全部测试通过。-B tree, the source code, according to B tree algorithm principle, can generate the corresponding B-tree file. There are a full generation of engineering algorithms and test engineering, and all t
dts
- 数据结构算法,动态树。ACM比赛备战资料,详细解释了动态树的原理和采用案例的方式进行讲解。-Data structure algorithms, dynamic trees. ACM contest preparation information, explained in detail the principles and use of dynamic tree approach to explain the case.
desk
- 设计SIMPLE语言的词法分析器,编译原理的实验。-SIMPLE language, lexical analyzer design, compile principle experiment.
geneticalgorithms
- 讲述了有关遗传算法的数学原理及其相关应用-Described the mathematical theory of genetic algorithms and related applications
duichenlianbiao
- 利用异或原理制作的对称链表,有对称链表的基本功能和简单操作-Produced by the use of different symmetry or principle of the list, there are symmetrical list of basic functions and simple operation
ADC
- 介绍XC164CM单片机的ADC工作原理以及DAVed的配置方法和KEIL的编程实例-Introduction XC164CM MCU ADC works and DAVed configuration methods and programming examples KEIL
tidu3
- 基于MATLAB的最优控制原理的最优步长发梯度计算-MATLAB-based optimal control theory calculation of the optimal step gradient hair
datastructureCAI
- 数据结构课件,包含完整PPT,共8个章节,完整介绍数据结构的原理-Courseware data structure that contains the full PPT, a total of eight chapters, the principle of complete data structure introduced
lainggezifuchuandelianjie
- 两个字符串的链接,我们首先应该了解两个字符串在计算机的表示原理-Link the two strings, we should first understand that the two string theory in computer
huffman
- 根据哈夫曼树的原理,实现哈夫曼压缩和解压缩-Huffman tree according to the principles of realization of Huffman compression and decompression
Operatorprecedencegrammar
- 编译原理算符优先文法,判断输入的字符串是不是算符优先文法-Principles of operator precedence grammar compiler to determine the input string is not operator precedence grammar
14
- 图的最小生成树的原理和算法实现,图的最短路径的原理和算法实现 -Minimum spanning tree graph theory and algorithms, graph theory and the shortest path algorithm
12
- 掌握堆的定义、存储结构及原理 2、掌握堆的运算 3、掌握哈夫曼树的定义 4、掌握构造哈夫曼树的方法 -Grasp the definition of the heap, storage structure and principle of two, master of the heap operations 3, 4 to grasp the definition of Huffman, Huffman tree construction methods of control
5
- 1、理解递归运算中栈的应用原理和变化情况 2、掌握递归算法实现 -1, understanding the application of recursive operations in the stack principle and changes in two master recursive algorithm
2
- 1、掌握结构型数据的实际应用原理 2、掌握顺序存储的线性表的操作实现的实际应用 -1, grasp the practical application of structured data in principle 2, in order to master the operation of linear list stored in the actual application to achieve
A
- 这篇文章并不试图对这个话题作权威的陈述。取而代之的是,它只是描述算法的原理,使你可以在进一步的阅读中理解其他相关的资料。 最后,这篇文章没有程序细节。你尽可以用任意的计算机程序语言实现它。如你所愿,我在文章的末尾包含了一个指向例子程序的链接。 压缩包包括C++和Blitz Basic两个语言的版本,如果你只是想看看它的运行效果,里面还包含了可执行文件。 -This article does not attempt to be authoritative on the subject
biaodashi
- 本课程设计是为了实现表达式的求解,其中主要用到了栈的原理,通过它可以更好地去掌握栈的使用-This course is designed to achieve expression of the solution, the main principle used in the stack, through which better to control the use of the stack
dp
- 动态规划经典问题(1)问题中的状态必须满足最优化原理; (2)问题中的状态必须满足无后效性。 -dp
Astart
- A*算法资料,包括算法原理,算法剖析,伪代码,还有一些研究文献。 图像处理方面涉及全局最优最短路径会相当有用-A* algorithm information, including algorithm theory, algorithm analysis, pseudo code, and some literature. Image processing involves the global optimal shortest path will be very useful for
1(2)
- 分支限界法之布线问题 一、要求: 1、输入电路板区域n*m以及布线的起始位置和结束位置; 2、输出布线方案; 3、可以使用c或者vc实现 二、问题分析及实验原理: 在n*m的方格阵列中存在封锁区域(布线时必须绕开的区域),找到起始位置到目标位置的最短路径。从目标位置开始向起始位置回溯,逐步构造最优解。每次向标记距离比当前方格标记距离少1的相邻方格移动,直到到达起始方格为止。-Branch and bound method of a wiring