Primary author of this description: I.V.Afanasyev.
1 Links
JGraphT (class EdmondsKarpMaximumFlow), Edmonds–Karp algorithm, complexity O(nm^2).
2 Locality of data and computations
2.1 Locality of implementation
2.1.1 Structure of memory access and a qualitative estimation of locality
2.1.2 Quantitative estimation of locality
3 Scalability of the algorithm and its implementations
3.1 Scalability of the algorithm
3.2 Scalability of of the algorithm implementation
4 Dynamic characteristics and efficiency of the algorithm implementation
5 Run results
