#11099: digraphs.RandomDirectedGNM
-----------------------------+----------------------------------------------
Reporter: ncohen | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.7.2
Component: graph theory | Keywords:
Work_issues: | Upstream: N/A
Reviewer: David Coudert | Author: Nathann Cohen
Merged: | Dependencies:
-----------------------------+----------------------------------------------
Comment(by ncohen):
Ok, by email David told me that he had a more efficient version of this
method, using dictionaries to cache the edges and improve the ``has_edge``
test.
to David : I hope you will like this new version. While I was at it, I
also looked a bit into random number generation, and ... well.. There was
some speedup hidden there too :-)
The code comes with its comments.
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11099#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 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.
