#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 dcoudert):
> > 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.
Hmmmm.... I think you went too quickly on what I wrote: If you know that
the digraph has N*(N-1) arcs '''and''' that loops and multiple arcs are
forbidden, then you know that the digraph is a clique, isn't it? If loops
or multiple edges are allowed, clearly you have to go through all edges.
Adding this simple test could save a lot of time.
--
Ticket URL: <http://trac.sagemath.org/ticket/14856#comment:6>
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.
