#13289: Determine if a vertex is a cut vertex
---------------------------------+------------------------------------------
Reporter: dcoudert | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.3
Component: graph theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: David Coudert | Merged in:
Dependencies: | Stopgaps:
---------------------------------+------------------------------------------
Changes (by dcoudert):
* cc: lkeough (added)
* status: new => needs_review
Old description:
> This patch test if a given vertex is a cut vertex, that is if its removal
> from the (di)graph increases the number of (weakly) connected components.
New description:
This patch test if a given vertex is a cut vertex, that is if its removal
from the (di)graph increases the number of (weakly) connected components.
For digraphs, this patch considers weakly connected components, but it
could also considers strongly connected components. I'm not sure of the
most relevant definition.
--
Comment:
I'm not fully satisfied of this patch, but I have no better implementation
in mind.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13289#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.
