#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:
---------------------------------+------------------------------------------
Comment (by dcoudert):
You are right for 1 and 3. It's not obvious for me to write such stuff.
2: it's just that both are working. I changed to is_directed() which is
cleaner.
4: I did it. So far I have not seen any difference but it could be
interesting for some graphs, and it is strongly dependent on the dfs
ordering.
I have also changed seen from set to dict. It could be faster to access a
cell of a dictionary than to test is a elt is in a set. Furthermore, I
avoid testing w!=u by initializing seen[u] to True, so it will never be
considered.
Thanks for the comments.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13289#comment:16>
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.
