Changes between Version 6 and Version 10 of Ticket #13917


Ignore:
Timestamp:
06/05/13 14:54:47 (8 years ago)
Author:
ncohen
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #13917 – Description

    v6 v10  
    66sage: gn = g.networkx_graph()
    77sage: %timeit list(networkx.find_cliques(gn))
    8 10 loops, best of 3: 59.9 ms per loop
     810 loops, best of 3: 48.8 ms per loop
    99sage: from sage.graphs.independent_sets import IndependentSets
    1010sage: %timeit list(IndependentSets(g,complement=True, maximal = True))
    11 100 loops, best of 3: 19.7 ms per loop
     1110 loops, best of 3: 20.8 ms per loop
    1212sage: %timeit IndependentSets(g,complement=True, maximal = True).cardinality()
    13 100 loops, best of 3: 17.6 ms per loop
     13100 loops, best of 3: 19 ms per loop
    1414}}}
    1515
    16 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).
    17 
    18 And count them.
     16Either way, this patch implements a `sage.graphs.independent_set` module that can list/count (possibly maximal) independent sets.
    1917
    2018Anyway, don't hesitate to tell me that this patch is useless if you feel like it. I'm not *that* convinced either.