#7274: graphs: Maximum flow algorithms
----------------------------+-----------------------------------------------
Reporter: tombuc | Owner: rlm
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-4.3.1
Component: graph theory | Keywords:
Work_issues: | Author: Tomasz Buchert, Michal Bulant
Upstream: N/A | Reviewer: Robert Miller
Merged: |
----------------------------+-----------------------------------------------
Changes (by newvalueoldvalue):
* status: needs_review => needs_work
* reviewer: => Robert Miller
* upstream: => N/A
* author: tombuc => Tomasz Buchert, Michal Bulant
Comment:
Patch applies cleanly and passes tests, and I'm ready to approve except
for:
1. `def path_iterator(P)` This function needs a docstring. The 100% rule
applies here too. Just a simple sentence saying what it does and an
example or two will do.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7274#comment:4>
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.
