A network-flow or flow network is a directed graph with a capacity for each edge that can propagate a flow from a source to a sink.
When talking about computing network flows, the Algorithm Design Manual says: Traditional network flow algorithms are based on the idea …
algorithm data-structures graph network-flowWill the Ford-Fulkerson algorithm find a maximum flow of a unit-capacity flow network (all edges have unit capacity) with n …
algorithm time-complexity network-flow ford-fulkersonLet G = (V, E) be a network with s and t being the source and the sink. Let f be …
graph-algorithm max-flow network-flowLet G = (V,E) be an arbitrary flow network, with a source s and target t and positive integer capacity …
algorithm network-flow