#7569: random_vertex and random_edge functions
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.3.4
Component: graph theory | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
Changes (by ncohen):
* status: new => needs_review
Old description:
> In many algorithms we want to find a random vertex or a random edge in a
> graph. It is also very often required to find, given a vertex, one edge
> adjacent to it ( for example in depth first or breadth first search ).
>
> This should be possible easily, and most importantly efficiently ( if
> possible, directly written in C ) as DFS and BFS are very slow when
> written in python ( same problem with Floyd Warshall for
> all_pairs_shortest_path and networkX's distance function )
New description:
In many algorithms we want to find a random vertex or a random edge in a
graph.
Here it is !
Nathann
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7569#comment:1>
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.
