#19348: edge_connectivity and vertex labels
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: defect | Status: needs_review
Priority: major | Milestone: sage-6.9
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: Michele Borassi | Reviewers: Vincent Delecroix
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/borassi/edge_connectivity_and_vertex_labels|
7f3c0b9385b1c1353e04ffe8775eb7e546bac3c3
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by borassi):
Sorry, I have troubles understanding your comment. After you said that
lists were better than dictionaries, I transformed all dictionaries named
`int_to_vertex` into lists (there were several other routines where these
dictionaries were used: these routines were correct, but the new version
is simpler and more efficient).
Am I missing some points?
Replying to [comment:15 jmantysalo]:
> FYI I did some more testing and it seems that `vertex_connectivity()`,
`line_graph()` etc etc. does not have same kind of bug.
>
> I guess this could be on checklist for reviewers. This applies to all
kind of containers, like graphs and sets.
--
Ticket URL: <http://trac.sagemath.org/ticket/19348#comment:16>
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/d/optout.
