Opened 15 years ago
Last modified 14 years ago
#180 closed task
Port the remaining min. cost flow algorithms — at Version 4
| Reported by: | Alpar Juttner | Owned by: | Peter Kovacs |
|---|---|---|---|
| Priority: | major | Milestone: | LEMON 1.2 release |
| Component: | core | Version: | hg main |
| Keywords: | Cc: | ||
| Revision id: |
Description (last modified by )
This ticket is a follow-up of #47.
The affected files are
- lemon/capacity_scaling.h
- lemon/cost_scaling.h
- lemon/cycle_canceling.h
- lemon/min_cost_flow.h
- lemon/min_cost_max_flow.h
Change History (4)
comment:1 Changed 15 years ago by
| Type: | defect → enhancement |
|---|
comment:2 Changed 15 years ago by
| Description: | modified (diff) |
|---|
comment:3 Changed 15 years ago by
| Milestone: | LEMON 1.1 release |
|---|---|
| Status: | new → assigned |
| Summary: | Port the min. cost flow algorithms. → Port the min. cost flow algorithms |
| Type: | enhancement → task |
comment:4 Changed 15 years ago by
| Description: | modified (diff) |
|---|---|
| Summary: | Port the min. cost flow algorithms → Port the remaining min. cost flow algorithms |
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.
Note: See
TracTickets for help on using
tickets.
This task depends on #51 and #179. Maybe it would be better in 1.2.