[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, 9 Dec 2009 19:45:51 +0100

Hi Alisa,

it is the average of all path lengths if the graph. This means
n(n-1)/2 paths in undirected graphs or if the 'directed' argument is
FALSE, and n(n-1) paths in directed graphs when the 'directed'
argument is TRUE.

For unconnected (or not strongly connected) graphs see the
'unconnected' argument.


On Wed, Dec 9, 2009 at 7:35 PM, Alisa Coffin <address@hidden> wrote:
> Hello Gabor,
> I have a very simple question, but one for which I need some clarification
> since I don't have access to the reference text by West. Can you please tell
> me the equation you used to calculate the average path length in igraph?
> Thank you!
> Alisa.
> Alisa Coffin, PhD
> email: address@hidden
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help

Gabor Csardi <address@hidden>     UNIL DGM

reply via email to

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