搜索资源列表
bianli
- 建立二叉树用非递归方法对树进行遍历，其中用到了栈来保存中间数据。-The establishment of tree with non-recursive method to traverse the tree, which uses a stack to save the intermediate data.
bianli
- 数据结构中图的遍历。通过手动输入，采用邻接矩阵创建无向图，再通过计算，完成对该图进行土的深度优先遍历。-Graph traversal of the data structure. By manually entering the adjacency matrix to create an undirected graph, by calculating the complete depth-first traversal of the soil of the graph.
bianli
- VS2010编写的遍历目录小程序，dos界面，数字内容安全的“分词”中可能会用到-VS2010 directory traversal written procedures, dos interface, digital content security " word" may be used
bianli
- 这是图的深度优先遍历和广度优先遍历算法，可以改变结点数和边数-This is illustrated in the depth-first traversal and breadth-first traversal algorithm, you can change the number of nodes and edges
bianli
- C语言简单实现各种遍历（中序、先序、递归非递归），适合初学者-C language to achieve a variety of simple traversal, suitable for beginners
bianli
- 此程序是介绍如何在应用程序中来遍历文档模板-This procedure is in the application describes how to traverse the document template
bianli
- 能够帮助大家了解二叉树的遍历算法，其中包括 先序遍历、中序遍历和后序遍历。-It can help you understand the binary tree traversal algorithms, including Preorder, preorder and postorder traversal.
bianli-XML
- 遍历XML,提取XML中的元素。获取XML下的所有节点(父节点及子节点)-Need to extract the value of each element