Opened 15 years ago
#235 new enhancement
Push-relabel max flow (Preflow) for undirected graphs
| Reported by: | Balazs Dezso | Owned by: | Alpar Juttner |
|---|---|---|---|
| Priority: | minor | Milestone: | |
| Component: | core | Version: | hg main |
| Keywords: | preflow specialization undirected | Cc: | |
| Revision id: |
Description
The current Preflow algorithm works well on undirected graphs, however a specialized version for undirected graphs could more efficient than the current solution. The flow map could be EdgeMap? in this case and the edges do not need to be iterated twice (outgoing and incoming arcs). I think the overall improvement could be a small factor both in time and storage complexity.
Attachments (1)
Note: See
TracTickets for help on using
tickets.
american.com online.com