搜索资源列表
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 and Cherkassky and Gol
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 algorithm.
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
tarjan
- 给定一个图，找强连通分量，使用Tarjan算法-Given a graph, find the strongly connected components, the use of Tarjan 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
GraphStructure
- Dijkstra,Floyd，SPFA，Tarjan等算法的Python实现，附有GUI演示。(Dijkstra, Floyd, SPFA, Tarjan, and other Python implementations with GUI demo.)