Search results

=== Problems === * [[Max-Flow Problems]]

# The '''length''' of an [[Basic graph definitions#Paths|ordinary path]] (incl. [[Basic graph definitions#Cycles|ordinary cycles]]) ...ons#Cycles|generalized cycles]]) is either defined identically to ordinary paths or, alternatively, the lengths of the backward arcs are not added but subtr

'''Break condition:''' There is no more [[Basics of shortest paths#Path lengths and distances|negative cycle]] in the residual network. The problem to find a feasible flow is reduced to a [[Max-Flow Problems|max-flow problem]] as follows:

#[10:59] Varianten des Kürzeste-Pfade-Problems [[Category:All Pairs Shortest Paths]]

'''Algorithmic problem:''' [[Max-Flow Problems#Standard version|Max-flow problems (standard version)]] ...th>S</math> contains a cycle-free [[Basic flow definitions#Flow-augmenting paths and saturated arcs|flow-augmenting path]] with respect to <math>f</math>. T