#14856: Bug in GenericGraph.vertex_connectivity when the digraph is a tournament
---------------------------------+----------------------------------
Reporter: ncohen | Owner: jason, ncohen, rlm
Type: defect | Status: positive_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):
* status: needs_review => positive_review
Comment:
I agree this is an ugly test, but it is efficient ;-)
{{{
sage: G = DiGraph(graphs.CompleteGraph(10))
sage: %timeit G.vertex_connectivity()
100000 loops, best of 3: 4.98 us per loop
sage: G.allow_loops(True)
sage: G.add_edge(0,0)
sage: %timeit G.vertex_connectivity()
1000 loops, best of 3: 266 us per loop
}}}
Install OK, functionality OK, test OK => the patch is good to go.
--
Ticket URL: <http://trac.sagemath.org/ticket/14856#comment:10>
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.
