#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: Sebastian Luther
Authors: David Coudert | Merged in:
Dependencies: | Stopgaps:
---------------------------------+------------------------------------------
Comment (by dcoudert):
Yes, all neighbors of v are in the same connected component. I have
replaced the code with {{{CC = [self.vertex_iterator()]}}}.
I did several tests to see if it would be faster to duplicate the code to
avoid the test {{{w in CC}}} but then we need to add the test {{{w != u}}}
which takes some time as well (although very little) and overall the
difference is very small. So I have finally decided not to duplicate the
code.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13289#comment:23>
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.
