#7274: graphs: Maximum flow algorithms
----------------------------+-----------------------------------------------
Reporter: tombuc | Owner: rlm
Type: enhancement | Status: new
Priority: major | Milestone: sage-wishlist
Component: graph theory | Keywords:
Work_issues: | Author: tombuc
Reviewer: | Merged:
----------------------------+-----------------------------------------------
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.
Please review.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7274>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to
[email protected]
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en
-~----------~----~----~----~------~----~------~--~---
