Hi,

Are there any optimized algorithms in the BGL to compute max-flow for every pair of nodes in a graph?

Many thanks,