#13242: Determine if an edge in a graph is a cut-edge (bridge)
------------------------------------------------+---------------------------
Reporter: lkeough | Owner: jason,
ncohen, rlm
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-5.3
Component: graph theory | Resolution:
Keywords: days40 | Work issues:
Report Upstream: N/A | Reviewers: David Coudert
Authors: Jeremy Martin, Lauren Keough | Merged in:
Dependencies: | Stopgaps:
------------------------------------------------+---------------------------
Comment (by lkeough):
Replying to [comment:16 lkeough]:
> Faster is certainly better so I don't mind. When I replace this and run
the tests it fails the very first example - if an edge in K_4 is a cut
edge. I messed around in the Sage notebook and it also seems to be a
problem there. The algorithm is correct so I'm probably just implementing
this wrong. All I did was replace the lines after #We search for a
path..
I see now..we want return not ans. Because if self.distance(u,v) <
self.order() then (u,v) is not a cut-edge.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13242#comment:17>
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.
