def shortest_augmenting_path(G, s, t, capacity='capacity', residual=None, value_only=False, two_phase=False, cutoff=None):
 R = shortest_augmenting_path_impl(G, s, t, capacity, residual, two_phase, cutoff)
 R.graph['algorithm'] = 'shortest_augmenting_path'
 return R

def shortest_augmenting_path ( G , s , t , capacity = 'capacity' , residual = None , value_only = False , two_phase = False , cutoff = None ) : R = shortest_augmenting_path_impl ( G , s , t , capacity , residual , two_phase , cutoff ) R . graph [ 'algorithm' ] = 'shortest_augmenting_path' return R
find a maximum single-commodity flow using the shortest augmenting path algorithm .