搜索资源列表
Topology
- 1用邻接表作为图的存储结构; 2用非递归的方法实现拓扑排序;-A map with the adjacency table as the storage structure two ways to achieve a non-recursive topological sorting
erchashu
- 实现二叉树的非递归先序、中序、后序以及层序的遍历-Implementation of the computer science first order, in order, after the traversal sequence and the sequence
Cpp1
- 实现二叉树的创建以及对其进行非递归前序遍历,路径输出等功能-To achieve the creation of a binary tree and its non-recursive preorder traversal of the path output function
algorithm
- DES算法 DSA算法 ElGamal算法 Kohonen的SOFM(自组织特征映射) LAM(线性联想记忆)算法 LZW 压缩算法 MD5算法 PGP的安全性(一) PKCS #7 RSA算法 SSL是怎样工作的? Ternary Search Trees 产生组合的非递归算法 大整数的乘法 对LZW算法的改进及其在图象无损压缩中的应用 复数快速傅立叶变换算法 加密算法与密钥管理 经典加密算法在VB中的实现(1)- Rsa
search
- 非递归前中后序遍历,还有分析,十分完整,请多多支持和发表意见-Non-recursive traversal sequence before, during and after, there are analysis, very complete, lots of support and comments please
my_horse
- 马踏棋盘程序 将马随机放在国际象棋的8*8棋盘Board[8][8]的某个放格中,马按走棋规则进行移动。要求每个方格只进入一次,走遍棋盘上全部64格方格。编制非递归程序,求出马的行走路线,并按求出的行走路线,将数字1,2,…….64依次填入一个8*8的方阵,输出之。-我自己写的马踏棋盘程序,算法效率高 将马随机放在国际象棋的8*8棋盘Board[8][8]的某个放格中,马按走棋规则进行移动。要求每个方格只进入一次,走遍棋盘上全部64格方格。编制非递归程序,求出马的行走路线,并按求出的行走
lab2
- 利用广义表建立的二叉树,将碱基作为他的节点,实现了以树形输出,并且交换了左右子树,利用非递归中序遍历和先序遍历。-The establishment of the binary tree using the generalized form, the base node as he realized to the output tree, and the exchange of left and right sub-tree in the use of non-recursive travers
Tree
- 一个有关二叉树的小程序,对二叉树的学习有用。利用非递归实现二叉树先序中序的遍历算法,程序中利用递归和交换函数实现了交换左右子树。-The binary tree is a small program useful for the study of the binary tree. Using the first order non-recursive binary tree traversal algorithm in the order the program and exchange the
programme
- 3 × 3矩阵逆矩阵求法,等 非递归版本的快速排序算法。 这个例子排序20浮点数,改编[]。-Matrix inversion for 3x3 floating point matrix Non-recursive version of quick sort algorithm. */ /* This example sorts 20 floating point numbers, arr[].
BinaryTree
- 二叉树的建立,非递归前中后序遍历,判断二叉树的相似,实现二叉树中左右子树的交换-The establishment of a binary tree, taken in the order of non-recursive traversal of binary tree similar to the judge, to achieve a binary tree in the exchange of left and right subtree
200810139184657676
- 将马随机放在国际象棋的8×8棋盘Board[0~7][0~7]的某个方格中,马按走棋规则进行移动。要求每个方格只进入一次,走遍棋盘上全部64个方格。编制非递归程序,求出马的行走路线,并按求出的行走路线,将数字1,2,…,64依次填入一个8×8的方阵,输出之 -The horses were placed in 8 × 8 chess board Board [0 ~ 7] [0 ~ 7] in a box, the horse in accordance with the rules for
lab2
- 数据结构 二叉树的建立,前序中序,后续遍历,还有非递归算法-Bitree create
Bitree
- 二叉树非递归,bitree。。二叉树非递归,bitr-no
6.1
- 实现非递归二叉排序树的插入和创建,并用中序遍历检验-To achieve non-recursive binary tree insertion sort and create and use in order traversal test
binarytreedepth
- 求二叉树的深度、前中后序遍历的非递归算法-Seeking depth of binary tree, before, during and after traversing a non-recursive algorithm
a
- 编写具有如下函数原型的非递归两种函数f,负责判断数组a的前n个元素是否从大到小完全有序了,是则返回true,否则返回false。并编制主函数对它们进行调用,以验证其正确性。 bool f(int a[], int n) 提示: 非递归函数中只需逐对地判断各a[i]与a[i+1]是否都已从大到小有序排列(i = 0,1,…,n-2)。-Prepared with the following function prototype of two non-recursive fun
Calculator
- 非递归预测分析表达式的计算器,该分析语法可以计算表达式的值-Prediction of non-recursive expression calculator, the analysis value of the expression syntax can be calculated
fdg
- 非递归算法遍历文件夹目录,执行效率高,抛砖引玉,大家共同讨论下-Non-recursive algorithm traverse the folder directory, the implementation of high efficiency, initiate the discussion under the common
sort
- 用非递归的算法对一组 数组进行排序,算法比较简单-Non-recursive algorithm to sort a set of array
Projects
- 将马随机地放在国际象棋的8*8棋盘Board[8][8]的某个方格中,然后令马按走棋规则开始进行移动。要求马将棋盘上的每个方格进入且只进入一次,走遍全部64个方格。要求编制非递归程序,求出马的行走路线,将数字1,2,…,64依次填入一个8*8的方阵在屏幕上显示输出。-Ma randomly placed in the 8* 8 chess board Board [8] [8] in a box, and then that horse started under the rules for p