Re: [Tcllib-devel] FordFulkerson

[Andreas K. <and...@ac...>]

Lars Hellström wrote:
> Michał Antoniewski skrev:
>>  Hello.
>>
>> About flow problems:
>> - Edmond's Karp algorithm, like Lars has written, is indeed extension of
>> Ford's Fulkerson. The difference is as it was said, in Edmond's Karp we
>> search for shortest paths between s and t. Just to mention, those shortest
>> paths are chosen considering the smallest amount of edges between s and t,
>> not throughputs. So, it's like running Dijkstra on residual graph, with all
>> weights at edges set to 1, just for that one operation. After some thinking,
>> I don't see any way to omit using Dijkstra or any other path finding method

That is ok, Michal. My objection to the code I saw was that the exact same 
dijkstra was run twice, I was not against its general use.

>> - min cost flow problems - actually, we've got one algorithm in timeline for
>> that: Busacker-Gowen ( already implemented,just have to do some more tests )

Looking forward to that.

Andreas