COIN-OR::LEMON - Graph Library

Changes between Version 4 and Version 7 of Ticket #180


Ignore:
Timestamp:
08/26/09 00:54:29 (10 years ago)
Author:
Peter Kovacs
Comment:

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.

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #180

    • Property Milestone changed from to LEMON 1.2 release
  • Ticket #180 – Description

    v4 v7  
    22
    33The affected files are
     4 - lemon/cancel_and_tighten.h
    45 - lemon/capacity_scaling.h
    56 - lemon/cost_scaling.h