#7671: strongly_connected_components in c_graphs
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: rlm
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.3.1
Component: graph theory | Keywords:
Work_issues: | Author:
Upstream: N/A | Reviewer:
Merged: |
----------------------------+-----------------------------------------------
Description changed by ncohen:
Old description:
> The function strongly_connected_components uses Networkx for the moment.
> As c_graphs are to become the standard implementation of graphs in Sage,
> this function should be rewritten in Cython.
New description:
The function strongly_connected_components uses Networkx for the moment.
As c_graphs are to become the standard implementation of graphs in Sage,
this function should be rewritten in Cython.
This functions should be able to return two types of data :
* A list of lists : as the function connected_components
* A digraph whose vertices are [immutable Sets representing a set of
vertices defining a strongly connected components] and such that there is
an edge between A and B if there is an arc from one vertex of A to one
vertex of B.
This because, the graph strongly connected components is acyclic, which is
sometimes useful.
Nathann
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7671#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 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.
