#10644: examples in Common Graphs doc not interpreted
-----------------------------+----------------------------------------------
Reporter: wsteiner | Owner: mvngu
Type: defect | Status: new
Priority: trivial | Milestone: sage-4.6.2
Component: documentation | Keywords: days28, beginner
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
-----------------------------+----------------------------------------------
Changes (by mvngu):
* priority: minor => trivial
* milestone: => sage-4.6.2
Comment:
We should have
{{{
def FibonacciTree(self, n):
r"""
Returns the graph of the Fibonacci Tree `F_{i}` of order `n`.
`F_{i}` is recursively defined as the a tree with a root vertex
and two attached child trees `F_{i-1}` and `F_{i-2}`, where
`F_{1}` is just one vertex and `F_{0}` is empty.
INPUT:
- ``n`` - the recursion depth of the Fibonacci Tree
EXAMPLES::
sage: g = graphs.FibonacciTree(3)
sage: g.is_tree()
True
sage: l1 = [ len(graphs.FibonacciTree(_)) + 1 for _ in
range(6) ]
sage: l2 = list(fibonacci_sequence(2,8))
sage: l1 == l2
True
AUTHORS:
- Harald Schilly and Yann Laigle-Chapuy (2010-03-25)
"""
}}}
And for the docstring of `HoffmanSingletonGraph()`, we should have
{{{
Note that you get a different layout each time you create the
graph. ::
sage: HS.layout()[1]
(-0.844..., 0.535...)
sage: graphs.HoffmanSingletonGraph().layout()[1]
(-0.904..., 0.425...)
}}}
Note the double colon "::".
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/10644#comment:2>
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.
