[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
## Re: [igraph] average.path.length

**From**: |
Gábor Csárdi |

**Subject**: |
Re: [igraph] average.path.length |

**Date**: |
Wed, 14 Sep 2011 12:04:42 -0400 |

>*From http://igraph.sourceforge.net/doc/R/shortest.paths.html :*
average.path.length(graph, directed=TRUE, unconnected=TRUE)
unconnected What to do if the graph is unconnected (not strongly
connected if directed paths are considered). If TRUE only the lengths
of the existing paths are considered and averaged; if FALSE the length
of the missing paths are counted having length vcount(graph), one
longer than the longest possible geodesic in the network.
Gabor
On Wed, Sep 14, 2011 at 5:37 AM, Thomas <address@hidden> wrote:
>* If g looks like this:*
>
>* http://www.nottingham.ac.uk/~liztc/M30603Probs.png*
>
>* can anyone explain what average.path.length(g) will calculate? I assume it*
>* will ignore the nodes that are unconnected, but how would it deal with paths*
>* between a node in one group and a node in another group not connected to the*
>* first?*
>
>* Thank you,*
>
>* Thomas*
>
>* _______________________________________________*
>* igraph-help mailing list*
>* address@hidden*
>* https://lists.nongnu.org/mailman/listinfo/igraph-help*
>
--
Gabor Csardi <address@hidden> MTA KFKI RMKI