#16362: Polar Graph
-------------------------------------+-------------------------------------
Reporter: ncohen | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.3
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: Nathann Cohen | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
public/ticket/16362 | f1e4fb3030235b2908b2c1d1355413673aaf75cc
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by dimpase):
I'd also like to point out that the way `F(x,y)` in the code is computed
is rather weird and hard to read. A much more straightforward
implementation would just be
`F=lambda x,y: vector(x)*M*vector(y)`
for `M` the matrix of the form; i.e. do not convert `M` into a dictionary.
--
Ticket URL: <http://trac.sagemath.org/ticket/16362#comment:5>
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/d/optout.
