#19301: Improved Graph.complement() (and cleanup in dense_graph.pyx)
----------------------------+---------------------------------
   Reporter:  ncohen        |            Owner:
       Type:  enhancement   |           Status:  new
   Priority:  major         |        Milestone:  sage-6.9
  Component:  graph theory  |         Keywords:
  Merged in:                |          Authors:  Nathann Cohen
  Reviewers:                |  Report Upstream:  N/A
Work issues:                |           Branch:
     Commit:                |     Dependencies:
   Stopgaps:                |
----------------------------+---------------------------------
 This branch improves the algorithm behind `Graph.complement()`, which
 currently calls `has_edge(u,v)` for every pair of points.

 With this, the computation of the complement is done on a dense graph, as
 it should.

 Nathann

--
Ticket URL: <http://trac.sagemath.org/ticket/19301>
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.

Reply via email to