Ticket #7274 (closed enhancement: duplicate)
graphs: Maximum flow algorithms
|Reported by:||tombuc||Owned by:||rlm|
|Report Upstream:||N/A||Reviewers:||Robert Miller|
|Authors:||Tomasz Buchert, Michal Bulant||Merged in:|
This is work from Sage Days 16 in Barcelona.
First patch implements Edmonds-Karp and Dinic algorithm for DiGraph?. Second one uses this implementation to find maximum matching in bipartite graphs.
I also include worksheet with simple usage example.
- Status changed from needs_review to needs_work
- Reviewers set to Robert Miller
- Report Upstream set to N/A
- Authors changed from tombuc to Tomasz Buchert, Michal Bulant