[Lemon-user] User Data Structures

[Kovács Péter]

Hi Vivek,

The current network simplex implementation in LEMON is only applicable 
to the minimum cost flow problem:
http://lemon.cs.elte.hu/pub/doc/1.3/a00005.html

It does not allow injecting custom logic or constraints, though such 
extensions could be implemented indeed. (Cf. some basic algorithms, e.g. 
Dijkstra and BellmanFord, already support such customization applying 
different traits classes.)

So if you can transform your problem to the min cost flow formulation, 
then you can solve it with the NetworkSimplex class, otherwise you need 
to customize either this algorithm or a maximum flow algorithm somehow.

Best regards,
Peter


On 2013.09.10. 21:42, Vivek Periaraj wrote:
> Hello,
>
> I am new to Lemon. I would like to know if there is a way to access user
> data structures from within an algorithm. I have a max flow problem with
> a side constraint which I intend to solve using Network Simplex method.
> My goal is to ensure this side constraint during the pivoting step of
> the simplex method. How easy is it to achieve this with Lemon?
>
> Regards,
> Vivek.
>
>
> _______________________________________________
> Lemon-user mailing list
> Lemon-user at lemon.cs.elte.hu
> http://lemon.cs.elte.hu/mailman/listinfo/lemon-user
>