Re: [igraph] BFS of a certain number of steps

[Ahmed Abdeen Hamed]

It would be ideal if I can do a random walk that starts with a vertex and randomly selects the next node until the path lengths is satisfied. I tried community_walktrap() but it doesn't seem to be giving me what I need. 

-Ahmed

On Thu, Feb 20, 2014 at 11:38 PM, Ahmed Abdeen Hamed <address@hidden> wrote:

Hello friends,

How can I perform graph traversal using BFS with a certain number of steps? Say I want start start with a source node s and then step when I find n number of traversed vertices?

Much appreciated!

-Ahmed