Opened 13 years ago
Last modified 12 years ago
#412 new task
Implement Dinitz algorithm for the max flow problem
| Reported by: | Peter Kovacs | Owned by: | Alpar Juttner |
|---|---|---|---|
| Priority: | major | Milestone: | |
| Component: | core | Version: | hg main |
| Keywords: | Cc: | ||
| Revision id: |
Description
It would be nice to implement the "original" Dinitz algorithm for the max flow problem.
We have an implementation that uses dynamic trees, but it would be better to have a separate implementation without dynamic trees, as well.
Change History (1)
comment:1 Changed 12 years ago by
| Summary: | Dinitz algorithm for the max flow problem → Implement Dinitz algorithm for the max flow problem |
|---|
Note: See
TracTickets for help on using
tickets.
