#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:
---------------------------------+----------------------------------
Changes (by dcoudert):
* reviewer: => David Coudert
Comment:
Hello,
For me the patch is already good to go, but I have a few remarks
* For directed graphs: can't we say that when {{{D.allows_loops()==False
and D.allows_multiple_edges()==False and
D.size()==D.order()*(D.order()-1)}}} then we can safely return N-1?
* Could you also get rid of the 0.0 and 1.0?
David.
--
Ticket URL: <http://trac.sagemath.org/ticket/14856#comment:2>
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.
