Re: [igraph] About the command => average.path.length(graph, directed=TRUE, unconnected=TRUE)

[Gábor Csárdi]

On Tue, Jan 10, 2012 at 7:02 PM, Carlos Eduardo <address@hidden> wrote:
[...]
> About the parameter “unconnected=TRUE”, is it related to networks with two
> or more components? Or is it related to other network feature? Just as an
> example, I send attached an image of the simple network I am work with (in
> this case unconnected=FALSE).

>From the manual:

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.

G.

>
>
> I am not sure it is related to the same question yet, but in
> average.path.length measure, what is the situation of an actor as J or M,
> which have just outdegrees? They couldn’t be “paths”, once nothing comes
> until them…
>
>
>
> Many thanks,
>
>
>
> Cadu
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help
>



-- 
Gabor Csardi <address@hidden>     MTA KFKI RMKI