#9485: Fix strongly_connected_components_digraph to actually do something
---------------------------------+------------------------------------------
Reporter: nthiery | Owner: jason, ncohen, rlm
Type: defect | Status: new
Priority: major | Milestone: sage-4.5.1
Component: graph theory | Keywords: strongly connected components
Author: Nicolas M. Thiéry | Upstream: N/A
Reviewer: Robert Miller | Merged:
Work_issues: |
---------------------------------+------------------------------------------
Graphs produced with strongly_connected_components_digraph had no
edges in them due to a typo in the code:
{{{
sage: g = DiGraph({0:[1,2,3],1:[2],2:[1,3]})
sage: scc_digraph = g.strongly_connected_components_digraph()
sage: scc_digraph.vertices()
[{0}, {3}, {1, 2}]
sage: scc_digraph.edges()
[]
}}}
After this patch, the result is more likely to be correct:
{{{
[({0}, {3}, None), ({0}, {1, 2}, None), ({1, 2}, {3}, None)]
}}}
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9485>
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.
