#13917: IndependentSets class
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: jason, ncohen, rlm
Type: enhancement | Status: new
Priority: major | Milestone: sage-5.6
Component: graph theory | Keywords:
Work issues: | Report Upstream: N/A
Reviewers: | Authors: Nathann Cohen
Merged in: | Dependencies:
Stopgaps: |
----------------------------+-----------------------------------------------
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))
5 loops, best of 3: 79.8 ms per loop
sage: %timeit list(IndependentSets(g,complement=True, maximal = True))
25 loops, best of 3: 26.4 ms per loop
}}}
Either way, this patch implements a `sage.graphs.independent_set` module
that can list/count (possibly maximal) independent sets in a small graph
(<64 vertices).
And count them.
Anyway, don't hesitate to tell me that this patch is useless if you feel
like it. I'm not *that* convinced either.
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13917>
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.
