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

[Qunawei Zhang]

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