#13665: New implementation of the blocks_and_cut_vertices method
---------------------------------+------------------------------------------
Reporter: dcoudert | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.5
Component: graph theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: David Coudert | Merged in:
Dependencies: | Stopgaps:
---------------------------------+------------------------------------------
Comment (by ncohen):
Well.. I have no idea what this algorithm returns when using on a DiGraph.
All I can tell is that it returns the blocks and cut vertices of the
underlying graph, but what does it mean in a DiGraph ?
Genus and is_gallai_graph should be moved to graph.py too, by the way.
Nothing to do in generic_graph either. This being said,
vertex_connectivity should definitely stay there, but there is no problem
with it as it only calls blocks_and_cut_vertices after checking that the
graph is NOT directed `:-)`
Well. If we are to do all this, let's do it in another patch, don't you
think ?
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13665#comment:9>
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.
