[graph-tool] Fastest way to get a random neighbor

Hi There, I was wondering what your thoughts were on the fastest way to get a random neighbor of a vertex? Right now I am doing something like: / outid = G.get_out_neighbours(v) outid = random.choice(outid)/ I'm trying to implement a type of random walk and have the above code wrapped in a for loop ~ 100000 iterations. Is there a better way to implement this? Thanks! -- Sent from: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/