#12362: Improvement of GNP generators for graphs and digraphs
----------------------------+-----------------------------------------------
Reporter: dcoudert | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: minor | Milestone: sage-5.0
Component: graph theory | Keywords: directed graphs, generators
Work_issues: | Upstream: N/A
Reviewer: | Author:
Merged: | Dependencies:
----------------------------+-----------------------------------------------
Comment(by dcoudert):
Hello Nathann,
The ``fast`` method is expected to be faster for *large* and *sparse*
graphs, e.g., ``N=10000`` and ``p=0.0001``. But even for such values, the
standard method is already fast. Otherwise, the standard method is
sufficient.
Since I don't know how to solve the deviation problem you have pointed out
(I'm not the designer of the algorithm) and that it is not so useful, I
propose to simply remove it from the Cython RandomGNP function and from
the RandomDirectedGNP function. For the ``graphs.RandomGNP`` function, the
fast method of ``networkx`` has no deviation so we can let it.
We should also remove the tests with cputime. They are quite old and will
differ from one computer to another.
If you agree with these proposition, I will prepare a rev-rev patch ;-)
D.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12362#comment:13>
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.
