[Lemon-user] Max flow question

[Rafael Arakaki]

I guess lemon doesn't have a native algorithm to do what you are asking.

But if you know any algorithm that solve the "max flow with losses" problem
using the "simple max flow" as a sub-routine then lemon can be useful to
you.



2016-03-02 18:18 GMT-03:00 John Lagerquist <john at rallytronics.com>:

> I am still getting up to speed on graph theory and lemon.  I want to find
> the max flow for a directed graph with additive losses on the edges.
> Assuming a non negative lower boundaries.  How would I do this using
> lemon?  Is there an example of this?
>
> _______________________________________________
> Lemon-user mailing list
> Lemon-user at lemon.cs.elte.hu
> http://lemon.cs.elte.hu/mailman/listinfo/lemon-user
>
>


-- 
*Rafael Kendy Arakaki*
Mestrando em Ciência da Computação
Universidade Estadual de Campinas - Instituto de Computação
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lemon.cs.elte.hu/pipermail/lemon-user/attachments/20160305/0b34aa2f/attachment.html>