[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
## Re: [igraph] question about characteristic path length

**From**: |
Vincent Wolowski |

**Subject**: |
Re: [igraph] question about characteristic path length |

**Date**: |
Sat, 1 Dec 2007 15:01:57 +0100 |

Hello Tamas,
thank you very much for clarifying that calculating the average
geodesic length in a graph is the average shortest path length over
all pairs of vertices in a graph.
I was not sure about that.
Best regards,
Vincent
On Dec 1, 2007 2:26 PM, Tamas Nepusz <address@hidden> wrote:
>* > does igraph provide already a method that computes the characteristic*
>* > path length?*
>* I think what you call "characteristic path length" is what igraph calls the*
>* average shortest path length over all pairs of vertices. If you want to*
>* calculate this, try average.path.length in R, igraph_average_path_length in C*
>* or Graph.average_path_length() in Python.*
>
>* Best,*
>* --*
>* Tamas*
>
>
>* _______________________________________________*
>* igraph-help mailing list*
>* address@hidden*
>* http://lists.nongnu.org/mailman/listinfo/igraph-help*
>