# Pairwise cohesion algorithm

• Wikipedia:Ford–Fulkerson_algorithm#Complexity: "When the capacities are integers, the runtime of Ford-Fulkerson is bounded by $O(E f)$ (see Wikipedia:big O notation), where $E$ is the number of edges in the graph and $f$ is the maximum flow in the graph. This is because each augmenting path can be found in $O(E)$ time and increases the flow by an integer amount which is at least $1$."
• A great advantage of this $O(E f)$ computational complexity is that the Csardi flow computation method for pairwise cohesion is not only efficient but also calculates a pairwise integer flow-computation for every pair of nodes.