#6578: [with patch, needs review] fast subgraphs by building the graph instead
of
deleting things
--------------------------+-------------------------------------------------
Reporter: jason | Owner: rlm
Type: defect | Status: new
Priority: major | Milestone: sage-4.1.1
Component: graph theory | Keywords:
Reviewer: | Author: Jason Grout
Merged: |
--------------------------+-------------------------------------------------
Changes (by jason):
* cc: rlm (added)
Comment:
Timing comparison:
{{{
sage: g=graphs.PathGraph(100000)
sage: %time g.subgraph(range(20), algorithm='add')
CPU times: user 0.61 s, sys: 0.01 s, total: 0.62 s
Wall time: 0.68 s
Subgraph of (Path Graph): Graph on 20 vertices
sage: %time g.subgraph(range(20), algorithm='delete') # the old algorithm
CPU times: user 3.96 s, sys: 0.04 s, total: 4.00 s
Wall time: 4.15 s
Subgraph of (Path Graph): Graph on 20 vertices
}}}
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/6578#comment:2>
Sage <http://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
-~----------~----~----~----~------~----~------~--~---
