#19014: Tarjan Strongly Connected Components Algorithm
-------------------------------------+-------------------------------------
Reporter: borassi | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.9
Component: graph theory | Resolution:
Keywords: Strongly | Merged in:
connected components, Tarjan | Reviewers: David Coudert
Authors: Michele Borassi | Work issues:
Report Upstream: N/A | Commit:
Branch: | 9167071e5e8408c33125b551168d43c5f4539d19
u/borassi/tarjan_strongly_connected_components_algorithm| Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by dcoudert):
Hello,
could you change in the doctest of `tarjan_strongly_connected_components`
{{{
sage: for i in range(100): #
long
... g = digraphs.RandomDirectedGNP(100,.05)
}}}
with
{{{
sage: for i in range(100): #
long
....: g = digraphs.RandomDirectedGNP(100,.05)
}}}
so use `...` with `....:` for continuation.
Sorry to miss it before.
And also you can now change `for i in range(100)` with something small in
all test.
David.
--
Ticket URL: <http://trac.sagemath.org/ticket/19014#comment:28>
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.
