#20575: Iterator over random vertices/edges
-------------------------+-------------------------------------------------
Reporter: | Owner:
dcoudert | Status: needs_review
Type: | Milestone: sage-7.3
enhancement | Resolution:
Priority: minor | Merged in:
Component: graph | Reviewers:
theory | Work issues:
Keywords: | Commit:
Authors: David | cfb92adf9a381ab9022ede1b22d4ba3b8bd3439e
Coudert | Stopgaps:
Report Upstream: N/A |
Branch: |
u/dcoudert/20575 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by dcoudert):
I was not aware of the `choice()` method. Thanks.
For empty graphs, I checked what is done for `edge_iterator` and I propose
to follow it, that is do nothing. I have added appropriate tests.
--
Ticket URL: <http://trac.sagemath.org/ticket/20575#comment:10>
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 https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
