|
| From: | J Biel |
| Subject: | [igraph] RE: problem using diameter and shortest.paths |
| Date: | Wed, 24 Jun 2009 18:03:05 +0000 |
|
Great! I modified the function to be: indiam = function(node,g){ tmp=shortest.paths(g,node,mode="out") val=max(tmp[which(tmp<Inf)]) return(val) } and both methods return the same result. Using this function I'm able compute the diameter of a huge graph (half million nodes) prallelising the computation ... Thanks 4 ur help Diferentes formas de estar en contacto con amigos y familiares. Descúbrelas. Descúbrelas. |
| [Prev in Thread] | Current Thread | [Next in Thread] |