Re: [igraph] question about average.path.length(graph, directed=TRUE, unconnected=TRUE)

[Tamas Nepusz]

Hello,

What else would you do with them? :) Obviously we cannot count them with an infinite distance because that would make the average distance infinite as well. We cannot ignore them either, because a disconnected graph with 1 million vertices and a single edge would have an average path length of 1 if we did that. So, the best we can do is to take them into account with a distance that is larger than any possible "real" path length within the graph.

T.

T.

On Sun, Sep 6, 2015 at 2:37 PM, Qunawei Zhang <address@hidden> wrote:

Hello:

Would you please explain more how you calculate the distance among unconnected nodes? Why the length of the missing paths are counted having length vcount(graph). Thanks

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. Best Quanwei

_______________________________________________
igraph-help mailing list
address@hidden
https://lists.nongnu.org/mailman/listinfo/igraph-help