#7227: [with patch, needs review] Improving factor complexity of words functions
-----------------------------+----------------------------------------------
Reporter: slabbe | Owner: slabbe
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.2.1
Component: combinatorics | Keywords: factor complexity
Work_issues: | Author:
Reviewer: vdelecroix | Merged:
-----------------------------+----------------------------------------------
Comment(by vdelecroix):
Replying to [comment:5 slabbe]:
> Replying to [comment:3 vdelecroix]:
> > rauzy_graph : why don't you use DiGraph method for the creation of
edges ?
>
> You mean the add_edge method? I don't know. Is it faster?
At least it is not slower and I find it clearer:
{{{
sage: timeit('G = DiGraph(loops=True)\nfor i in range(200):\n for j in
range(200):\n d.add_edge(i,j)')
5 loops, best of 3: 248 ms per loop
sage: timeit('d = {}\nfor i in range(200):\n d[i]=[]\n for j in
range(200):\n d[i].append(j)\nG=DiGraph(d,loops=True)')
5 loops, best of 3: 266 ms per loop
}}}
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7227#comment:6>
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
-~----------~----~----~----~------~----~------~--~---
