#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):
> Hmmmm.... I think you went too quickly on what I wrote:
If the graph is a clique plus a loop, it does not satisfy your condition
and gets solved by the LP. Which then raises an exception.
Do you mean that you want me to add both sets of constraints to the list ?
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/14856#comment:7>
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.
