#18539: faster matroid 3 connectivity
-------------------------------------+-------------------------------------
Reporter: chaoxu | Owner: chaoxu
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.8
Component: matroid theory | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/chaoxu/faster_matroid_3_connectivity|
84a81fdefe60c488faf9e4610c170c985e0c5f2f
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by Rudi):
Replying to [comment:24 chaoxu]:
> We could create a function that finds the components of a hypergraph
given the edges. Then both components() and the code in Step 2 can just
call that function.
That is true, and it would not be that much work either to make such a
more elementary function for SetSystem. But I'm afraid that just filling
these hypergraphs with python sets may become the bottleneck. But maybe if
I also write a routine for SetSystem to delete a fixed subset from all
subsets in the system.
I'll whip something up.
--
Ticket URL: <http://trac.sagemath.org/ticket/18539#comment:25>
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.
