#18485: Make function to generate *all* independent sets.
-------------------------------------+-------------------------------------
Reporter: Rudi | Owner: Rudi
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.8
Component: matroid theory | Resolution:
Keywords: | Merged in:
Authors: Rudi Pendavingh | Reviewers: Vincent Delecroix
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/Rudi/make_function_to_generate__all__independent_sets_|
d55832d5131672ba1d82ed4866ad606d6957f11a
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by Rudi):
Replying to [comment:29 vdelecroix]:
> {{{cdef long r = self.full_rank()}}}
>
> BTW, is this full rank intended to be huge? Doing `r+1` malloc/free of
size `X` is much slower than one malloc/free of size `(r+1)*X`. Why not
using `sage.data_structures.binary_matrix` here?
I'll check out `binary_matrix` on the train tomorrow morning. I do need to
apply bitset operations between rows of that matrix...
--
Ticket URL: <http://trac.sagemath.org/ticket/18485#comment:32>
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.
