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 [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
