Location:
Search - tarjan
Search list
Description: Computes \"Connected Components\" using Tarjan s Union-Find algorithm the result is returned in the same buffer as gray_level image with values equal to the label of the component.
Platform: |
Size: 3510 |
Author: 周平 |
Hits:
Description: Computes "Connected Components" using Tarjan s Union-Find algorithm the result is returned in the same buffer as gray_level image with values equal to the label of the component.
Platform: |
Size: 3072 |
Author: 周平 |
Hits:
Description: 介绍最大流算法的ppt，The Ford-Fulkerson Augmenting Path Algorithm，The Capacity Scaling Algorithm，The Goldberg-Tarjan Preflow Push Algorithm，-Introduction maximum flow algorithm ppt, The Ford-Fulkerson Augmenting Path Algorithm, The Capacity Scaling Algorithm, The Goldberg-Tarjan Preflow Push Algorithm,
Platform: |
Size: 2870272 |
Author: ltryee |
Hits:
Description: 使用push-relabel方法求解最大流问题，是国外的一个研究机构编写的，速度很快。-This is an efficient implementation of the push-relabel method.
See
Goldberg and Tarjan, "A New Approach to the Maximum Flow Problem,"
J. ACM Vol. 35, 921--940, 1988
and
Cherkassky and Goldberg, "On Implementing Push-Relabel Method for the
Maximum Flow Problem," Proc. IPCO-4, 157--171, 1995.
Platform: |
Size: 26624 |
Author: 顾徐鹏 |
Hits:
Description: 最近公共祖先的家谱树
1. 正确构造了家谱树，实现了简单的查询:如查找祖先，查找家长，查找孩子，
查找兄弟，查找配偶，遍历所有家族成员等等。
2. 正确实现了插入，删除，结婚等操作。
3. 实现了一些复杂的查询，如:查找某人的所有子孙，查找某人的兄弟姐妹，部
分实现了给出两人，查询称呼的功能。(但对于过分复杂的关系暂时还不能实现。)
新增功能
1. 正确实现了不相交集合类（disjointSet.h）。
2. 正确利用并查集实现了LCA（Least Common Ancestor）功能，能够查找任意
两家族成员的最近共同祖先。
二． 问题分析
1. 这个问题涉及到了树这一数据结构，采用了孩子兄弟链（二叉树，左孩子右
兄弟）的方式来解决这个问题。用递归的观点解决了大部分的查询问题和遍历问题。-FamilyTree using Tarjan Algorithm
Platform: |
Size: 11264 |
Author: 马嘉元 |
Hits:
Description: 十字链表写的tarjan算法
且缩环成点判断出度-Cross-linked and reduced write tarjan algorithm out-degree loop into a point to judge
Platform: |
Size: 1024 |
Author: looker |
Hits:
Description: Tarjan s strongly connected components algorithm
Platform: |
Size: 1024 |
Author: profiler007 |
Hits:
Description: 作者V.King， S.Rao 和 R.Tarjan。
本文介绍了一种关于最大流的算法。-We describe a deterministic version of a 1990 Cheriyan Hagerup, and Mehlhorn randomized algorithm for computing the maximum flow on a directed graph.
Platform: |
Size: 675840 |
Author: waterrenny |
Hits:
Description: 求无向图最少加多少条边才能变成双联通图，输入顶点数和变数，然后读入图，利用无向图的Tarjan算法。-At least they try to figure how much to become a double edge Unicom plans, and variable input vertices, and then read into the figure, the use of undirected Tarjan algorithm.
Platform: |
Size: 2048 |
Author: lkjsdf |
Hits:
Description: Tarjan算法求最近公共祖先，输入树和询问，按询问顺序回答-Tarjan algorithm for recent common ancestor, the input tree and asked to answer the order by asking
Platform: |
Size: 1024 |
Author: luoyile |
Hits:
Description: SAT-2 solution by Tarjan Algorithm / problem from spoj
Platform: |
Size: 1024 |
Author: antonjuk@gmail.com |
Hits:
Description: LCA的tarjan算法，处理最近公共祖先问题-tarjan algorithm，due to deal with LCA problem
Platform: |
Size: 145408 |
Author: Art |
Hits:
Description: LCA问题的Tarjan离线算法 源代码加说明-LCA problem the Tarjan offline algorithm source code described in
Platform: |
Size: 1024 |
Author: 张文宇 |
Hits:
Description: 给定一个图，找强连通分量，使用Tarjan算法-Given a graph, find the strongly connected components, the use of Tarjan algorithm
Platform: |
Size: 260096 |
Author: dianlujitao |
Hits:
Description: tarjan求有向图强连通分量算法，tarjan求有向图强连通分量算法。-tarjan seeking to strengthen the country have connected components algorithm, tarjan seeking to strengthen the country have connected components algorithm.
Platform: |
Size: 1024 |
Author: 爱爱爱 |
Hits:
Description: Tarjan的脱机最小公共祖先问题，里面使用了pair,map以及结构体等相关结构-Tarjan off-line least common ancestors problem
Platform: |
Size: 2048 |
Author: lixiaobo |
Hits:
Description: 提供堆优化的Dijkstra算法、求割点割边的Tarjan算法-Heap optimized Dijkstra algorithm, for cutting point cutting edge Tarjan algorithm
Platform: |
Size: 3072 |
Author: Lu lu |
Hits:
Description: 求无向连通图的最小割点。用R.Tarjan发明的算法来实现的。该算法能够求出无向连通图中最小割点。-Seeking connected undirected graph minimum cut point. Algorithmically R.Tarjan invention to achieve. The algorithm can be obtained connected undirected graph minimum cut points.
Platform: |
Size: 1024 |
Author: 相知无悔 |
Hits:
Description: Tarjan算法求LCA，输入输出格式详见代码。(Solve LCA,Input and Output forms are in the codes.)
Platform: |
Size: 332800 |
Author: Stockholm
|
Hits:
Description: Dijkstra,Floyd，SPFA，Tarjan等算法的Python实现，附有GUI演示。(Dijkstra, Floyd, SPFA, Tarjan, and other Python implementations with GUI demo.)
Platform: |
Size: 132096 |
Author: 幻飘雪
|
Hits: