Function w

recipes/Python/576907_Minimum_Cut_Solver/recipe-576907.py:125–127

(g, A, y)

      self.edges[(n,v)] = w    

def w(g, A, y):
  assert y not in A
  return sum(w for v, w in g.adjacents(y) if v in A)

def min_cut_phase(g, a):
  A = set([a])