#9350: Python max flow method
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: jason, mvngu, ncohen, rlm
Type: enhancement | Status: needs_info
Priority: major | Milestone: sage-4.5.2
Component: graph theory | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
Comment(by wdj):
Replying to [comment:4 ncohen]:
> > Why is this?
>
> What do you think of line 3652 of the generic_graph.py file ? `:-)`
>
> {{{
> sage: value,edges,[set1,set2] = g.edge_cut(0, 14, use_edge_labels=True,
vertices=True)
> }}}
>
> Nathann
The value isn't returned, so the potential user cannot see examples of how
the output changes for different choices of the input. I'm just wondering
if there was a good reason for omitting the edges in the output. An
example with value_only=False would be equally nice. Finally, to be
extremely picky, the description
{{{
``vertices`` -- boolean (default: ``False``). When set to ``True``,
also returns the two sets of vertices that are disconnected by
the cut. Implies ``value_only=False``.
}}}
should probably read
{{{
``vertices`` -- boolean (default: ``False``). When set to ``True``,
returns a list of edges in the edge cut and the two
sets of vertices that are disconnected by the cut.
Note: ``vertices=True`` implies ``value_only=False``.
}}}
Does this seem reasonable?
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9350#comment:5>
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.
