搜索资源列表
Nat-traverse-source
- P2P穿越防火墙 代码 ,作为P2P开发中的配套代码.-P2P Firewall traversal code, P2P development as the matching code. xxxxxxxxxxxxxxxxxxxxxxxxxx
51_vd_dom
- VC++6中用DOM遍历网页中的元素源代码，可以枚举出当前浏览的网页的所有元素。 -VC 6 DOM traversal using the website source code elements, Enumerating up with the current can browse the website of all the elements.
CREATE1
- 按前序遍历序列创建二叉树，并中序遍历二叉树、求二叉树高度-by creating a binary tree traversal sequence, and which preorder binary tree, seeking binary tree height
GraphMatrix
- 以邻接矩阵作为图的存储结构，根据键盘输入创建图，并深度优先、广度优先遍历该图-matrix as to the adjacent storage structure of the plan, according to the keyboard input to create map and depth of priority, breadth priority traversal of the plan
LastOrderTree
- 创建二叉树，并实现二叉树前序、中序递归遍历算法和二叉树的后序非递归遍历-create binary tree, and to achieve binary tree before the sequence, sequence recursive traversal of a binary tree algorithm and after non - recursive traversal sequence
Soft20060210100933557
- 图的建立、遍历、最小生成树、最短路径 图的建立、遍历、最小生成树、最短路径-plans the establishment, traverse, the minimum spanning tree and the shortest road map for the establishment of traversal, minimum spanning tree, shortest path
BinaryTree111
- 用C++写的寻找公共祖先，实现树的先序后序中序层次遍历，内有实验报告可以参阅。-C wrote for the public ancestors, the first realization of the tree sequence after sequence traversal sequence level, there are experimental report can be found.
SystemTreedev
- explore目录文件浏览，选择及反选，以及整个目录的遍历-explore directory file browser, and anti-choice election, as well as the entire directory traversal
aglorithm
- 问题算法源代码：骑士遍历、万年历、N皇后问题回溯算法、动态计算网络最长最短路线、货郎担分枝限界图形演示、货郎担限界算法、矩阵乘法动态规划、网络最短路径Dijkstra算法-problems algorithm source code : Knight traversal, calendar, N Queens backtracking algorithms, Dynamic computing network longest short
up3
- 本程序为“有向图的遍历及运算”，非常方便使用，希望大家能够喜欢。-the procedures as "directed graph traversal and calculations," is very convenient to use and I hope we can like.
Fivefiles!
- 一共五个源代码文件,,分别实现哈希表遍历,,播放动画,,写文件,,带对话框的窗口和访问数据库!-a total of five source code files, respectively achieving hash table traversal, and broadcast animation, and writing paper. with the dialog window and access to the databas
rbtreetraver
- 树的四种遍历方式，中叙，前序，后序和按层遍历算法，前三个用递归很好实现，最后一个复杂点。-tree traversal of the four, China and Syria, the former sequence after sequence and by layer traversal algorithm, the former three Recursive properly achieved, Finally a compl
asdfasxa32
- 掌握图的邻接矩阵的存储结构；实现图的两种遍历：深度优先遍历和广度优先遍历。-master plan adjacency matrix storage structure; Implementation plans of the two traverse : depth-first traversal and breadth traversal priority.
tupopaixu
- 图的DFS遍历，以及两种拓扑排序的实现，一种是DFS拓扑排序，另一种是无后继结点的拓扑排序-map DFS traversal, and the two topological sorting the realization DFS is a topological sorting, Another is no subsequent node of topological sorting
GOOD_DFS_BFS
- 图论中二种遍历图的算法.深度优先遍历,与广度优先遍历.-graph theory two species traverse map algorithm. Depth-first traversal, and the breadth - first traversal.
cengxubianlierchashu
- shi.c 说明:本程序用于层序遍历二叉树.程序开始时先由用户先根序输入二叉树各结点值,对于空结点输入宏ENDTAG所对的值(暂定为整数0). 建立好二叉树后即可自动进行遍历依次层序输出各结点的值. ----Author:zhg 2006.11.26 E-mail: wudazhg@163.com 仅供参考学习之用，所有权保留-shi.c : The procedures for the binary tree
operate
- 1，图的建立与遍历操作 建立图的邻接矩阵 输出图从顶点V0出发按深度优先遍历的顶点序列 输出图从顶点V0出发按广度优先遍历的顶点序列 2，图的建立与拓扑排序-1, Graph traversal operation with the establishment of the establishment of the adjacency matrix output plans starting from the verte
tree-op
- 前序线索二叉树的前序遍历 中序线索二叉树的中序遍历 后序线索二叉树的后序遍历-Preorder clues before the binary tree traversal sequence which leads the order of the binary tree traversal sequence clues after the binary tree after preorder
lll333
- 这是一个利用扩展先序二叉树建立二叉树,并采用先序,中序,后序进行遍历的算法!-This is the first expansion of the use of a binary tree order to establish binary tree, and a first sequence, sequence, After traversal sequence for the algorithm!
bina_tree
- 已知一棵二叉树的先序中序遍历构造二叉树,输出其后序遍历序列-known first of a binary tree traversal sequence binary tree structure, and the output was preorder sequence