#9741: Sorting vertices of a graph
-----------------------------+----------------------------------------------
Reporter: rbeezer | Owner: jason, ncohen, rlm
Type: enhancement | Status: closed
Priority: minor | Milestone: sage-4.6
Component: graph theory | Resolution: fixed
Keywords: | Author: Rob Beezer
Upstream: N/A | Reviewer: Nathann Cohen
Merged: sage-4.6.alpha1 | Work_issues:
-----------------------------+----------------------------------------------
Comment(by rbeezer):
Mitesh,
It would appear the {{{dsc = lambda ...}}} change would certainly fix
this. But looking at the doctests, I remember now why I did what I did.
All the other tests have keys made from lambda functions. I wanted to
show how you could write out the fully-qualified name of some function (I
could have imported it, as well) and use that as the {{{key}}} function.
Would it be so bad to just adjust the modules to the new names? I could
add some documentation to make it clear why this construct looks a bit
odd. But I think it would be educational for people not 100% familiar
with Python having functions as first-class objects.
Rob
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9741#comment:19>
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.
