#19348: edge_connectivity and vertex labels
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: defect | Status: needs_work
Priority: major | Milestone: sage-6.9
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jmantysalo/edge_connectivity_and_vertex_labels|
b788ce79747c84570a25800c71ca0281467f5cea
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Changes (by jmantysalo):
* status: needs_review => needs_work
* author: Jori Mäntysalo =>
Comment:
Replying to [comment:4 ncohen]:
> Sorry but the "bug" is more in the boost function that in
generic_graph.py. Otherwise we still have a function somewhere that takes
a vertex-labelled graph as input and returns an integer-labelled answer.
OK. I mark this as needs_work. (And let others to do it.)
> Furthermore, it is in any case better if instead of having a doctest
returning 'a' you just check that the vertex belongs to the graph: the
answer 'b' would be valid too.
Ah, then I misunderstood some documentation about this kind of functions.
Assuming for example that vertices are ASCII-strings, will `.vertices()`
give them alphabetically?
--
Ticket URL: <http://trac.sagemath.org/ticket/19348#comment:5>
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.
