Port the remaining min. cost flow algorithms

[Alpar Juttner]

This ticket is a follow-up of #47.

The affected files are

• lemon/cancel_and_tighten.h
• lemon/capacity_scaling.h
• lemon/cost_scaling.h
• lemon/cycle_canceling.h
• lemon/min_cost_flow.h
• lemon/min_cost_max_flow.h

[Peter Kovacs]

This task depends on #51 and #179. Maybe it would be better in 1.2.

[Peter Kovacs]

The porting of Network Simplex is separated from the other MCF algorithms, since it is the most important, and it is easier to revise the interface of a single file. See #234 for details. For now on this ticket is only about the remaining MCF algorithms.

[Peter Kovacs]

Replying to kpeter:

This task depends on #51 and #179. Maybe it would be better in 1.2.

Only BellmanFord class is needed from #51.

Apart from that StaticDigraph (#68) would be good to have for these files, too. In fact, it is not used in the current SVN versions (-r3520), but it would be much more efficient in some cases to copy the used ResidualDigraph adaptor to a StaticDigraph structure before running an algorithm (e.g. BellmanFord or MinMeanCycle) on it.

[Peter Kovacs]

To sum it up, this task depends on the following tickets:

• #51 Port BellmanFord
• #179 Port the min mean cycle algorithms
• #68 Port StaticDigraph

and finally

• #146 Cheap copy of maps (reference counting)
  Maps are usually copied using copy constructor or operator= in the current implementations in SVN, but these methods can be avoided, if it is really necessary.

#51, #68 and #179 already contain the necessary patches, they only have to be revised.