#19014: Tarjan Strongly Connected Components Algorithm
-------------------------------------------------+-------------------------
Reporter: borassi | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.9
Component: graph theory | Resolution:
Keywords: Strongly connected | Merged in:
components, Tarjan | Reviewers:
Authors: Michele Borassi | Work issues:
Report Upstream: N/A | Commit:
Branch: | Stopgaps:
Dependencies: |
-------------------------------------------------+-------------------------
Changes (by {'newvalue': u'Michele Borassi', 'oldvalue': ''}):
* author: => Michele Borassi
* cc: ncohen, dcoudert (added)
* component: PLEASE CHANGE => graph theory
* keywords: => Strongly connected components, Tarjan
* type: PLEASE CHANGE => enhancement
Old description:
New description:
Implement Tarjan's Strongly Connected Components algorithm. For more
information, see
!https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm.
--
--
Ticket URL: <http://trac.sagemath.org/ticket/19014#comment:1>
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.
