#13058: Hall-Janko Graph
------------------------------------------------------------------------------------------+
Reporter: ncohen
| Owner: jason, ncohen, rlm
Type: enhancement
| Status: positive_review
Priority: major
| Milestone: sage-5.1
Component: graph theory
| Resolution:
Keywords:
| Work issues:
Report Upstream: N/A
| Reviewers: Keshav Kini, Dima Pasechnik
Authors: Nathann Cohen, Dima Pasechnik
| Merged in:
Dependencies: #12942, #12945, #12952, #12971, #12980, #12981, #12982,
#12989, #13038 | Stopgaps:
------------------------------------------------------------------------------------------+
Comment (by kini):
Well, actually it is currently
{{{#!python
edge_list = []
for u, v in edges:
edge_list.append((int(u),int(v)))
g = graph.Graph(edge_list, pos={})
}}}
If the last line had been indented like Dima said it would be much, much
worse :P
An even faster way is probably the following:
{{{#!python
g = graph.Graph(((int(u), int(v)) for u,v in edges), pos={})
}}}
And we shouldn't need `pos={}` in order to use `_circle_embedding()` and
`_line_embedding()` either.
Good catch, Dima - not sure why I missed that...
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13058#comment:16>
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.
