Maximum flow in undirected graph with non-integer weights -
if want find maximum flow in undirected graph, how this? on wikipedia page http://en.wikipedia.org/wiki/maximum_flow_problem says algorithms require directed graphs (i convert each edge pair of edges) problem may have non integer weights (for example 0.5). is there existing algorithm suitable problem? the stoer-wagner algorithm job. dwells on duality of max-flow/min-cut. algorithm in vein of seminal ford-fulkerson (which fails on real-valued edge weights) edmonds-karp .