搜索资源列表
连通成份分析
- 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.
连通成份分析
- 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.
max_flow
- 介绍最大流算法的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, T
hipr
- 使用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
FamilyTree
- 最近公共祖先的家谱树 1. 正确构造了家谱树，实现了简单的查询:如查找祖先，查找家长，查找孩子， 查找兄弟，查找配偶，遍历所有家族成员等等。 2. 正确实现了插入，删除，结婚等操作。 3. 实现了一些复杂的查询，如:查找某人的所有子孙，查找某人的兄弟姐妹，部 分实现了给出两人，查询称呼的功能。(但对于过分复杂的关系暂时还不能实现。) 新增功能 1. 正确实现了不相交集合类（disjointSet.h）。
2186
- 十字链表写的tarjan算法 且缩环成点判断出度-Cross-linked and reduced write tarjan algorithm out-degree loop into a point to judge
Tarjan
- Tarjan s strongly connected components algorithm
Tarjan
- 求无向图最少加多少条边才能变成双联通图，输入顶点数和变数，然后读入图，利用无向图的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 algor
LCA
- Tarjan算法求最近公共祖先，输入树和询问，按询问顺序回答-Tarjan algorithm for recent common ancestor, the input tree and asked to answer the order by asking
Paradox
- SAT-2 solution by Tarjan Algorithm / problem from spoj
LCA-seminar-modified
- LCA的tarjan算法，处理最近公共祖先问题-tarjan algorithm，due to deal with LCA problem
LCA-Tarjan
- LCA问题的Tarjan离线算法 源代码加说明-LCA problem the Tarjan offline algorithm source code described in
tarjan
- 给定一个图，找强连通分量，使用Tarjan算法-Given a graph, find the strongly connected components, the use of Tarjan algorithm
Question
- tarjan求有向图强连通分量算法，tarjan求有向图强连通分量算法。-tarjan seeking to strengthen the country have connected components algorithm, tarjan seeking to strengthen the country have connected components algorithm.
least-common-ancestor
- Tarjan的脱机最小公共祖先问题，里面使用了pair,map以及结构体等相关结构-Tarjan off-line least common ancestors problem
graph
- 提供堆优化的Dijkstra算法、求割点割边的Tarjan算法-Heap optimized Dijkstra algorithm, for cutting point cutting edge Tarjan algorithm
FindArt
- 求无向连通图的最小割点。用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
Desktop
- Tarjan算法求LCA，输入输出格式详见代码。(Solve LCA,Input and Output forms are in the codes.)
GraphStructure
- Dijkstra,Floyd，SPFA，Tarjan等算法的Python实现，附有GUI演示。(Dijkstra, Floyd, SPFA, Tarjan, and other Python implementations with GUI demo.)