#9741: Sorting vertices of a graph
----------------------------+-----------------------------------------------
Reporter: rbeezer | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: minor | Milestone: sage-4.5.3
Component: graph theory | Keywords:
Author: Rob Beezer | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
Comment(by rbeezer):
Replying to [comment:2 jason]:
> Great idea! So what about those functions that call vertices(), like
adjacency matrix, for example? Will they have a default key?
The default value for key (in Python) is None. I've specified None as the
default for the key argument in this new function, so the behavior should
be unchanged in other places that call vertices(), though after this patch
that could be changed easily. This patch is really just a convenience,
but more about highlighting that you should think about how the sorting is
going to work (or not work) if you have "exotic" objects for vertices.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9741#comment:3>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
