Function flow

examples/network_flow.py:25–26

(E)

    return 1 if n == orig else -1 if n == dest else 0

def flow(E):
    return h.qsum((x[e] for e in E))

h.addConstrs(flow(G.out_edges(n)) - flow(G.in_edges(n)) == rhs(n) for n in G.nodes)
h.minimize()