搜索资源列表
e34
- 这是用vc++编写的程序,在语音识别中经常用用到,是语音识别的第一步:time alignment. 分别用两种方式完成:1.非递归2.递归-This a vc++ program which is useful in voice recognizing and it is also the basic of the voice recognizing .I use two ways to accomplish it:1 nonrecursion 2.recursion
5个c程序源代码
- 五个c源代码 矩阵的运算方法 邻接矩阵求解最短路径 全屏幕模拟时钟 先序遍历非递归算法 字符串查找-5 c source code matrix arithmetic method adjacency matrix for the Shortest Path full-screen analog clock preorder non - recursive algorithm to search string
求二叉树的高度、叶子节点数
- 求二叉树的高度和深度，求高度时采用递归算法，求深度时采用非递归算法。-for binary tree height and depth, used for highly recursive algorithm, seeking depth of the use of non - recursive algorithm.
背包问题的两种算法实现
- 本例编程实现背包问题的递归和非递归算法，让你彻底了解这种算法-the cases Programming knapsack problem of recursive and non - recursive algorithm, so you thoroughly understand this algorithm
三种遍历
- 本程序实现了层序遍历非递归、后续遍历非递归和中序遍历非递归三种算法-the program sequence traverse non - recursive and non - recursive traversal follow-up and the preorder three non - recursive algorithm
各种二叉树的数据结构
- 按先序扩展序列建立二叉树，先序、中序、后序遍历的递归算法，二叉树遍历的非递归算法，层次的非递归算法，求二叉树的深度。-sequence extended by the first sequence established binary tree, first sequence, sequence, after the preorder the recursive algorithm, the binary tree traversal non - recursive algorithm, the
DFS※Prim
- 用普里姆(Prim)算法构造最小生成树；图的DFS算法的非递归遍历函数。-with Primbetov (PRIM), the minimum spanning tree algorithm constructs; Map of the DFS non - recursive algorithm traversal function.
二叉树jian
- 这个程序采用先序建立二叉树，并分别使用递归和非递归算法实现了对该二叉树的先中后序的遍历输出，并给出了一定的使用说明-this procedure was used in order to establish a binary tree respectively, and the use of recursive and non - recursive algorithm of this binary tree after the first sequence which Ergodic outp
9二叉树
- 几乎包括二叉树的所有编程算法，其中有二叉树的先中后序递归与非递归遍历算法，由先序与后序建立二叉树，层次遍历，求叶子结点数，总结点数，树的深度与宽度。-including binary tree almost all programming algorithm, these binary tree after the first sequence which recursive and non - recursive traversal algorithm, and by the first se
二叉树的各种遍历操作(非)递归
- 数据结构的基本应用，二叉树的遍历。适合初学者，比较简单。 -the basic data structure application binary tree traversal. For beginners, relatively simple.
李森数据结构作业
- 文件夹中包括常用的数据结构的算法，包括二叉树的三种递归和非递归算法，染色问题，八皇后问题，深度广度遍历，约瑟夫环，数值转换，树的高度和叶子节点数，最小生成树 ，两点之间的所有路径-folder include common data structure of the algorithm, including the three binary tree recursive and non - recursive algorithm, Dyeing, 8 Queen, depth and bread
myhannuota
- 用非递归算法写的汉诺塔程序，盘数可以改变，适合课件演示-non - recursive algorithm HANOR written procedures, bookkeeping can be changed, and courseware for demonstration
serach
- 二叉排序树的查找算法，用非递归做的，查找删除节点等操作-Binary Tree Search ranking algorithm, the use of non - recursive so that you delete nodes, etc
erchashu3
- 二叉树的便先中后三中递归和非递归方式的实现-binary tree after they were first three recursive and non - recursive approach to achieve
AlgorithmCode
- 海明码 出站入站序列 非递归生成树 九格填质数 七子控棋盘等等算法-Haiming yards out station stops recursive sequence-9 grid spanning tree fill several seven-quality control algorithm chessboard, etc.
wangxinwen
- 树的建立,各种遍历(先根递归,先根非递归,中根递归,中根非递归,后根递归,后根非递归,层次遍历,最近公共祖先的查找,树的删除-tree establishment of various traverse (first - recursive and non - recursive first root, root recursive and non - recursive root, root recursive, non - recursive root level, traverse, th
汉诺塔的演示程序
- 初学MFC时的拙作，一个汉诺塔的演示程序，采用非递归、非堆栈的算法，直接根据当前步数推算出汉诺塔的状态。界面用GDI实现，伪3D的风格。-beginners at the exposition, a HANOR the demo program, the use of non - recursive and non-stack algorithm, directly under the current steps are projected HANOR state. GDI interface
feidiguibahuanghou
- 非递归八皇后问题。以前大家常见的是递归的，现在传个非递归的-Queen's eight non - recursive problem. Before we often are recursive, and now-non - recursive
HanNuoTa
- 用非递归解决汉诺塔问题 采用二叉树查找的方法 made by a___9-non - recursive HANOR solve problems using the binary tree search method made by a___9
BTREE2006
- 一个非递归建立二差树的算法!输入先序带结束符号的序列建立二叉树!原创-establish two poor tree algorithm! First imported symbols sequence ended with the establishment of the sequence binary tree! Originality