#13917: IndependentSets class
---------------------------------+----------------------------------
Reporter: ncohen | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.1
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: Nathann Cohen | Reviewers: ahmorales
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: #14589 | Stopgaps:
---------------------------------+----------------------------------
Description changed by ncohen:
Old description:
> I'm rather disappointed by this patch. Or I'm pleasantly surprised by
> Python, I don't know. I expected a much better speedup.
>
> {{{
> sage: g = graphs.RandomGNP(50,.7)
> sage: import networkx
> sage: gn = g.networkx_graph()
> sage: %timeit list(networkx.find_cliques(gn))
> 10 loops, best of 3: 48.8 ms per loop
> sage: from sage.graphs.independent_sets import IndependentSets
> sage: %timeit list(IndependentSets(g,complement=True, maximal = True))
> 10 loops, best of 3: 20.8 ms per loop
> sage: %timeit IndependentSets(g,complement=True, maximal =
> True).cardinality()
> 100 loops, best of 3: 19 ms per loop
> }}}
>
> Either way, this patch implements a `sage.graphs.independent_set` module
> that can list/count (possibly maximal) independent sets.
>
> Anyway, don't hesitate to tell me that this patch is useless if you feel
> like it. I'm not *that* convinced either.
>
> Nathann
>
> Apply:
>
> * [attachment:trac_13917-v2.patch]
> * [attachment:trac_13917-v2-more_doc.patch]
> * [attachment:trac_13917-doctests.patch]
New description:
I'm rather disappointed by this patch. Or I'm pleasantly surprised by
Python, I don't know. I expected a much better speedup.
{{{
sage: g = graphs.RandomGNP(50,.7)
sage: import networkx
sage: gn = g.networkx_graph()
sage: %timeit list(networkx.find_cliques(gn))
10 loops, best of 3: 48.8 ms per loop
sage: from sage.graphs.independent_sets import IndependentSets
sage: %timeit list(IndependentSets(g,complement=True, maximal = True))
10 loops, best of 3: 20.8 ms per loop
sage: %timeit IndependentSets(g,complement=True, maximal =
True).cardinality()
100 loops, best of 3: 19 ms per loop
}}}
Either way, this patch implements a `sage.graphs.independent_set` module
that can list/count (possibly maximal) independent sets. While right now
we can only compute the maximal ones.
Nathann
Apply:
* [attachment:trac_13917-v2.patch]
* [attachment:trac_13917-v2-more_doc.patch]
* [attachment:trac_13917-doctests.patch]
--
--
Ticket URL: <http://trac.sagemath.org/ticket/13917#comment:22>
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/groups/opt_out.
