Re: [igraph] average.path.length

[Moses Boudourides]

Hi,
I think, you've just said it: "it will ignore the nodes that are
unconnected." Unless you mean something else.
--Moses

On Wed, Sep 14, 2011 at 12:37 PM, 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
>