Changes between Initial Version and Version 1 of Ticket #7569


Ignore:
Timestamp:
02/23/10 10:25:18 (11 years ago)
Author:
ncohen
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #7569

    • Property Status changed from new to needs_review
  • Ticket #7569 – Description

    initial v1  
    1 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 ).
     1In many algorithms we want to find a random vertex or a random edge in a graph.
    22
    3 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 )
     3Here it is !
     4
     5Nathann