[Lemon-user] A few questions

[ILIA MINKIN]

Hi,

I have a di-graph with no weights, but with upper bound capacities on edges and
lower bound capacities on vertices. 

1) Which algorithm is the best fit for this use case?
2) Can I assign lower bound capacities to vertices without manually splitting
them?

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lemon.cs.elte.hu/pipermail/lemon-user/attachments/20170925/f2e5373c/attachment.html>