搜索资源列表
递归中序遍历排序二叉树
- 这是一个中序遍历二叉树的VC实现,要注意的是输入节点后,以-1结束-which is a binary tree traversal sequence VC, to pay attention to the input nodes, in the end -1
xuehaiwuya
- 算法有关于树的遍历的,还有图的搜索等等的数据结构相关算法-algorithm on the traversal of the tree, and there are also search the data structure correlation algorithm
Windows资源管理器
- 本例实现了一个Windows资源管理器,该资源管理器具有浏览系统文件、目录,以及对其进行删除、移动等操作的功能。本例主要介绍了树形控件的使用,列表控件的使用,相关Windows API的使用,系统图标列表的获取,以及递归实现遍历目录等。-the cases to achieve a Windows Explorer, the resource manager with View system files, directories, an
图的操作界面
- 图邻接表的建立,深度优先遍历,.广度优先遍历,最小生成树,拓扑排序,单源点到其余各个顶点的最短路径等对图的操作!VC界面!-plans to establish the adjacent table, depth-first traversal. Breadth priority traversal, the minimum spanning tree, topological sorting, single-source all of
FTP遍历下载目录
- 这是一个在windows平台下用vc6.0开发的一个“FTP遍历下载目录”程序,内有详细的注解-This is one of the windows platform with the development of a vc6.0 "FTP download directory traversal" process, with detailed footnotes
ipsec vpn相关rfc集
- IPsec VPN的RFC文档集合: RFC 2401 《Security Architecture for the Internet Protocol》 RFC 2402 《IP Authentication Header》 RFC 2406 《IP Encapsulating Security Payload (ESP)》 RFC 2407 《The Internet IP Security Domain of In
C程序自动测试程序系统
- C程序自动测试程序系统,主要是测试数据结构中的几个经典算法:关于排序,树的遍历等.-C automatic test procedures, test data is the main structure of classical algorithm : Sort of, such as tree traversal.
0801
- 功能:构造图,并进行图的深度优先遍历(邻接表存储结构),图的广度优先遍历,内附详尽的源代码说明-function : tectonic map, and map depth-first traversal of the (storage structure adjacent table), the breadth of the plan priority traversal, enclosing a detailed note of t
遍历二叉树的4个非递归算法
- 二叉树的4个非递归算法,中序先序后序和层次遍历,算法都有注释而且很详细,适合数据结构学习者使用-binary tree four non - recursive algorithm, the first sequence after sequence and the sequence level traversal algorithm Notes but have very detailed data structure suitabl
树的建立及其深度
- 树结构是数据结构中最重要的结构。利用树可以实现遍历等要求。该算法用于建立树,才能实现其他的操作-tree data structure is the most important structure. Using tree traversal can be achieved, among others. The algorithm for the creation of the tree can be achieved by other
层次非递归遍历
- 数据结构中的常见算法,树的层次非递归遍历序算法,简单易懂-data structure of the common algorithm, the level of tree traversal sequence non - recursive algorithm, simple
tude遍历
- 图的遍历算法包括先序,后序,中序等多种遍历次序,还有图的初始化等-traversal algorithm of the plan include the first sequence after sequence, sequence and other traversal sequence, and there are also such as the initialization
按层二叉树遍历
- 按层二叉树遍历的一个小的java程序 dasfhdakdkjadjakdasds-level binary tree traversal by a small java programs dasfhdakdkjadjakdasds
三种遍历
- 本程序实现了层序遍历非递归、后续遍历非递归和中序遍历非递归三种算法-the program sequence traverse non - recursive and non - recursive traversal follow-up and the preorder three non - recursive algorithm
8连通
- 计算8连通区数量 利用深度优先遍历,并对同一8连通区进行标记,当遇到不属于同一连通区且灰度符合要求的则计数加1,分别考察一个点周围的八个点。-8 COMPONENTS calculated using the number of depth-first traversal, and the same eight areas marked connectivity, when they do not belong to the sam
图形演示二叉树程序
- 用TC20 图形方式演示了二叉树的遍历程序,可以作为学生的教学用-TC20 graphic demonstration of a binary tree traversal procedures can be used as a teaching students
各种二叉树的数据结构
- 按先序扩展序列建立二叉树,先序、中序、后序遍历的递归算法,二叉树遍历的非递归算法,层次的非递归算法,求二叉树的深度。-sequence extended by the first sequence established binary tree, first sequence, sequence, after the preorder the recursive algorithm, the binary tree traversal
DFS※Prim
- 用普里姆(Prim)算法构造最小生成树;图的DFS算法的非递归遍历函数。-with Primbetov (PRIM), the minimum spanning tree algorithm constructs; Map of the DFS non - recursive algorithm traversal function.
9二叉树
- 几乎包括二叉树的所有编程算法,其中有二叉树的先中后序递归与非递归遍历算法,由先序与后序建立二叉树,层次遍历,求叶子结点数,总结点数,树的深度与宽度。-including binary tree almost all programming algorithm, these binary tree after the first sequence which recursive and non - recursive traversal
两种遍历图的方法
- 熟悉图的两种常用的存储结构,以及在这两种存储结构上的两种遍历图的方法,即深 度优先遍历和广度优先遍历。进一步掌握递归算法的设计方法。 -familiar with the plans of two commonly used storage structure, and the two storage structures on the two traverse map, that depth-first traversal a