Location:
Search - dinic
Search list
Description: dinic的网络最大流算法模板，非常实用，经过自己多次测试通过的!Q-Dinic network maximum flow algorithm templates, very useful, after their own, adopted a series of trial runs! Q
Platform: |
Size: 1024 |
Author: wang yucao |
Hits:
Description: dinic算法 相当实用，ACM最大流必备-useful dinic algorithm, ACM maximum flow must
Platform: |
Size: 1024 |
Author: dingyi |
Hits:
Description: 求最大流的Dinic和SAP算法的实现，各自有递归与非递归版本。在稀疏图上效果比较好。-Dinic for the maximum flow algorithm and the SAP implementation, each of which has recursive and non-recursive version. Effect on the sparse map is better.
Platform: |
Size: 4096 |
Author: sunli |
Hits:
Description: Dinic求最大流, Dinic求最大流, Dinic求最大流,Dinic求最大流-Dinic for maximum flow, Dinic for maximum flow, Dinic for maximum flow, Dinic for maximum flow, Dinic for maximum flow, Dinic for maximum flow
Platform: |
Size: 3072 |
Author: tong |
Hits:
Description: This file is about Max Flow , especially Dinic s algorithm-This file is about Max Flow , especially Dinic s algorithm....
Platform: |
Size: 19456 |
Author: Hendrik |
Hits:
Description: UVA 10092 acm dinic AC
Platform: |
Size: 2048 |
Author: antic |
Hits:
Description: ACM UVA 10092 - flow dinic fast-ACM UVA 10092- flow dinic fast
Platform: |
Size: 2048 |
Author: antic |
Hits:
Description: 用才c语言实现了dinic算法，算法效率高-Using only c language to implement dinic algorithm is efficient
Platform: |
Size: 2048 |
Author: pengyan |
Hits:
Description: dinic网络最大流算法，POJ测试通过-dinic algorithm,accessed by POJ
Platform: |
Size: 2048 |
Author: yzhw |
Hits:
Description: 网络流
采用dinic算法实现 效率较高-max flow(dinic)
Platform: |
Size: 1024 |
Author: kantianfadai |
Hits:
Description: pku常见的图论问题经典算法,包含最小奇数环，
dinic等 -Pku classical algorithm
Platform: |
Size: 11264 |
Author: liuwq |
Hits:
Description: 网络最大流 Dinic算法 比Ford-Furkson,Edmond-Karps效率要高， 算法复杂性为O(V^2*E)-Dinic is a high-efficient maximum-flow algorithm proposed by a russian named diniz
Platform: |
Size: 3072 |
Author: lelading |
Hits:
Description: 作者Andrew V. Godberg
本文介绍一种解决网络最大流问题的算法。-Abstract. All previously known efftcient maximum-flow algorithms work by finding augmenting paths,
either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortest-length
augmenting paths at once (using the layered network approach of Dinic).
Platform: |
Size: 1408000 |
Author: waterrenny |
Hits:
Description: 提供了DINIC算法的程序，可以帮助了叫dinic算法的过程-Algorithm provides a DINIC program that can help the process of the algorithm called dinic
Platform: |
Size: 1354752 |
Author: 李正勇 |
Hits:
Description: Dinic algorithm implementation, Tested on spoj problem FastFlow
Platform: |
Size: 1024 |
Author: antonjuk@gmail.com |
Hits:
Description: 一个网络流dinic算法的模板，用来求解一个网络的最大流，速度非常快。-A network flow dinic algorithm template, used to solving a network of maximum flow, at a very fast rate.
Platform: |
Size: 1024 |
Author: 噩 |
Hits:
Description:
Dinic method of maximum flow construction,
for O(n^3),
using pseudo-maximal flow construction by
Malhotra - Kumar - Maheshvari.
By Vitold Lipsky ( Combinatorics for programmers , 1988).
Written by: Amir Tulegenov, 2009
Platform: |
Size: 2048 |
Author: amir.tu |
Hits:
Description: dinic算法的实现。用来计算最大流最小割问题-Dinic algorithm for solving min-cut or max-flow problems
Platform: |
Size: 3640320 |
Author: DSQ |
Hits:
Description: dinic : an algorithm for the maxflow of the network
Platform: |
Size: 1024 |
Author: majahao |
Hits:
Description: 在图论中的网络流部分，使用Dinic算法求解网络中的最大流。(Can achieve maximum flow in graph theory)
Platform: |
Size: 1024 |
Author: 诗人漫步
|
Hits: