#19014: Tarjan Strongly Connected Components Algorithm
-------------------------------------+-------------------------------------
Reporter: borassi | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.9
Component: graph theory | Resolution:
Keywords: Strongly | Merged in:
connected components, Tarjan | Reviewers:
Authors: Michele Borassi | Work issues:
Report Upstream: N/A | Commit:
Branch: | 8df530ab5c761501b10ba397e361889b4be91833
u/borassi/tarjan_strongly_connected_components_algorithm| Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by dcoudert):
I don't see any slowdown, But there is room for improvements...
- Without this patch
{{{
sage: set_random_seed(0)
sage: D = digraphs.RandomDirectedGNM(10000,50000)
sage: %timeit D.is_strongly_connected()
100 loops, best of 3: 10.2 ms per loop
sage: D.add_cycle(D.vertices())
sage: %timeit D.is_strongly_connected()
10 loops, best of 3: 20.9 ms per loop
}}}
- With this patch
{{{
sage: set_random_seed(0)
sage: D = digraphs.RandomDirectedGNM(10000,50000)
sage: %timeit D.is_strongly_connected()
100 loops, best of 3: 9.98 ms per loop
sage: D.add_cycle(D.vertices())
sage: %timeit D.is_strongly_connected()
10 loops, best of 3: 22 ms per loop
}}}
David.
--
Ticket URL: <http://trac.sagemath.org/ticket/19014#comment:7>
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.
