#15022: adjacency graph for a triangulation
-------------------------------------------------+-------------------------
Reporter: ursula | Owner:
Type: enhancement | Status:
Priority: minor | needs_work
Component: combinatorics | Milestone:
Keywords: | sage-5.12
Authors: Stephen Farley, Ursula | Resolution:
Whitcher | Merged in:
Report Upstream: N/A | Reviewers:
Branch: | Work issues:
Stopgaps: | Dependencies:
-------------------------------------------------+-------------------------
Changes (by ncohen):
* status: needs_review => needs_work
Comment:
Looks like your function could be replaced with
{{{
def adjacency_graph(self):
vertices = map(Set,list(self))
return Graph((vertices,
lambda x,y: len(x-y)==1))
}}}
You also need to add a space after "sage: " in your example, and you
should ensure that your new method passes doctests before uploading the
patch. Here's how you try that :
{{{
sage -b && sage -t element.py
}}}
To build and check the html documentation, you can do
{{{
sage -b && sage -docbuild reference/geometry html
}}}
Have fun ! `:-)`
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/15022#comment:4>
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.
