[Lemon-devel] Some design topics

[Alpár Jüttner]

> The graph iterators shold be strict iteratots but some other cases the new one 
> can be implemented in more efficient way.

      * Could you give an example for this? 
      * Anyway, do we have a "general" iterator concept?

> Other important topic is the flow algorithms and the undirected graphs. The 
> undirected graphs can be used in flow algorithms because they are also 
> directed graphs too. By the way some constructions, by example residual 
> graphs, could be implemented easier and more efficient in the undirected 
> case. I think the flow algorithms design could be take care of the efficient 
> undirected implementations.

Could you submit this as a "feature request" in the issue tracker?

> 
> Best, Balazs
> _______________________________________________
> Lemon-devel mailing list
> Lemon-devel at lemon.cs.elte.hu
> http://lemon.cs.elte.hu/mailman/listinfo/lemon-devel