[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [igraph] graph.bfs with multiple root vertices

From: Tamás Nepusz
Subject: Re: [igraph] graph.bfs with multiple root vertices
Date: Wed, 11 Sep 2013 16:00:44 +0200

Dear Santiago,

Looks like a bug in graph.bfs for me :( Since it appears to involve the R 
interface only, I'd rather wait for Gábor to confirm.


On 11 Sep 2013, at 07:04, santiago gil <address@hidden> wrote:

> Hello all,
> I'm puzzled by the behavior of the function graph.bfs() when I try to run in 
> starting from more than one root vertex. No matter what I ask it to calculate 
> (say, order or distance) it just gives me all NaNs. I'm dealing with a large 
> (90000 vertices, 600000 edges) directed graph. When I run it from any one 
> single root vertex, the result is correct. When I input two I get a big long 
> list of NaN. Here's my command
> graph.bfs(citation_graph,root=2:3,neimode="out",unreachable=F,order=T)
> if I set unreachable=TRUE it works again, but that makes it run slower. Any 
> tips are appreciated.
> Cheers!
> Santiago
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help

reply via email to

[Prev in Thread] Current Thread [Next in Thread]