#14122: Tournament and directed path constructors
---------------------------------+------------------------------------------
Reporter: ncohen | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-5.8
Component: graph theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers: David Coudert
Authors: Nathann Cohen | Merged in:
Dependencies: | Stopgaps:
---------------------------------+------------------------------------------
Changes (by dcoudert):
* status: needs_review => needs_work
* reviewer: => David Coudert
Comment:
Some remarks:
* Returns the De Bruijn diraph with parameters `k,n`. -> Returns the De
Bruijn digraph with parameters `k,n`.
* in both functions, the statement {{{g = DiGraph()}}} should be after the
test on n
* Returns a tournament `n` vertices. -> Returns a tournament on `n`
vertices. (twice in patch)
* for i in range(n) -> for i in range(n-1)
* d = {i:(i,0) for i in range(n)} \\
g.set_pos(d)\\
-> {{{g.set_pos( {i:(i,0) for i in range(n)} )}}}
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14122#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 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?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
