#14856: Bug in GenericGraph.vertex_connectivity when the digraph is a tournament
---------------------------------+----------------------------------
Reporter: ncohen | Owner: jason, ncohen, rlm
Type: defect | Status: needs_review
Priority: major | Milestone: sage-5.12
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: Nathann Cohen | Reviewers: David Coudert
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
---------------------------------+----------------------------------
Comment (by ncohen):
Yoooooooooo !!
> In the test {{{(g.is_directed() and g.size() >= (g.order()-1*g.order())
and all(g.has_edge(u,v) for u in g for v in g if v != u)))}}} you should
add () around g.order()-1.
Oops.
> Furthermore, you should add the simple test I have proposed because it
is way faster for digraphs without loops or multiple edges.
Create a complete digraph, add a loop and compute the vertex connectivity
--> an exception is raised by the LP solver. That's why I wrote this
version instead.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/14856#comment:5>
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 unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/groups/opt_out.
