Location:
Search - traversal
Search list
Description: freeswan nat穿越支持补丁0.6-freeswan through support patch 0.6
Platform: |
Size: 257024 |
Author: |
Hits:
Description: nat穿越开实时通讯开发中是个不可避免的问题，这是个英文文档，希望能给大家带来一些帮助-nat through the development of open real-time communication is inevitable, which is English document, I hope everyone can help bring some
Platform: |
Size: 394240 |
Author: 付鹰 |
Hits:
Description: 二叉树的前序中序后序遍历操作，以及后缀表达式计算-Binary Tree Preorder traversal sequence after sequence of operations, as well as the suffix expressions calculated
Platform: |
Size: 3072 |
Author: chenhuafeng |
Hits:
Description: 功能非常强大的p2p通信库源码，用户需要通信时自动检测网关类型进行穿透连接。已经在成熟软件项目里使用。-that will offer Network Address Translation (NAT) traversal for routers that support UPnP. LibNat will support port forwarding and the retrieval of the public IP address of the router
Platform: |
Size: 517120 |
Author: 杨刚 |
Hits:
Description: Robson遍历改进版：
这个课程设计的目的是进行一个罗布森遍历.
编写和测试的“修改”罗布森遍历程序使用链表代表的二叉树。
这一修改后的版本与原始的不同之处在于罗布森以一个节点的左指针指向左子树；现在修改版是反向。也就是说，当一个节点的左（右）子树正在走过，它的左（右）指针将指向其右（左）子树。在遍历，当一个节点访问，输出
每个栈的内容，它的右左指针。如此这样处理每个栈内元素。-Robson Traversal
Write and test a "modified" Robson Traversal program that uses the linked representation of the trees.
This modified version differs from the Robson only in that the pointers to a node s predecessor should
now be as in the Linked Inversion Traversal. That is, when a node s left(right) subtree is being traversed,
its left(right) pointer will point to its predecessor. During the traversal, when a node is visited, output
for each "stack entry, its info value and the info value of its left and right successors. This means, first,
output the number of the node Top points to, and then the number that that node s left and right pointers
point to. Then, output the number of the node that Stack points to,and then the numbers that that node s left
and right pointers point to. Do this for each node on the "stack"
Platform: |
Size: 3072 |
Author: hunter |
Hits:
Description: tree traversal MPI
inorder
preorder
postorder
Platform: |
Size: 1024 |
Author: jami dheeraj |
Hits:
Description: 汇总了常用的h323 nat穿越技术方案，并对各个方案的优缺点进行分析比较-h323 nat traversal technology
Platform: |
Size: 142336 |
Author: sunqingbo |
Hits:
Description: 1. 用ＤＦＳ判断一个无向图是否是连通图；
2. 为有向图的边分类，将它们的边分为前向边、后向边和交叉边；
3. 用ＤＦＳ和点消除求有向图的拓扑排序；
4. 判断有向图是不是强连通图，若不是，求强连通分量；
5. 判断有向图是不是半连同图；
6. 判断有向图是不是单连通图；
7. 判断无向图是不是双连通图。
通过以上编程对ＤＦＳ的应用，进一步了解ＤＦＳ的算法及它所代表的算法思想。
-1. Using DFS to test if a given undirected graph is connected or not.
2. Classify the edges of a directed graph into tree edges, back edges, forward edges or cross edges by a depth-first traversal of the graph. If the given graph is undirected, classify the edges into tree edges and back edges. And verify if a directed or undirected graph has a cycle.
3. Compute the topological order of a directed graph using both DFS algorithm and source removal algorithm.
4. A strongly connected graph is a directed graph with every pair of vertices reachable from each other. A strongly connected component C of a directed graph G is a subset of maximal vertices such that every pair of vertices in the subset are reachable from each other. A strongly connected component graph GSCC of a graph G is a directed graph that each component C of G is considered as a single vertex in GSCC and there is an edge between components C1 and C2 if there exist an edge (u, v) in the graph G with u belongs to C1 and v
Platform: |
Size: 10240 |
Author: 卢竹江 |
Hits:
Description: 在vc6.0环境下，实现图的深度优先遍历和广度优先遍历-In vc6.0 environment, to achieve depth-first graph traversal and breadth-first traversal
Platform: |
Size: 181248 |
Author: plum |
Hits:
Description: 无堆栈非递归后序遍历BST算法略要,算法过程的描述，无代码-inorder traversal without stack
Platform: |
Size: 20480 |
Author: sing |
Hits:
Description: 1．显示图的邻接矩阵, 图的邻接表, 深度优先遍历, 广度优先遍历, 最小生成树PRIM算法, 最小生成树KRUSCAL算法,图的连通分量。
2．当用户选择的功能错误时，系统会输出相应的提示。
3．通过图操作的实现，把一些实际生活中的具体的事物抽象出来-Shown FIG s adjacency matrix, graph the adjlink, depth-first traversal, breadth first traverse, minimum spanning tree minimum spanning tree PRIM algorithm, KRUSCAL algorithm, graph the connected components.
2. When the user chooses function mistake, the system will be output corresponding hints.
3. Through the realization of the operation, the graph of some actual life in the specific things abstract out
Platform: |
Size: 1024 |
Author: 江洋 |
Hits:
Description: 实现对图的遍历。数据结构算法的实现。编写语言为java。-Realize the graph traversal. Data structure algorithm. Written language is java.
Platform: |
Size: 75776 |
Author: lily |
Hits:
Description: Delphi 内存遍历工具(ReadMem)源代码，，感觉的确挺好用的，让大家一起共享。
-Delphi memory traversal tool (ReadMem) source code, it really felt very good use, so that everyone shared.
Platform: |
Size: 35840 |
Author: 高 |
Hits:
Description: 二叉树的三种遍历的C#实现 能够在.net环境下执行-binary tree traversal traversal of binary tree
Platform: |
Size: 4096 |
Author: |
Hits:
Description: 图的深度与广度优先遍历小程序源码，均为个人所编，并非网上下载。-The depth and breadth-first graph traversal
Platform: |
Size: 2048 |
Author: 周柏丞 |
Hits:
Description: 图的遍历，深度遍历和广度遍历，数据结构，图的遍历！
-Graph traversal, depth and breadth traversal traversal, data structures, graph traversal!
Platform: |
Size: 2048 |
Author: cai weiguo |
Hits:
Description: 马的遍历，输出第一个位置，后面的结果就出来了，-Ma traversal, output the first position, followed by the results came out,
Platform: |
Size: 2048 |
Author: 史乐乐 |
Hits:
Description: 二叉树的创建与遍历建立二叉树左右链存储结构。
对其递归的实现中序，先序，后序遍历。
对其非递归的实现中序，先序，后序遍历。
-Binary tree creation and traversal binary tree set up chain stores around the structure. Recursive implementation of its order, the first order, the order of traversal. Non-recursive implementation of its order, the first order, the order of traversal.
Platform: |
Size: 155648 |
Author: teddy |
Hits:
Description: 二叉树的中序与先序的非递归遍历算法的实现 用VS2010编写的-Binary tree in order and first order non-recursive traversal algorithm implementations written using VS2010
Platform: |
Size: 7780352 |
Author: Angel |
Hits:
Description: 【二叉树遍历的递归算法实现】
操作：根据提示输入相应数据实现各种功能
函数：菜单函数(menu)
前序建立二叉树(Crt_BinTree)
访问结点(Visit)
前序遍历(Pretraverse)
中序遍历(Intraverse)
后序遍历(Suctraverse)
删除树(Destory)
操作函数(perform)Pretraverse
主函数(main)
说明：结点数据初始为char型，但可在前面代码部分修改
成其他类型，输入时@代表子树为空-The binary tree traversal of recursion algorithm 】
Operation: according to the prompt corresponding input data realization of different functions
Function: the menu function (menu)
The preface to establish a binary tree (Crt_BinTree)
Access nodes (Visit)
The preface to traverse (Pretraverse)
In order to traverse (Intraverse)
After traverse sequence (Suctraverse)
Delete tree (Destory)
Operation function (perform) Pretraverse
The main () function (main)
Note: data for type char initial nodes, but can be in front the code changes
Into other types, input on behalf of children for empty @ tree
Platform: |
Size: 2048 |
Author: |
Hits:
« 12
3
4
5
6
7
8
9
10
...
50
»