#19291: Graph.spanning_trees does not like loops
-------------------------+-------------------------------------------------
Reporter: | Owner:
Stefan | Status: positive_review
Type: | Milestone: sage-6.9
defect | Resolution:
Priority: major | Merged in:
Component: graph | Reviewers: Stefan van Zwam
theory | Work issues:
Keywords: | Commit:
Authors: | 6a86e239c68f0d66cc182a98e74f72b34df4f961
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
u/ncohen/19291 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by dcoudert):
Replying to [comment:2 Stefan]:
> but could be costly in terms of memory for big graphs.
Well, considering such running time, it is likely that no one will use
this method for "big graphs".
{{{
sage: g = graphs.GridGraph([2,2,2])
sage: %timeit g.spanning_trees()
10 loops, best of 3: 99.4 ms per loop
sage: g = graphs.GridGraph([2,2,3])
sage: %timeit g.spanning_trees()
1 loops, best of 3: 13.4 s per loop
sage: g.order(),g.size()
(12, 20)
}}}
--
Ticket URL: <http://trac.sagemath.org/ticket/19291#comment:3>
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.
