#18539: faster matroid 3 connectivity
-------------------------------------+-------------------------------------
Reporter: chaoxu | Owner: chaoxu
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.8
Component: matroid theory | Resolution:
Keywords: | Merged in:
Authors: Chao Xu | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/chaoxu/faster_matroid_3_connectivity|
eca042a03f89753c1254d982e0dd663ec7d1b686
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by Stefan):
Replying to [comment:32 yomcat]:
> Replying to [comment:31 Stefan]:
> > * Maybe name the helper function _is_3connected_BC to indicate which
algorithm it implements? That way, we can also have an
_is_3connected_shifting version.
> >
> Is this the best way to implement it? Would an optional argument
algorithm='??' (that defaults to whichever algorithm ends up being faster)
work better?
The public-facing function would work like you describe, and call one of
the private ones either using an internal decision process, or using the
algorithm argument. A separate method for each algorithm allows you to do
things like recursion (in this case relevant). So I guess we are all on
the same page.
--
Ticket URL: <http://trac.sagemath.org/ticket/18539#comment:34>
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 unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
