#13289: Determine if a vertex is a cut vertex
---------------------------------+------------------------------------------
Reporter: dcoudert | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_work
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:
---------------------------------+------------------------------------------
Comment (by sluther):
At least for the undirected case you could perform two DFSs and count the
visited vertices. The first search would start at v and run on the orginal
graph. The second one would ignore all edges incident to v and start at
any neighbor of v. If v is not a cut vertex, the number of visited
vertices should decrese only by 1.
For the first search you could call connected_component_containing_vertex.
For the second run you need to inline the code and add the ability to
ignore edges.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13289#comment:13>
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.
